CUT: community update and tracking in dynamic social networks

Social network exhibits a special property: community structure. The community detection on a social network is like clustering on a graph, but the nodes in social network has unique name and the edges has some special properties like friendship, common interest. There have been many clustering methods can be used to detect the community structure on a static network. But in real-world, the social networks are usually dynamic, and the community structures always change over time. We propose Community Update and Tracking algorithm, CUT, to efficiently update and track the community structure algorithm in dynamic social networks. When the social network has some variations in different timestamps, we track the seeds of community and update the community structure instead of recalculating all nodes and edges in the network. The seeds of community is the base of community, we find some nodes which connected together tightly, and these nodes probably become communities. Therefore, our approach can quickly and efficiently update the community structure.

[1]  Faraz Zaidi,et al.  Detecting Structural Changes and Command Hierarchies in Dynamic Social Networks , 2009, 2009 International Conference on Advances in Social Network Analysis and Mining.

[2]  Nagiza F. Samatova,et al.  Detecting and Tracking Community Dynamics in Evolutionary Networks , 2010, 2010 IEEE International Conference on Data Mining Workshops.

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

[4]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[5]  A. Barabasi,et al.  Social group dynamics in networks , 2009 .

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

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

[8]  Ying Xuan,et al.  Towards social-aware routing in dynamic communication networks , 2009, 2009 IEEE 28th International Performance Computing and Communications Conference.

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

[10]  Bin Wu,et al.  CommTracker: A Core-Based Algorithm of Tracking Community Evolution , 2008, ADMA.

[11]  Ian T. Foster,et al.  Mapping the Gnutella Network , 2002, IEEE Internet Comput..

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

[13]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Steve Gregory,et al.  Detecting communities in networks by merging cliques , 2009, 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems.

[15]  Bin Wu,et al.  CommTrend: An Applied Framework for Community Detection in Large-Scale Social Network , 2009, 2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery.

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

[17]  Tanya Y. Berger-Wolf,et al.  A framework for community identification in dynamic social networks , 2007, KDD '07.

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

[19]  Ravi Kumar,et al.  Structure and evolution of online social networks , 2006, KDD '06.

[20]  Ian T. Foster,et al.  Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design , 2002, ArXiv.