Tracking changes in dynamic information networks

Social network analysis is a discipline that has emerged to analyze social structures and information networks to uncover patterns of interaction among the vertices in the network. Most social networks are dynamic, and studying the evolution of these networks over time could provide insight into the behavior of individuals expressed by the nodes in the graph and the flow of information among them. In a dynamic network, communities, which are groups of densely interconnected nodes, are affected by changes in the underlying population. The analysis of communities and their evolutions can help determine the shifting structural properties of the networks. We present a framework for modeling and detecting community evolution over time. First, our proposed community matching algorithm efficiently identifies and tracks similar communities over time. Then, a series of significant events and transitions are defined to characterize the evolution of networks in terms of its communities and individuals. We also propose two metrics called stability and influence metrics to describe the active behavior of the individuals. We present experiments to explore the dynamics of communities on the Enron email and DBLP datasets. Evaluating the events using topics extracted from the detected communities demonstrates that we can successfully track communities over time in real datasets.

[1]  Myra Spiliopoulou,et al.  Mining and Visualizing the Evolution of Subgroups in Social Networks , 2006, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06).

[2]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[5]  Piotr Bródka,et al.  International Conference on Computational Aspects of Social Networks , 2009, Computational Aspects of Social Networks.

[6]  Derek Greene,et al.  Tracking the Evolution of Communities in Dynamic Social Networks , 2010, 2010 International Conference on Advances in Social Networks Analysis and Mining.

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

[8]  Jiawei Han,et al.  A Particle-and-Density Based Evolutionary Clustering Method for Dynamic Networks , 2009, Proc. VLDB Endow..

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

[10]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[11]  Deepayan Chakrabarti,et al.  Evolutionary clustering , 2006, KDD '06.

[12]  Osmar R. Zaïane,et al.  A Framework for Analyzing Dynamic Social Networks , 2010 .

[13]  Osmar R. Zaïane,et al.  MODEC - Modeling and Detecting Evolutions of Communities , 2011, ICWSM.

[14]  Myra Spiliopoulou,et al.  MONIC: modeling and monitoring cluster transitions , 2006, KDD '06.

[15]  Carl Gutwin,et al.  KEA: practical automatic keyphrase extraction , 1999, DL '99.

[16]  Bo Zhao,et al.  Community evolution detection in dynamic heterogeneous information networks , 2010, MLG '10.

[17]  Myra Spiliopoulou,et al.  Studying Community Dynamics with an Incremental Graph Mining Algorithm , 2008, AMCIS.

[18]  A. Barabasi,et al.  Quantifying social group evolution , 2007, Nature.

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

[20]  Jon M. Kleinberg,et al.  Group formation in large social networks: membership, growth, and evolution , 2006, KDD '06.

[21]  Srinivasan Parthasarathy,et al.  A viewpoint-based approach for interaction graph analysis , 2009, KDD.

[22]  M. Newman,et al.  Why social networks are different from other types of networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[24]  Tanya Y. Berger-Wolf,et al.  A framework for analysis of dynamic social networks , 2006, KDD '06.

[25]  Maurice Tchuente,et al.  Local Community Identification in Social Networks , 2012, Parallel Process. Lett..