A Triclustering Approach for Time Evolving Graphs

This paper introduces a novel technique to track structures in time evolving graphs. The method is based on a parameter free approach for three-dimensional co-clustering of the source vertices, the target vertices and the time. All these features are simultaneously segmented in order to build time segments and clusters of vertices whose edge distributions are similar and evolve in the same way over the time segments. The main novelty of this approach lies in that the time segments are directly inferred from the evolution of the edge distribution between the vertices, thus not requiring the user to make an a priori discretization. Experiments conducted on a synthetic dataset illustrate the good behaviour of the technique, and a study of a real-life dataset shows the potential of the proposed approach for exploratory data analysis.

[1]  S. Boorman,et al.  Social Structure from Multiple Networks. I. Blockmodels of Roles and Positions , 1976, American Journal of Sociology.

[2]  E. Xing,et al.  A state-space mixed membership blockmodel for dynamic network tomography , 2008, 0901.0135.

[3]  Edoardo M. Airoldi,et al.  Mixed Membership Stochastic Blockmodels , 2007, NIPS.

[4]  Marion B. H. Whyte.  Family and Social Network , 1958, Mental Health.

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

[6]  Céline Robardet,et al.  Constraint-Based Pattern Mining in Dynamic Graphs , 2009, 2009 Ninth IEEE International Conference on Data Mining.

[7]  T. Snijders,et al.  Estimation and Prediction for Stochastic Blockstructures , 2001 .

[8]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

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

[10]  Thomas L. Griffiths,et al.  Learning Systems of Concepts with an Infinite Relational Model , 2006, AAAI.

[11]  Douglas R. White,et al.  Role models for complex networks , 2007, 0708.0958.

[12]  R. Chambers,et al.  Family and social network , 1964 .

[13]  H. White,et al.  “Structural Equivalence of Individuals in Social Networks” , 2022, The SAGE Encyclopedia of Research Design.

[14]  Kevin J. Lang.  Information Theoretic Comparison of Stochastic Graph Models: Some Experiments , 2009, WAW.

[15]  M. Boullé,et al.  Data Grid Models for Preparation and Modeling in Supervised Learning Data Grid Models for Preparation and Modeling in Supervised Learning , 2010 .

[16]  Vladimir Batagelj,et al.  Generalized blockmodeling of two-mode network data , 2004, Soc. Networks.

[17]  K. Reitz,et al.  Graph and Semigroup Homomorphisms on Networks of Relations , 1983 .

[18]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[19]  Inderjit S. Dhillon,et al.  Information-theoretic co-clustering , 2003, KDD '03.

[20]  S. Nadel.  The Theory of Social Structure , 1957 .

[21]  Jianhua Lin,et al.  Divergence measures based on the Shannon entropy , 1991, IEEE Trans. Inf. Theory.

[22]  M. Tribus,et al.  Probability theory: the logic of science , 2003 .

[23]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[24]  A comment on Doreian's regular equivalence in symmetric structures , 1988 .

[25]  Jorma Rissanen,et al.  Minimum Description Length Principle , 2010, Encyclopedia of Machine Learning.