Tracking local communities in streaming graphs with a dynamic algorithm

A variety of massive datasets, such as social networks and biological data, are represented as graphs that reveal underlying connections, trends, and anomalies. Community detection is the task of discovering dense groups of vertices in a graph. Its one specific form is seed set expansion, which finds the best local community for a given set of seed vertices. Greedy, agglomerative algorithms, which are commonly used in seed set expansion, have been previously designed only for a static, unchanging graph. However, in many applications, new data are constantly produced, and vertices and edges are inserted and removed from a graph. We present an algorithm for dynamic seed set expansion, which maintains a local community over time by incrementally updating as the underlying graph changes. We show that our dynamic algorithm outputs high-quality communities that are similar to those found when using a standard static algorithm. It works well both when beginning with an already existing graph and in the fully streaming case when starting with no data. The dynamic approach is also faster than re-computation when low latency updates are needed.

[1]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[2]  Bart Selman,et al.  Tracking evolving communities in large linked networks , 2004, Proceedings of the National Academy of Sciences of the United States of America.

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

[4]  A. Clauset.  Finding local community structure in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Erik M Bollt,et al.  Local method for detecting communities. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  T. Vicsek,et al.  Clique percolation in random networks. , 2005, Physical review letters.

[7]  Fan Chung Graham,et al.  Local Graph Partitioning using PageRank Vectors , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

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

[9]  Kevin J. Lang,et al.  Communities from seed sets , 2006, WWW '06.

[10]  Céline Robardet,et al.  Communities detection and analysis of their dynamics in collaborative networks , 2007, 2007 2nd International Conference on Digital Information Management.

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

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

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

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

[15]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

[16]  Randy Goebel,et al.  Detecting Communities in Large Networks by Iterative Local Expansion , 2009, 2009 International Conference on Computational Aspects of Social Networks.

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

[18]  Yun Chi,et al.  Analyzing communities and their evolutions in dynamic social networks , 2009, TKDD.

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

[20]  Fergal Reid,et al.  Detecting highly overlapping community structure by greedy clique expansion , 2010, KDD 2010.

[21]  Yihong Gong,et al.  Incremental spectral clustering by efficiently updating the eigen-system , 2010, Pattern Recognit..

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

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

[24]  Renaud Lambiotte,et al.  Line graphs of weighted networks for overlapping communities , 2010 .

[25]  Huan Liu,et al.  Community Detection and Mining in Social Media , 2010, Community Detection and Mining in Social Media.

[26]  Jean-Loup Guillaume,et al.  Static community detection algorithms for evolving networks , 2010, 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.

[27]  Alexander Struck,et al.  Identification of overlapping communities and their hierarchy by locally calculating community-changing resolution levels , 2010, ArXiv.

[28]  David A. Bader,et al.  Detecting Communities from Given Seeds in Social Networks , 2011 .

[29]  Santo Fortunato,et al.  Finding Statistically Significant Communities in Networks , 2010, PloS one.

[30]  Myra Spiliopoulou,et al.  Evolution in Social Networks: A Survey , 2011, Social Network Data Analytics.

[31]  Boleslaw K. Szymanski,et al.  Towards Linear Time Overlapping Community Detection in Social Networks , 2012, PAKDD.

[32]  David A. Bader,et al.  Multithreaded Community Monitoring for Massive Streaming Graph Data , 2013, 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum.

[33]  Jean-Loup Guillaume,et al.  Communities in Evolving Networks: Definitions, Detection, and Analysis Techniques , 2013 .

[34]  Osmar R. Zaïane,et al.  Incremental local community identification in dynamic social networks , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[35]  Michel Crampes,et al.  Survey on Social Community Detection , 2013, Social Media Retrieval.

[36]  Boleslaw K. Szymanski,et al.  Overlapping community detection in networks: The state-of-the-art and comparative study , 2011, CSUR.

[37]  Ludo Waltman,et al.  A smart local moving algorithm for large-scale modularity-based community detection , 2013, The European Physical Journal B.

[38]  L. Tian,et al.  Phase transitions of the q-state Potts model on multiply-laced Sierpinski gaskets , 2013, 1303.1605.

[39]  Jon Rokne,et al.  Encyclopedia of Social Network Analysis and Mining , 2014, Springer New York.

[40]  Cheng Wu,et al.  A Real-Time Detecting Algorithm for Tracking Community Structure of Dynamic Networks , 2014, ArXiv.

[41]  David A. Bader,et al.  A dynamic algorithm for local community detection in graphs , 2015, 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[42]  Ismail Hakki Toroslu,et al.  A dynamic modularity based community detection algorithm for large-scale networks: DSLM , 2015, 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).