Empirical evaluation of applying ensemble methods to ego-centred community identification in complex networks

Abstract Unfolding the community structure of complex networks is still to be one of the most important tasks in the field of complex network analysis. However, in many real settings, we seek to uncover the community of a given node rather than partitioning the whole graph into communities. A main trend in the area of ego-centred community identification consists in applying a greedy optimization approach of a local modularity measure. Different local modularity functions have been proposed in the scientific literature. In this work, we explore applying different ensemble approaches in order to combine different local modularity functions. Explored approaches include naive combine-and-rank approach, ensemble ranking approaches, and ensemble clustering. Experiments are conducted on different real and artificial benchmark networks for which ground truth community partitions are known. Results show that ensemble-ranking approaches provide better results than both state-of-the art approaches and other ensemble approaches.

[1]  Ulrik Brandes,et al.  On Modularity Clustering , 2008, IEEE Transactions on Knowledge and Data Engineering.

[2]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[3]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[4]  James Bailey,et al.  Information theoretic measures for clusterings comparison: is a correction for chance necessary? , 2009, ICML '09.

[5]  Bin Wu,et al.  A Method for Local Community Detection by Finding Core Nodes , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[6]  Erik M Bollt,et al.  Local method for detecting communities. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Mathieu Bastian,et al.  Gephi: An Open Source Software for Exploring and Manipulating Networks , 2009, ICWSM.

[8]  Mirella Lapata,et al.  Automatic Evaluation of Information Ordering: Kendall’s Tau , 2006, CL.

[9]  Joydeep Ghosh,et al.  Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions , 2002, J. Mach. Learn. Res..

[10]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[11]  Maurice Tchuente,et al.  Local Community Identification in Social Networks , 2012, Parallel Process. Lett..

[12]  Moni Naor,et al.  Rank aggregation methods for the Web , 2001, WWW '01.

[13]  Yann Chevaleyre,et al.  A Short Introduction to Computational Social Choice , 2007, SOFSEM.

[14]  Nicolas de Condorcet Essai Sur L'Application de L'Analyse a la Probabilite Des Decisions Rendues a la Pluralite Des Voix , 2009 .

[15]  Inderjit S. Dhillon,et al.  Overlapping community detection using seed set expansion , 2013, CIKM.

[16]  Carla E. Brodley,et al.  Solving cluster ensemble problems by bipartite graph partitioning , 2004, ICML.

[17]  Prem Melville,et al.  Supervised Rank Aggregation for Predicting Influencers in Twitter , 2011, 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing.

[18]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[19]  Marina Meila,et al.  Comparing Clusterings by the Variation of Information , 2003, COLT.

[20]  Boleslaw K. Szymanski,et al.  Overlapping community detection in networks: The state-of-the-art and comparative study , 2011, CSUR.

[21]  A. Clauset Finding local community structure in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Randy Goebel,et al.  Local Community Identification in Social Networks , 2009, 2009 International Conference on Advances in Social Network Analysis and Mining.

[23]  Hao Huang,et al.  GMAC: A Seed-Insensitive Approach to Local Community Detection , 2013, DaWaK.

[24]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[25]  Jean-Loup Guillaume,et al.  Unfolding Ego-Centered Community Structures with "A Similarity Approach" , 2013, CompleNet.

[26]  Kwan Hui Lim,et al.  A Seed-Centric Community Detection Algorithm based on an Expanding Ring Search , 2013, AWC.

[27]  James P. Bagrow Evaluating local community methods in networks , 2007, 0706.3880.

[28]  S. Shapiro,et al.  Mathematics without Numbers , 1993 .

[29]  Feng Luo,et al.  Exploring Local Community Structures in Large Networks , 2006, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06).

[30]  Zhifeng Hao,et al.  Local Community Detection Using Link Similarity , 2012, Journal of Computer Science and Technology.

[31]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[32]  William M. Rand,et al.  Objective Criteria for the Evaluation of Clustering Methods , 1971 .

[33]  K. Arrow Social Choice and Individual Values , 1951 .

[34]  Bin Wu,et al.  A link clustering based overlapping community detection algorithm , 2013, Data Knowl. Eng..

[35]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[36]  Johan Dahlin,et al.  Ensemble approaches for improving community detection methods , 2013, ArXiv.

[37]  XieJierui,et al.  Overlapping community detection in networks , 2013 .