Mining Persistent Activity in Continually Evolving Networks
Caleb Belth, Xinyi Zheng, Danai Koutra
摘要
Frequent pattern mining is a key area of study that gives insights into the structure and dynamics of evolving networks, such as social or road networks. However, not only does a network evolve, but often the way that it evolves, itself evolves. Thus, knowing, in addition to patterns' frequencies, for how long and how regularly they have occurred-i.e., their persistence-can add to our understanding of evolving networks. In this work, we propose the problem of mining activity that persists through time in continually evolving networks-i.e., activity that repeatedly and consistently occurs. We extend the notion of temporal motifs to capture activity among specific nodes, in what we call activity snippets, which are small sequences of edge-updates that reoccur. We propose axioms and properties that a measure of persistence should satisfy, and develop such a persistence measure. We also propose PENminer, an efficient framework for mining activity snippets' Persistence in Evolving Networks, and design both offline and streaming algorithms. We apply PENminer to numerous real, large-scale evolving networks and edge streams, and find activity that is surprisingly regular over a long period of time, but too infrequent to be discovered by aggregate count alone, and bursts of activity exposed by their lack of persistence. Our findings with PENminer include neighborhoods in NYC where taxi traffic persisted through Hurricane Sandy, the opening of new bike-stations, characteristics of social network users, and more. Moreover, we use PENminer towards identifying anomalies in multiple networks, outperforming baselines at identifying subtle anomalies by 9.8-48% in AUC.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper5
- Sketch-Based Anomaly Detection in Streaming GraphsSiddharth Bhatia, Mohit Wadhwa, Kenji Kawaguchi, Neil Shah 等KDD 2023 · 被引用 23 次
- Scalable Temporal Motif Densest Subnetwork DiscoveryIlie Sarpe, Fabio Vandin, Aristides GionisKDD 2024 · 被引用 5 次
- Provenance in Temporal Interaction NetworksChrysanthi Kosyfaki, Nikos MamoulisICDE 2022 · 被引用 2 次
- Online Detection of Anomalies in Temporal Knowledge Graphs with InterpretabilityJiasheng Zhang, Rex Ying, Jie ShaoSIGMOD 2025 · 被引用 2 次
- ARES: Anomaly Recognition Model For Edge StreamsSimone Mungari, Albert Bifet, Giuseppe Manco, Bernhard PfahringerKDD 2026
它引用的顶会 Paper1
相关 Paper
- RekindleSketch: Time-Aware Detection of Recent Persistent Flows via Arrival-Driven RewardsXuyang Jing, Yingchao Dou, Jialin Dong, Zheng Yan 等KDD 2026
- On-Off Sketch: A Fast and Accurate Sketch on PersistenceYinda Zhang, Jinyang Li, Yutian Lei, Tong Yang 等VLDB 2021 · 被引用 63 次
- Local Motif Clustering on Time-Evolving GraphsDongqi Fu, Dawei Zhou, Jingrui HeKDD 2020 · 被引用 40 次
- Scout Sketch: Finding Promising Items in Data StreamsTianyu Ma, Guoju Gao, He Huang, Yu-e Sun 等INFOCOM 2024 · 被引用 4 次
- Mining Quasi-Periodic Communities in Temporal NetworkYue Zeng, Hongchao Qin, Rong-Hua Li, Kai Wang 等ICDE 2024 · 被引用 4 次
