A robust ant colony optimization-based algorithm for community mining in large scale oriented social graphs

Abstract Community detection plays a key role in such important fields as biology, sociology and computer science. For example, detecting the communities in protein–protein interactions networks helps in understanding their functionalities. Most existing approaches were devoted to community mining in undirected social networks (either weighted or not). In fact, despite their ubiquity, few proposals were interested in community detection in oriented social networks. For example, in a friendship network, the influence between individuals could be asymmetric; in a networked environment, the flow of information could be unidirectional. In this paper, we propose an algorithm, called ACODIG, for community detection in oriented social networks. ACODIG uses an objective function based on measures of density and purity and incorporates the information about edge orientations in the social graph. ACODIG uses ant colony for its optimization. Simulation results on real-world as well as power law artificial benchmark networks reveal a good robustness of ACODIG and an efficiency in computing the real structure of the network.

[1]  Youngdo Kim,et al.  Finding communities in directed networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Han Zhao,et al.  Identifying influential nodes in complex networks with community structure , 2013, Knowl. Based Syst..

[3]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[4]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

[5]  Luca Maria Gambardella,et al.  A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows , 1999 .

[6]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[7]  Hongtao Lu,et al.  Finding communities in directed networks by PageRank random walk induced network embedding , 2010 .

[8]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[9]  Yousef Saad,et al.  Dense Subgraph Extraction with Application to Community Detection , 2012, IEEE Transactions on Knowledge and Data Engineering.

[10]  B. Chandra Mohan,et al.  A survey: Ant Colony Optimization based recent research and implementation on several engineering domain , 2012, Expert Syst. Appl..

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

[12]  Hartmut Schmeck,et al.  Ant colony optimization for resource-constrained project scheduling , 2000, IEEE Trans. Evol. Comput..

[13]  Ulrik Brandes,et al.  Experiments on Graph Clustering Algorithms , 2003, ESA.

[14]  Marco Dorigo,et al.  AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..

[15]  E A Leicht,et al.  Community structure in directed networks. , 2007, Physical review letters.

[16]  T. Mexia,et al.  Author ' s personal copy , 2009 .

[17]  Lotfi Ben Romdhane,et al.  An O(n2) algorithm for detecting communities of unbalanced sizes in large scale social networks , 2013, Knowl. Based Syst..

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

[19]  Bharti Suri,et al.  Literature survey of Ant Colony Optimization in software testing , 2012, 2012 CSI Sixth International Conference on Software Engineering (CONSEG).

[20]  Yang Yi,et al.  Improved ant colony optimization algorithm for the traveling salesman problems , 2010 .

[21]  U Chandrasekhar,et al.  Recent trends in Ant Colony Optimization and data clustering: A brief survey , 2011, 2011 2nd International Conference on Intelligent Agent & Multi-Agent Systems.