LICOD: A Leader-driven algorithm for community detection in complex networks

Leader-driven community detection algorithms (LdCD hereafter) constitute a new trend in devising algorithms for community detection in large-scale complex networks. The basic idea is to identify some particular nodes in the target network, called leader nodes, around which local communities can be computed. Being based on local computations, they are particularly attractive to handle large-scale networks. In this paper, we describe a framework for implementing LdCD algorithms, called LICOD. We propose also a new way for evaluating performances of community detection algorithms. This consists on transforming data clustering problems into a community detection problems. External criteria for evaluating obtained clusters can then be used for comparing performances of different community detection approaches. Results we obtain show that our approach outperforms top state of the art algorithms for community detection in complex networks.

[1]  C. Lee Giles,et al.  Self-Organization and Identification of Web Communities , 2002, Computer.

[2]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Yiannis,et al.  Community Detection in Social Media Performance and application considerations , 2010 .

[4]  Alfred De Grazia,et al.  Mathematical Derivation of an Election System , 1953 .

[5]  L. Hubert,et al.  Comparing partitions , 1985 .

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

[7]  Boleslaw K. Szymanski,et al.  Community detection using a neighborhood strength driven Label Propagation Algorithm , 2011, 2011 IEEE Network Science Workshop.

[8]  Benjamin H. Good,et al.  Performance of modularity maximization in practical contexts. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Michael Ovelgönne,et al.  Distributed community detection in web-scale networks , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[10]  Bin Wu,et al.  Overlapping Community Detection in Bipartite Networks , 2008, 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.

[11]  Marko Bajec,et al.  Robust network community detection using balanced propagation , 2011, ArXiv.

[12]  Prem Melville,et al.  A Predictive Perspective on Measures of Influence in Networks , 2010 .

[13]  Osmar R. Zaïane,et al.  Top Leaders Community Detection Approach in Information Networks , 2010 .

[14]  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.

[15]  Illés J. Farkas,et al.  CFinder: locating cliques and overlapping modules in biological networks , 2006, Bioinform..

[16]  Céline Rouveirol,et al.  Supervised Machine Learning Applied to Link Prediction in Bipartite Social Networks , 2010, 2010 International Conference on Advances in Social Networks Analysis and Mining.

[17]  Qiang Huang,et al.  Community Detection Using Cooperative Co-evolutionary Differential Evolution , 2012, PPSN.

[18]  Walter Willinger,et al.  Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications , 2005, Internet Math..

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

[20]  Hao Lou,et al.  Detecting community structure using label propagation with weighted coherent neighborhood propinquity , 2013 .

[21]  Yiannis Kompatsiaris,et al.  Community detection in Social Media , 2012, Data Mining and Knowledge Discovery.

[22]  Emden R. Gansner,et al.  Using automatic clustering to produce high-level system organizations of source code , 1998, Proceedings. 6th International Workshop on Program Comprehension. IWPC'98 (Cat. No.98TB100242).

[23]  Tsuyoshi Murata,et al.  Community Detection in Large-scale Bipartite Networks , 2010 .

[24]  David A. Bader,et al.  588 Graph Partitioning and Graph Clustering , 2013 .

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

[26]  Pietro Liò,et al.  Towards real-time community detection in large networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  Dayou Liu,et al.  Genetic Algorithm with Local Search for Community Mining in Complex Networks , 2010, 2010 22nd IEEE International Conference on Tools with Artificial Intelligence.

[28]  Jure Leskovec,et al.  Defining and Evaluating Network Communities Based on Ground-Truth , 2012, ICDM.

[29]  Clara Pizzuti,et al.  Boosting the detection of modular community structure with genetic algorithms and local search , 2012, SAC '12.

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

[31]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[32]  Pawel Bujnowski,et al.  Aspiration and Cooperation in Multiperson Prisoner's Dilemma , 2009 .

[33]  Andreas Geyer-Schulz,et al.  Cluster Cores and Modularity Maximization , 2010, 2010 IEEE International Conference on Data Mining Workshops.

[34]  Tamara G. Kolda,et al.  Accelerating Community Detection by Using K-core Subgraphs , 2014, ArXiv.

[35]  Devavrat Shah,et al.  Community Detection in Networks: The Leader-Follower Algorithm , 2010, ArXiv.

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

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

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

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

[40]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[41]  L. Bécu,et al.  Evidence for three-dimensional unstable flows in shear-banding wormlike micelles. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[42]  Renaud Lambiotte,et al.  Multi-scale modularity in complex networks , 2010, 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.

