Changepoint Detection in Highly-Attributed Dynamic Graphs

Emiliano Penaloza, Nathaniel Stevens
7/9/2024
cs.SIcs.LG

No official code found. Best implementation: Emilianopp/ChangesHighlyAttributedGraphs (1 star, last commit 2024-06-21).

Abstract

Detecting anomalous behavior in dynamic networks remains a constant challenge. This problem is further exacerbated when the underlying topology of these networks is affected by individual highly-dimensional node attributes. We address this issue by tracking a network's modularity as a proxy of its community structure. We leverage Graph Neural Networks (GNNs) to estimate each snapshot's modularity. GNNs can account for both network structure and high-dimensional node attributes, providing a comprehensive approach for estimating network statistics. Our method is validated through simulations that demonstrate its ability to detect changes in highly-attributed networks by analyzing shifts in modularity. Moreover, we find our method is able to detect a real-world event within the \#Iran Twitter reply network, where each node has high-dimensional textual attributes.

View on arXivView PDF

Code Implementations(1)

10Python, Jupyter NotebookDec 5, 20222 years ago

Similar Papers

Cite this paper

@article{penaloza2024changepoint,
  title  = {Changepoint Detection in Highly-Attributed Dynamic Graphs},
  author = {Emiliano Penaloza and Nathaniel Stevens},
  year   = {2024},
  eprint = {2407.06998},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2407.06998v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2407.06998.svg)](https://codeofpaper.com/paper/2407.06998)

Discussion