IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v446y2016icp138-151.html
   My bibliography  Save this article

A new algorithm CNM-Centrality of detecting communities based on node centrality

Author

Listed:
  • Hu, Fang
  • Liu, Yuhua

Abstract

The discovery and analysis of community structure in complex networks is a hot issue in recent years. In this paper, based on the fast greedy clustering algorithm CNM with the thought of local search, the introduction of the idea of node centrality and the optimal division of the central nodes and their neighbor nodes into correct communities, a new algorithm CNM-Centrality of detecting communities in complex networks is proposed. In order to verify the accuracy and efficiency of this algorithm, the performance of this algorithm is tested on several representative real-world networks and a set of computer-generated networks by LFR-benchmark. The experimental results indicate that this algorithm can identify the communities accurately and efficiently. Furthermore, this algorithm can also acquire higher values of modularity and NMI than the CNM, Infomap, Walktrap algorithms do.

Suggested Citation

  • Hu, Fang & Liu, Yuhua, 2016. "A new algorithm CNM-Centrality of detecting communities based on node centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 446(C), pages 138-151.
    • Handle: RePEc:eee:phsmap:v:446:y:2016:i:c:p:138-151
    DOI: 10.1016/j.physa.2015.10.083
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437115009425
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2015.10.083?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sun, Peng Gang, 2014. "Weighting links based on edge centrality for community detection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 394(C), pages 346-357.
    2. Guimera, R. & Danon, L. & Diaz-Guilera, A. & Giralt, F. & Arenas, A., 2006. "The real communication network behind the formal chart: Community structure in organizations," Journal of Economic Behavior & Organization, Elsevier, vol. 61(4), pages 653-667, December.
    3. Duncan J. Watts, 2007. "A twenty-first century science," Nature, Nature, vol. 445(7127), pages 489-489, February.
    4. Gong, Maoguo & Liu, Jie & Ma, Lijia & Cai, Qing & Jiao, Licheng, 2014. "Novel heuristic density-based method for community detection in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 403(C), pages 71-84.
    5. Pablo M. Gleiser & Leon Danon, 2003. "Community Structure In Jazz," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 6(04), pages 565-573.
    6. Cui, Yaozu & Wang, Xingyuan, 2014. "Uncovering overlapping community structures by the key bi-community and intimate degree in bipartite networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 407(C), pages 7-14.
    7. Jiang, Yawen & Jia, Caiyan & Yu, Jian, 2013. "An efficient community detection method based on rank centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(9), pages 2182-2194.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mustafa Alassad & Muhammad Nihal Hussain & Nitin Agarwal, 2022. "Comprehensive decomposition optimization method for locating key sets of commenters spreading conspiracy theory in complex social networks," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(1), pages 367-394, March.
    2. Hu, Fang & Liu, Jia & Li, Liuhuan & Liang, Jun, 2020. "Community detection in complex networks using Node2vec with spectral clustering," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    3. Li, Shunlong & Wang, Jie & He, Shaoyang, 2023. "Connectivity probability evaluation of a large-scale highway bridge network using network decomposition," Reliability Engineering and System Safety, Elsevier, vol. 236(C).
    4. Inga J. Sauer & Elisabet Roca & Míriam Villares, 2021. "Integrating climate change adaptation in coastal governance of the Barcelona metropolitan area," Mitigation and Adaptation Strategies for Global Change, Springer, vol. 26(4), pages 1-27, May.
    5. Dongwook Kim & Sungbum Kim, 2017. "The Role of Mobile Technology in Tourism: Patents, Articles, News, and Mobile Tour App Reviews," Sustainability, MDPI, vol. 9(11), pages 1-45, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yazdanparast, Sakineh & Havens, Timothy C., 2017. "Modularity maximization using completely positive programming," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 471(C), pages 20-32.
    2. You, Tao & Cheng, Hui-Min & Ning, Yi-Zi & Shia, Ben-Chang & Zhang, Zhong-Yuan, 2016. "Community detection in complex networks using density-based clustering algorithm and manifold learning," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 464(C), pages 221-230.
    3. Wang, Tao & Yin, Liyan & Wang, Xiaoxia, 2018. "A community detection method based on local similarity and degree clustering information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 490(C), pages 1344-1354.
    4. Hu, Fang & Liu, Jia & Li, Liuhuan & Liang, Jun, 2020. "Community detection in complex networks using Node2vec with spectral clustering," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    5. Wang, Tao & Wang, Hongjue & Wang, Xiaoxia, 2015. "A novel cosine distance for detecting communities in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 437(C), pages 21-35.
    6. Leila M Naeni & Hugh Craig & Regina Berretta & Pablo Moscato, 2016. "A Novel Clustering Methodology Based on Modularity Optimisation for Detecting Authorship Affinities in Shakespearean Era Plays," PLOS ONE, Public Library of Science, vol. 11(8), pages 1-27, August.
    7. Sho Tsugawa & Yukihiro Matsumoto & Hiroyuki Ohsaki, 2015. "On the robustness of centrality measures against link weight quantization in social networks," Computational and Mathematical Organization Theory, Springer, vol. 21(3), pages 318-339, September.
    8. Shang, Ronghua & Luo, Shuang & Li, Yangyang & Jiao, Licheng & Stolkin, Rustam, 2015. "Large-scale community detection based on node membership grade and sub-communities integration," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 428(C), pages 279-294.
    9. Li, Yafang & Jia, Caiyan & Yu, Jian, 2015. "A parameter-free community detection method based on centrality and dispersion of nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 438(C), pages 321-334.
    10. Jing Wang & Jing Wang & Jingfeng Guo & Liya Wang & Chunying Zhang & Bin Liu, 2023. "Research Progress of Complex Network Modeling Methods Based on Uncertainty Theory," Mathematics, MDPI, vol. 11(5), pages 1-27, March.
    11. Zhang, Yun & Liu, Yongguo & Li, Jieting & Zhu, Jiajing & Yang, Changhong & Yang, Wen & Wen, Chuanbiao, 2020. "WOCDA: A whale optimization based community detection algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 539(C).
    12. Rezvanian, Alireza & Meybodi, Mohammad Reza, 2015. "Sampling social networks using shortest paths," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 424(C), pages 254-268.
    13. Chong Myung Park & Angelica Rodriguez & Jazmin Rubi Flete Gomez & Isahiah Erilus & Hayoung Kim Donnelly & Yanling Dai & Alexandra Oliver-Davila & Paul Trunfio & Cecilia Nardi & Kimberly A. S. Howard &, 2021. "Embedding Life Design in Future Readiness Efforts to Promote Collective Impact and Economically Sustainable Communities: Conceptual Frameworks and Case Example," Sustainability, MDPI, vol. 13(23), pages 1-17, November.
    14. Letchford, Adrian & Preis, Tobias & Moat, Helen Susannah, 2016. "The advantage of simple paper abstracts," Journal of Informetrics, Elsevier, vol. 10(1), pages 1-8.
    15. Liu, X. & Murata, T., 2010. "Advanced modularity-specialized label propagation algorithm for detecting communities in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(7), pages 1493-1500.
    16. Etienne Côme & Nicolas Jouvin & Pierre Latouche & Charles Bouveyron, 2021. "Hierarchical clustering with discrete latent variable models and the integrated classification likelihood," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 15(4), pages 957-986, December.
    17. Namtirtha, Amrita & Dutta, Animesh & Dutta, Biswanath, 2018. "Identifying influential spreaders in complex networks based on kshell hybrid method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 499(C), pages 310-324.
    18. Massimo Riccaboni & Anna Romiti & Gianna Giudicati, 2011. "Co-experience Network Dynamics: Lessons from the Dance Floor," DISA Working Papers 2011/02, Department of Computer and Management Sciences, University of Trento, Italy, revised 28 Mar 2011.
    19. Li, Yafang & Jia, Caiyan & Li, Jianqiang & Wang, Xiaoyang & Yu, Jian, 2018. "Enhanced semi-supervised community detection with active node and link selection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 510(C), pages 219-232.
    20. Hao Xu & Yuan Ran & Junqian Xing & Li Tao, 2023. "An Influence-Based Label Propagation Algorithm for Overlapping Community Detection," Mathematics, MDPI, vol. 11(9), pages 1-17, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:446:y:2016:i:c:p:138-151. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.