Modularity-Driven Clustering of Dynamic Graphs

Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but evolve over time, traditional static approaches can be inappropriate for specific tasks. In this work we pioneer the NP-hard problem of online dynamic modularity maximization. We develop scalable dynamizations of the currently fastest and the most widespread static heuristics and engineer a heuristic dynamization of an optimal static algorithm. Our algorithms efficiently maintain a modularity-based clustering of a graph for which dynamic changes arrive as a stream. For our quickest heuristic we prove a tight bound on its number of operations. In an experimental evaluation on both a real-world dynamic network and on dynamic clustered random graphs, we show that the dynamic maintenance of a clustering of a changing graph yields higher modularity than recomputation, guarantees much smoother clustering dynamics and requires much lower runtimes. We conclude with giving recommendations for the choice of an algorithm.

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

[2]  Benjamin H. Good,et al.  Performance of modularity maximization in practical contexts. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Eamonn J. Keogh,et al.  Towards parameter-free data mining , 2004, KDD.

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

[5]  Matthieu Latapy,et al.  Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..

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

[7]  Chris Arney.  Network Analysis: Methodological Foundations , 2012 .

[8]  Ulrik Brandes,et al.  Network Analysis: Methodological Foundations (Lecture Notes in Computer Science) , 2005 .

[9]  Dorothea Wagner,et al.  Engineering Comparators for Graph Clusterings , 2008, AAIM.

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

[11]  Florian Hübner.  The Dynamic Graph Clustering Problem-ILP-Based Approaches Balancing Optimality and the Mental Map , 2008 .

[12]  Andrzej Pelc,et al.  Deterministic Rendezvous in Graphs , 2003 .

[13]  Dorothea Wagner,et al.  Dynamic Graph Clustering Using Minimum-Cut Trees , 2009, J. Graph Algorithms Appl..

[14]  Satu Elisa Schaeffer,et al.  Dynamic Local Clustering for Hierarchical Ad Hoc Networks , 2006, 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks.

[15]  Ulrik Brandes,et al.  Experiments on Graph Clustering Algorithms , 2003, ESA.

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

[17]  M. Newman.  Analysis of weighted networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Padhraic Smyth,et al.  A Spectral Clustering Approach To Finding Communities in Graph , 2005, SDM.

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

[20]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[21]  M. V. Valkenburg.  Network Analysis , 1964 .

[22]  R. Guimerà,et al.  Functional cartography of complex metabolic networks , 2005, Nature.

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

[24]  Costas S. Iliopoulos,et al.  A New Efficient Algorithm for Computing the Longest Common Subsequence , 2007, AAIM.

[25]  S. Dongen.  Graph clustering by flow simulation , 2000 .

[26]  Satu Elisa Schaeffer,et al.  Graph Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.

[27]  David B. Skillicorn,et al.  Proceedings of the Sixth SIAM International Conference on Data Mining, April 20-22, 2006, Bethesda, MD, USA , 2005, SDM.

[28]  Dorothea Wagner,et al.  Journal of Graph Algorithms and Applications Computational Aspects of Lucidity-driven Graph Clustering , 2022 .

[29]  Ulrik Brandes,et al.  On Modularity Clustering , 2008, IEEE Transactions on Knowledge and Data Engineering.

[30]  Charu C. Aggarwal,et al.  Graph Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.

[31]  Andreas Noack,et al.  Multi-level Algorithms for Modularity Clustering , 2008, SEA.

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

[33]  Christian Schulz,et al.  Orca Reduction and ContrAction Graph Clustering , 2009, AAIM.

[34]  Robert Görke,et al.  A generator of dynamic clustered random graphs , 2009 .

[35]  Philip S. Yu,et al.  Online Analysis of Community Evolution in Data Streams , 2005, SDM.