skip to main content
10.1145/2063576.2063951acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
poster

On selection of objective functions in multi-objective community detection

Authors Info & Claims
Published:24 October 2011Publication History

ABSTRACT

There is a surge of community detection of complex networks in recent years. Different from conventional single-objective community detection, this paper formulates community detection as a multi-objective optimization problem and proposes a general algorithm NSGA-Net based on evolutionary multi-objective optimization. Interested in the effect of optimization objectives on the performance of the multi-objective community detection, we further study the correlations (i.e., positively correlated, independent, or negatively correlated) of 11 objective functions that have been used or can potentially be used for community detection. Our experiments show that NSGA-Net optimizing over a pair of negatively correlated objectives usually performs better than the single-objective algorithm optimizing over either of the original objectives, and even better than other well-established community detection approaches.

References

  1. A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70(06611), 2004.Google ScholarGoogle Scholar
  2. K. Deb, A. Pratab, S. Agarwal, and T. MeyArivan. A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Transaction on Evolutionary Computation, 6(2):182--197, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. Girvan1 and M. E. J. Newman. Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 99(12):7821--7826, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  4. J. Handle and J. Knowles. An evolutionary approach to multiobjective clustering. Transaction on Evolutionary Computation, 11(1):56--76, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. A. Lancichinetti, S. Fortunato, and F. Radicchi. Benchmark graphs for testing community detection algorithms. Physical Review E, 78(046110), 2008.Google ScholarGoogle Scholar
  6. J. Leskovec, K. J. Lang, and M. W. Mahoney. Empirical comparison of algorithms for network community detection. In WWW2010, pages 631--640, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. R. Martin and T. B. Carl. An information-theoretic framework for resolving community structure in complex networks. Proceedings of the National Academy of Sciences, 104(18):7327--7331, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  8. M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physics Review E, 69(026113), 2004.Google ScholarGoogle Scholar
  9. C. Pizzuti. Ga-net: a genetic algorithm for community detection in social networks. In PPSN2008, pages 1081--1090, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. C. Pizzuti. A multi-objective genetic algorithm for community detection in networks. In ICTAI09, pages 379--386, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. C. Shi, X. Kong, P. S. Yu, and B. Wang. Multi-label ensemble learning. In ECML/PKDD 2011, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. C. Shi, Z. Y. Yan, Y. Wang, Y. N. Cai, and B. Wu. A genetic algorithm for detecting communities in large-scale complex networks. Advance in Complex System, 13(1):3--17, 2010.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. On selection of objective functions in multi-objective community detection

    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 Conferences
      CIKM '11: Proceedings of the 20th ACM international conference on Information and knowledge management
      October 2011
      2712 pages
      ISBN:9781450307178
      DOI:10.1145/2063576

      Copyright © 2011 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: 24 October 2011

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • poster

      Acceptance Rates

      Overall Acceptance Rate1,861of8,427submissions,22%

      Upcoming Conference

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader