Community Core Evolution in Mobile Social Networks

Community detection in social networks attracts a lot of attention in the recent years. Existing methods always depict the relationship of two nodes using the temporary connection. However, these temporary connections cannot be fully recognized as the real relationships when the history connections among nodes are considered. For example, a casual visit in Facebook cannot be seen as an establishment of friendship. Hence, our question is the following: how to cluster the real friends in mobile social networks? In this paper, we study the problem of detecting the stable community core in mobile social networks. The cumulative stable contact is proposed to depict the relationship among nodes. The whole process is divided into timestamps. Nodes and their connections can be added or removed at each timestamp, and historical contacts are considered when detecting the community core. Also, community cores can be tracked through the incremental computing, which can help to recognize the evolving of community structure. Empirical studies on real-world social networks demonstrate that our proposed method can effectively detect stable community cores in mobile social networks.

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

[2]  John E. Hopcroft,et al.  Extracting the Core Structure of Social Networks Using (α, β)-Communities , 2013, Internet Math..

[3]  Ichigaku Takigawa,et al.  A spectral clustering approach to optimally combining numericalvectors with a modular network , 2007, KDD '07.

[4]  Pan Hui,et al.  People are the network : experimental design and evaluation of social-based forwarding algorithms , 2008 .

[5]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[6]  Rémy Cazabet,et al.  Detection of Overlapping Communities in Dynamical Social Networks , 2010, 2010 IEEE Second International Conference on Social Computing.

[7]  Steve Gregory,et al.  Finding overlapping communities in networks by label propagation , 2009, ArXiv.

[8]  Srinivasan Parthasarathy,et al.  An event-based framework for characterizing the evolutionary behavior of interaction graphs , 2007, KDD '07.

[9]  Przemyslaw Kazienko,et al.  Group Evolution Discovery in Social Networks , 2011, 2011 International Conference on Advances in Social Networks Analysis and Mining.

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

[11]  Dit-Yan Yeung,et al.  Overlapping community detection via bounded nonnegative matrix tri-factorization , 2012, KDD.

[12]  Philip S. Yu,et al.  Community detection in incomplete information networks , 2012, WWW.

[13]  George Varghese,et al.  MobiClique: middleware for mobile social networking , 2009, WOSN '09.