期刊文献+

A Link-Based Similarity for Improving Community Det ection Based on Label Propaga tion Algorithm

分享 导出
摘要 Community structure is one of the most best-known proper ties of complex networks. Finding communities help us analyze networks from a mesoscopic viewpoints instead of microscopic or macroscopic one. It helps to understand behavior grouping. Various community detection algorithms have been proposed with some shortcomings in time and space complexity, accuracy, or stability. Label Propagation Algorithm (LPA) is a popular method used for finding communities in an almost-linear time-consuming process. However, its performance is not satisfactory in some metrics such as accuracy and stability. In this paper, a new modified version of LPA is proposed to improve the stability and accuracy of the LPA by defining two concepts -nodes and link strength based on semi-local similarity-, while preserving its simplicity. In the proposed method a new initial node selection strategy, namely the tiebreak strategy, updating order and rule update are presented to solve the random behavior problem of original LPA. The proposed algorithm is evaluated on artificial and real networks. The experiments show that the proposed algorithm is close to linear time complexity with better accuracy than the original LPA and other compared met hods. Furthermore, the proposed algorithm has the robustness and stability advantages while the original LPA does not have these features.
出处 《系统科学与复杂性学报:英文版》 SCIE EI CSCD 2019年第3期737-758,共22页 Journal of Systems Science and Complexity
作者简介 BERAHMAND Kamal,Email: berahniand@azaruniv.ac.ir;BOUYER Asgarali:Email: a.bouyer@azaruniv.ac.ir.
  • 相关文献
投稿分析

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部 意见反馈