CADENCE: Community-Aware Detection of Dynamic Network States

Dynamic interaction data is often aggregated in a sequence of network snapshots before being employed in downstream analysis. The two common ways of defining network snapshots are i) a fixed time interval or ii) fixed number of interactions per snapshot. The choice of aggregation has a significant impact on subsequent analysis, and it is not trivial to select one approach over another for a given dataset. More importantly, assuming snapshot regularity is data-agnostic and may be at odds with the underlying interaction dynamics. To address these challenges, we propose a method for community-aware detection of network states (CA-DENCE) based on the premise of stable interaction time-frames within network communities. We simultaneously detect network communities and partition the global interaction activity into scale-adaptive snapshots where the level of interaction within communities remains stable. We model a temporal network as a node-node-time tensor and use a structured canonical polyadic decomposition with a piece-wise constant temporal factor to iteratively identify communities and their activity levels. We demonstrate that transitions between network snapshots learned by CADENCE constitute network change points of better quality than those predicted by state-of-the-art network change point detectors. Furthermore, the network structure within individual snapshots reflects ground truth communities better than baselines for adaptive tensor granularity. Through a case study on a real-world Reddit dataset, we showcase the interpretability of CADENCE motivated snapshots as periods separated by significant events.

[1]  F. Takes,et al.  A Large-scale Temporal Analysis of User Lifespan Durability on the Reddit Social Media Platform , 2022, WWW.

[2]  Ryan A. Rossi,et al.  On Generalizing Static Node Embedding to Dynamic Settings , 2022, WSDM.

[3]  Petko Bogdanov,et al.  Mining Bursty Groups from Interaction Data , 2021, CIKM.

[4]  Reihaneh Rabbany,et al.  Laplacian Change Point Detection for Dynamic Graphs , 2020, KDD.

[5]  Christopher K. I. Williams,et al.  An Evaluation of Change Point Detection Algorithms , 2020, ArXiv.

[6]  Bo Zong,et al.  Adaptive Neural Network for Node Classification in Dynamic Networks , 2019, 2019 IEEE International Conference on Data Mining (ICDM).

[7]  Petko Bogdanov,et al.  PERCeIDs: PERiodic CommunIty Detection , 2019, 2019 IEEE International Conference on Data Mining (ICDM).

[8]  Petko Bogdanov,et al.  Optimal Timelines for Network Processes , 2019, 2019 IEEE International Conference on Data Mining (ICDM).

[9]  Yong Wang,et al.  Nonuniform Timeslicing of Dynamic Graphs Based on Visual Complexity , 2019, 2019 IEEE Visualization Conference (VIS).

[10]  Charles E. Leisersen,et al.  EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs , 2019, AAAI.

[11]  Petko Bogdanov,et al.  LARC: Learning Activity-Regularized Overlapping Communities Across Time , 2018, KDD.

[12]  Petter Holme,et al.  Detecting sequences of system states in temporal networks , 2018, Scientific Reports.

[13]  A. Barrat,et al.  Can co-location be used as a proxy for face-to-face contacts? , 2017, EPJ Data Science.

[14]  Petko Bogdanov,et al.  Network Clocks: Detecting the Temporal Scale of Information Diffusion , 2017, 2017 IEEE International Conference on Data Mining (ICDM).

[15]  Tina Eliassi-Rad,et al.  Generating Graph Snapshots from Streaming Edge Data , 2016, WWW.

[16]  Nikos D. Sidiropoulos,et al.  A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorization , 2015, IEEE Transactions on Signal Processing.

[17]  Leto Peel,et al.  Detecting Change Points in the Large-Scale Structure of Evolving Networks , 2014, AAAI.

[18]  Danai Koutra,et al.  TensorSplat: Spotting Latent Anomalies in Time , 2012, 2012 16th Panhellenic Conference on Informatics.

[19]  Ciro Cattuto,et al.  Dynamics of Person-to-Person Interactions from Distributed RFID Sensor Networks , 2010, PloS one.

[20]  Jure Leskovec,et al.  Empirical comparison of algorithms for network community detection , 2010, WWW '10.

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

[22]  Hisashi Kashima,et al.  Eigenspace-based anomaly detection in computer systems , 2004, KDD.

[23]  Hans-Peter Kriegel,et al.  LOF: identifying density-based local outliers , 2000, SIGMOD '00.

[24]  R. Bro PARAFAC. Tutorial and applications , 1997 .

[25]  Y. C. Pati,et al.  Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[26]  L. Tucker,et al.  Some mathematical notes on three-mode factor analysis , 1966, Psychometrika.

[27]  Ravdeep Pasricha Adaptive Granularity in Time Evolving Graphs as Tensors , 2020 .