skip to main content
10.1145/3599589.3599607acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicmipConference Proceedingsconference-collections
research-article

Overlapping Community Discovery Algorithm Based on Seed Node Importance Selection

Published: 11 August 2023 Publication History

Abstract

Mining community structure in a complex network is of great theoretical and practical significance to real life. optimization algorithm, LFM algorithm, takes a random approach in selecting seed nodes, which leads to un-stable quality of generated communities. this paper, the importance of nodes is defined as the basis for seed node selection with the help of the density peak clustering idea. The set of nodes with high node importance and their neighbors are selected as seed nodes, the seed nodes are expanded; the isolated node attribution in the network is calculated; Finally, similar communities are merged to obtain the final community structure. Experiments on real datasets and LFR benchmark network datasets can finally obtain higher quality community structure.

References

[1]
Cai Z, Wang X, Ren X. A Review of Complex Network Theory and Its Application in Systems[J]. Power System Technology, 2012, 36(11):114-121.
[2]
Girvan M, Newman M. Girvan, M. & Newman, M. E. J. Community structure in social and biological networks. Proc. Natl Acad. Sci. USA 99, 7821-7826[J]. Proceedings of the National Academy of Sciences, 2002, 99(12):7821-7826.
[3]
Lancichinetti A, Fortunato S, Kertész J. Detecting the overlapping and hierarchical community structure of complex networks[J]. New Journal of Physics, 2009,11(3):19-44.
[4]
Lee C, Reid F, Mcdaid A, Detecting highly overlapping community structure by greedy clique expansion[J]. 2010.
[5]
Baumes J, Goldberg M K, Krishnamoorthy M S, Finding communities by clustering a graph into overlapping subgraphs[C]// AC 2005, Proceedings of the IADIS International Conference on Applied Computing, Algarve, Portugal, February 22-25, 2005, 2 Volumes. DBLP, 2005.
[6]
Wang X, Liu G, Li J, Locating Structural Centers: a Density-Based Clustering Method for Community Detection[J]. PLoSONE, 2017, 12(1): e0169355.
[7]
Zhu Z, Yuan C. A local extension class overlapping community discovery algorithm incorporating H-index[J]. Small Microcomputer Systems,2019,40(01):20-25.
[8]
Rodriguez, A., & Liao, A. (2014). Clustering by fast search and find of density peaks. Science, 344, 1492 - 1496.
[9]
Wayne W. Zachary. An Information Flow Model for Conflict and Fission in Small Groups[J]. Journal of Anthropological Research, 1977, 33(4).
[10]
Girvan M, Newman M E J. Community structure in social and biological networks[J]. Proceedings of the National Academy of Sciences of the United States of America,2002,99(12).
[11]
Newman M. E. J. Finding community structure in networks using the eigenvectors of matrices[J]. PHYSICAL REVIEW E, 2006, 74(3).
[12]
Leskovec J, Kleinberg J, Faloutsos C. Graph Evolution: Densification and Shrinking Diameters[J]. Acm Transactions on Knowledge Discovery from Data, 2007, 1(1):2.
[13]
Hu C M B. Detect overlapping and hierarchical community structure in networks[J]. Physical A: Statistical Mechanics and its Applications, 2009.
[14]
Liu J, Wang D, Zhao W, A community mining algorithm based on core nodes expansion[J]. Journal of Shandong University, 2016.

Cited By

View all
  • (2024)Community Detection Algorithm Based On High-Order Variational Graph Autoencoder2024 6th Asia Symposium on Image Processing (ASIP)10.1109/ASIP63198.2024.00029(118-124)Online publication date: 13-Jun-2024

Index Terms

  1. Overlapping Community Discovery Algorithm Based on Seed Node Importance Selection

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    ICMIP '23: Proceedings of the 2023 8th International Conference on Multimedia and Image Processing
    April 2023
    131 pages
    ISBN:9781450399586
    DOI:10.1145/3599589
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 11 August 2023

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Research-article
    • Research
    • Refereed limited

    Funding Sources

    • Tianjin Science and Technology Planning Project

    Conference

    ICMIP 2023

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)5
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 25 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Community Detection Algorithm Based On High-Order Variational Graph Autoencoder2024 6th Asia Symposium on Image Processing (ASIP)10.1109/ASIP63198.2024.00029(118-124)Online publication date: 13-Jun-2024

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format.

    HTML Format

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media