[43]  Santo Fortunato,et al.  Limits of modularity maximization in community detection , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[44]  David Camacho,et al.  Adaptive k-Means Algorithm for Overlapped Graph Clustering , 2012, Int. J. Neural Syst..

[45]  Rushed Kanawati,et al.  Empirical evaluation of applying ensemble ranking to ego-centered communities identification in complex networks , 2014, 2014 International Conference on Multimedia Computing and Systems (ICMCS).

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

[47]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[49]  Tsuyoshi Murata.  Detecting communities from tripartite networks , 2010, WWW '10.

[50]  Lin Gao,et al.  A fast iterative-clique percolation method for identifying functional modules in protein interaction networks , 2009, Frontiers of Computer Science in China.

[51]  Godfried T. Toussaint,et al.  Optimal algorithms for computing the minimum distance between two finite planar sets , 1983, Pattern Recognit. Lett..

[52]  Clara Pizzuti,et al.  A Multiobjective Genetic Algorithm to Find Communities in Complex Networks , 2012, IEEE Transactions on Evolutionary Computation.

[53]  Christos Faloutsos,et al.  Mobile call graphs: beyond power-law and lognormal distributions , 2008, KDD.

[54]  Matthieu Latapy,et al.  Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..

[55]  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.

[56]  Serafeim Tsironis,et al.  Accurate Spectral Clustering for Community Detection in MapReduce , 2013 .

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

[58]  Roger Guimerà,et al.  A network-based method for target selection in metabolic networks , 2007, Bioinform..

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

[60]  Huan Liu,et al.  Community Detection and Mining in Social Media , 2010, Community Detection and Mining in Social Media.

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

[62]  Jean-Loup Guillaume,et al.  Community cores in evolving networks , 2012, WWW.

[63]  Santo Fortunato,et al.  Consensus clustering in complex networks , 2012, Scientific Reports.

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

[65]  Christian Staudt,et al.  Engineering High-Performance Community Detection Heuristics for Massive Graphs , 2013, 2013 42nd International Conference on Parallel Processing.

[66]  André Carlos Ponce de Leon Ferreira de Carvalho,et al.  Data clustering based on complex network community detection , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

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

[68]  Jon M. Kleinberg,et al.  Small-World Phenomena and the Dynamics of Information , 2001, NIPS.

[69]  J. A. Hartigan,et al.  A k-means clustering algorithm , 1979 .

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

[71]  Gennaro Cordasco,et al.  Label propagation algorithm: a semi-synchronous approach , 2012, Int. J. Soc. Netw. Min..

[72]  Ana L. N. Fred,et al.  Robust data clustering , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[73]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[74]  Haifeng Du,et al.  A genetic algorithm with local search strategy for improved detection of community structure , 2010, Complex..

[75]  Gábor Csárdi,et al.  The igraph software package for complex network research , 2006 .

[76]  Rushed Kanawati,et al.  Seed-Centric Approaches for Community Detection in Complex Networks , 2014, HCI.

[77]  Charu C. Aggarwal,et al.  Data Clustering , 2013 .

[78]  Szymon Grabowski,et al.  Tight and Simple Web Graph Compression , 2010, Stringology.

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

[80]  Anurag Verma,et al.  Network clustering via clique relaxations: A community based approach , 2012, Graph Partitioning and Graph Clustering.

[81]  Thomas Goldstein.  Algorithms and Applications for L1 Minimization , 2010 .

[82]  P.-C.-F. Daunou,et al.  Mémoire sur les élections au scrutin , 1803 .

[83]  K. Arrow,et al.  Social Choice and Individual Values , 1951 .

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

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

[86]  Yiannis Kompatsiaris,et al.  A Graph-Based Clustering Scheme for Identifying Related Tags in Folksonomies , 2010, DaWak.

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

[88]  Andrew G. Glen,et al.  APPL , 2001 .

[89]  Jukka-Pekka Onnela,et al.  Community Structure in Time-Dependent, Multiscale, and Multiplex Networks , 2009, Science.

[90]  Carl T. Bergstrom,et al.  The map equation , 2009, 0906.1405.

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

[92]  Patricia Rose Gomes de Melo Viol Martins,et al.  MATHEMATICS WITHOUT NUMBERS: AN INTRODUCTION TO THE STUDY OF LOGIC , 2015 .

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

[94]  Jianyong Wang,et al.  Parallel community detection on large networks with propinquity dynamics , 2009, KDD.

[95]  Martin Rosvall,et al.  Significant Communities in Large Sparse Networks , 2011, PloS one.

[96]  Rushed Kanawati,et al.  LICOD: Leaders Identification for Community Detection in Complex Networks , 2011, 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing.