skip to main content
10.1145/3193077.3193086acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiccdaConference Proceedingsconference-collections
research-article

Overlapping Community Detection by Node-Weighting

Authors Info & Claims
Published:23 March 2018Publication History

ABSTRACT

Community detection is an important task with great practical value for understanding the structure and function of complex networks. However, in many social networks, a node may belong to more than one community. Thus, the detection of overlapping community is more significant. The local expansion algorithm using seeds to find overlapping communities is becoming increasingly popular, but how to choose suitable seeds and expand the local communities effectively is still a great challenge. In this paper, we propose a new overlapping community detection algorithm based on node-weighting (OCDNW). The main idea of the algorithm is to find a good seed and then greedily expand it based on an improved community quality metric. Finally it optimizes the community structure to ensure the quality of community partitioning. Experimental results on synthetic and real world networks prove that the proposed algorithm can detect overlapping communities successfully and outperform other state-of-the-art methods.

References

  1. Xie J, Kelley S, Szymanski BK. 2013. Overlapping community detection in networks: The state-of-the-art and comparative study. ACM. 1--35 p. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Amelio A, Pizzuti C. 2014. Overlapping Community Discovery Methods: A Survey. Lecture Notes in Social Networks. 105--25.Google ScholarGoogle Scholar
  3. Palla G, Derényi I, Farkas I, Vicsek T. 2005.Uncovering the overlapping community structure of complex networks in nature and society. Nature. 435(7043):814.Google ScholarGoogle ScholarCross RefCross Ref
  4. Ahn YY, Bagrow JP, Lehmann S. 2010. Link communities reveal multiscale complexity in networks. Nature. 466(7307):761.Google ScholarGoogle ScholarCross RefCross Ref
  5. Huang L, Wang G, Wang Y, Blanzieri E, Su C. 2013. Link Clustering with Extended Link Similarity and EQ Evaluation Division. Plos One. 8(6):e66005.Google ScholarGoogle ScholarCross RefCross Ref
  6. Lancichinetti A, Fortunato S, Kertész J. 2009. Detecting the overlapping and hierarchical community structure in complex networks. New Journal of Physics. 11(3):033015.Google ScholarGoogle ScholarCross RefCross Ref
  7. Lee C, Reid F, Mcdaid A, Hurley N. 2010. Detecting highly overlapping community structure by greedy clique expansion.Google ScholarGoogle Scholar
  8. Andrea L, Filippo R, Ramasco JJ, Santo F. 2011. Finding Statistically Significant Communities in Networks. Plos One. 6(4):e18961.Google ScholarGoogle ScholarCross RefCross Ref
  9. Psorakis I, Roberts S, Ebden M, Sheldon B. 2011. Overlapping community detection using Bayesian non-negative matrix factorization. Phys Rev E Stat Nonlin Soft Matter Phys. 83(2):066114.Google ScholarGoogle ScholarCross RefCross Ref
  10. Mcdaid A, Hurley N, editors. 2010. Detecting Highly Overlapping Communities with Model-Based Overlapping Seed Expansion. International Conference on Advances in Social Networks Analysis and Mining. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Wu Z-H, Lin Y-F, Gregory S, Wan H-Y, Tian S-F. 2012. Balanced Multi-Label Propagation for Overlapping Community Detection in Social Networks. Journal of Computer Science and Technology. 27(3):468--79.Google ScholarGoogle ScholarCross RefCross Ref
  12. Xie J, Szymanski BK, Liu X. 2012. SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process. IEEE, International Conference on Data Mining Workshops. 344--9. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Gregory S. 2010. Finding overlapping communities in networks by label propagation. New Journal of Physics. 12(10):103018.Google ScholarGoogle ScholarCross RefCross Ref
  14. Raghavan UN1 AR, Kumara S. 2007. Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E Stat Nonlin Soft Matter Phys. 76(3):036106.Google ScholarGoogle ScholarCross RefCross Ref
  15. De Meo P, Ferrara E, Fiumara G, Provetti A. 2014. On Facebook, most ties are weak. Communications of the ACM. 57(11):78--84. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Zhao W, Zhang F, Liu J. 2016. Local Community Detection via Edge Weighting. 9994:68--80.Google ScholarGoogle Scholar
  17. Xing Y MF, Zhou Y, Zhou R. 2015. Overlapping Community Detection by Local Community Expansion. Journal of Computing and Information Science in Engineering. 31:1--15.Google ScholarGoogle Scholar
  18. Yang J-X, Zhang X-D. 2017. Finding overlapping communities using seed set. Physica A: Statistical Mechanics and its Applications. 467:96--106.Google ScholarGoogle Scholar
  19. Lancichinetti A, Fortunato S, Radicchi F. 2008. Benchmark graphs for testing community detection algorithms. Physical Review E Statistical Nonlinear & Soft Matter Physics. 78(2):046110.Google ScholarGoogle ScholarCross RefCross Ref
  20. Nicosia V, Mangioni G, Carchiolo V, Malgeri M. 2008. Extending modularity definition for directed graphs with overlapping communities.Google ScholarGoogle Scholar
  21. Murray G, Carenini G, Ng R, editors. 2012. Using the omega index for evaluating abstractive community detection. The Workshop on Evaluation Metrics and System Comparison for Automatic Summarization. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Pizzuti C, Rombo SE. 2014. Algorithms and tools for protein-protein interaction networks clustering, with a special focus on population-based stochastic methods. Bioinformatics. 30(10):1343.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Overlapping Community Detection by Node-Weighting

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      ICCDA '18: Proceedings of the 2nd International Conference on Compute and Data Analysis
      March 2018
      94 pages
      ISBN:9781450363594
      DOI:10.1145/3193077

      Copyright © 2018 ACM

      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 ACM 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: 23 March 2018

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed limited

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader