复杂网络中的组检测:一种算法及其比较
Group detection in complex networks: An algorithm and comparison of the state of the art
摘要:
复杂的现实世界网络通常揭示了社区和模块等节点的特征组。这些在各种应用中具有价值,特别是在大型社会和信息网络的情况下。然而,虽然许多社区发现技术已经在文献中提出,其他组的节点的方法是相对罕见的,往往在某种程度上受到限制。我们提出了一个简单的基于传播的算法一般组检测,不需要先验知识,并具有接近理想的复杂度。这里的主要新颖之处是,不同类型的群体,揭示了通过一个适当的层次组细化过程。所提出的算法在各种合成和真实世界的网络上进行了验证,并与其他12个国家的最先进的方法组检测,层次结构发现和链接预测任务进行了严格的比较。该算法在社区发现方面与现有技术相当,而在一般组检测和链接预测方面更胜一筹。在比较的基础上,我们还讨论了复杂网络中群体检测的一些重要研究方向。
英文摘要:
Complex real-world networks commonly reveal characteristic groups of nodes like communities and modules. These are of value in various applications, especially in the case of large social and information networks. However, while numerous community detection techniques have been presented in the literature, approaches for other groups of nodes are relatively rare and often limited in some way. We present a simple propagation-based algorithm for general group detection that requires no a priori knowledge and has near ideal complexity. The main novelty here is that different types of groups are revealed through an adequate hierarchical group refinement procedure. The proposed algorithm is validated on various synthetic and real-world networks, and rigorously compared against twelve other state-of-the-art approaches on group detection, hierarchy discovery and link prediction tasks. The algorithm is comparable to the state of the art in community detection, while superior in general group detection and link prediction. Based on the comparison, we also dis- cuss some prominent directions for future work on group detection in complex networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。