An Incremental Approach Based on the Coalition Formation Game Theory for Identifying Communities in Dynamic Social Networks

Most real-world social networks are usually dynamic (evolve over time), thus communities are constantly changing in memberships. In this paper, an incremental approach based on the coalition formation game theory to identify communities in dynamic social networks is proposed, where the community evolution is modeled as the problem of transformations of stable coalition structures. The proposed approach adaptively update communities from the previous known structures and the changes of topological structure of a network, rather than re-computing in the snapshots of the network at different time steps, such that the computational cost and processing time can be significantly reduced. Experiments have been conducted to evaluate the effectiveness of the proposed approach.

[1]  Zhu Han,et al.  Coalitional game theory for communication networks , 2009, IEEE Signal Processing Magazine.

[2]  Philip S. Yu,et al.  GraphScope: parameter-free mining of large time-evolving graphs , 2007, KDD '07.

[3]  Aidong Zhang,et al.  Tracking Temporal Community Strength in Dynamic Networks , 2015, IEEE Transactions on Knowledge and Data Engineering.

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

[5]  Liang Zhao,et al.  Time series clustering via community detection in networks , 2015, Inf. Sci..

[6]  Cheng Wu,et al.  Targeted revision: A learning-based approach for incremental community detection in dynamic networks , 2016 .

[7]  Wei Chen,et al.  A game-theoretic framework to identify overlapping communities in social networks , 2010, Data Mining and Knowledge Discovery.

[8]  Leon Danon,et al.  Comparing community structure identification , 2005, cond-mat/0505245.

[9]  Tobias Hecking,et al.  Incremental Clustering of Dynamic Bipartite Networks , 2014, 2014 European Network Intelligence Conference.

[10]  Andreas Witzel,et al.  A Generic Approach to Coalition Formation , 2007, IGTR.

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

[12]  Hamidreza Alvari,et al.  Community detection in dynamic social networks: A game-theoretic approach , 2014, 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014).

[13]  Peng Wu,et al.  Social Network Analysis Layout Algorithm under Ontology Model , 2011, J. Softw..

[14]  Wen Haw Chong,et al.  An incremental batch technique for community detection , 2013, Proceedings of the 16th International Conference on Information Fusion.

[15]  Nam P. Nguyen,et al.  Adaptive algorithms for detecting community structure in dynamic social networks , 2011, 2011 Proceedings IEEE INFOCOM.

[16]  Nam P. Nguyen,et al.  A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks , 2013, Journal of Combinatorial Optimization.

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

[18]  Sunghee Choi,et al.  Efficient algorithms for updating betweenness centrality in fully dynamic graphs , 2016, Inf. Sci..

[19]  Lizhen Wang,et al.  An approach for overlapping and hierarchical community detection in social networks based on coalition formation game theory , 2015, Expert Syst. Appl..