arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.06373cs.SImath.STstat.TH
收藏

一种基于博弈论方法的新边介数度量:在层次社区检测中的应用

A new edge betweenness measure using a game theoretical approach: an application to hierarchical community detection

Daniel Gómez, Javier Castro, Inmaculada Gutiérrez, Rosa Espínola

AI总结:

本文提出一种基于博弈论的新边介数度量(节点博弈最短路径介数),用于层次社区检测,并引入新标准评估,同时提出快速算法,在稀疏网络上计算复杂度为二次且性能优于其他快速算法。

摘要:

在本文中,我们正式将层次聚类网络问题(HCNP)定义为寻找网络的良好层次划分的问题。这个新问题关注的是聚类的动态过程,而非聚类过程的最终图像。为了解决这个问题,我们引入了一种新的网络层次聚类算法,该算法基于一种新的最短路径介数度量。为了计算该度量,每对节点之间的通信通过建立该通信的节点的重要性进行加权。与每对节点相关的权重或重要性被计算为一种博弈的Shapley值,该博弈被称为线性模块性博弈。这种新度量(节点博弈最短路径介数度量)被用于通过消除具有最高值的链接来获得网络的层次划分。为了评估我们算法的性能,我们引入了几个标准,使我们能够从模块性和同质性两个角度比较网络的不同树状图。最后,我们提出了一种基于节点博弈最短路径介数度量简化的更快算法,该算法在稀疏网络上的阶数为二次。这种快速版本在计算角度上与其他快速层次算法具有竞争力,并且通常提供更好的结果。

英文摘要:

In this paper we formally define the hierarchical clustering network problem (HCNP) as the problem to find a good hierarchical partition of a network. This new problem focuses on the dynamic process of the clustering rather than on the final picture of the clustering process. To address it, we introduce a new ierarchical clustering algorithm in networks, based on a new shortest path betweenness measure. To calculate it, the communication between each pair of nodes is weighed by he importance of the nodes that establish this communication. The weights or importance associated to each pair of nodes are calculated as the Shapley value of a game, named as the linear modularity game. This new measure, (the node-game shortest path betweenness measure), is used to obtain a hierarchical partition of the network by eliminating the link with the highest value. To evaluate the performance of our algorithm, we introduce several criteria that allow us to compare different dendrograms of a network from two point of view: modularity and homogeneity. Finally, we propose a faster algorithm based on a simplification of the node-game shortest path betweenness measure, whose order is quadratic on sparse networks. This fast version is competitive from a computational point of view with other hierarchical fast algorithms, and, in general, it provides better results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