Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3394486.3403082acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

A Data-Driven Graph Generative Model for Temporal Interaction Networks

Published: 20 August 2020 Publication History

Abstract

Deep graph generative models have recently received a surge of attention due to its superiority of modeling realistic graphs in a variety of domains, including biology, chemistry, and social science. Despite the initial success, most, if not all, of the existing works are designed for static networks. Nonetheless, many realistic networks are intrinsically dynamic and presented as a collection of system logs (i.e., timestamped interactions/edges between entities), which pose a new research direction for us: how can we synthesize realistic dynamic networks by directly learning from the system logs? In addition, how can we ensure the generated graphs preserve both the structural and temporal characteristics of the real data?
To address these challenges, we propose an end-to-end deep generative framework named TagGen. In particular, we start with a novel sampling strategy for jointly extracting structural and temporal context information from temporal networks. On top of that, TagGen parameterizes a bi-level self-attention mechanism together with a family of local operations to generate temporal random walks. At last, a discriminator gradually selects generated temporal random walks, that are plausible in the input data, and feeds them to an assembling module for generating temporal networks. The experimental results in seven real-world data sets across a variety of metrics demonstrate that (1) TagGen outperforms all baselines in the temporal interaction network generation problem, and (2) TagGen significantly boosts the performance of the prediction models in the tasks of anomaly detection and link prediction.

Supplementary Material

MP4 File (3394486.3403082.mp4)
Deep graph generative models have recently received a surge of attention due to its superiority of modeling realistic graphs in a variety of domains, including biology, chemistry, and social science. Despite the initial success, most, if not all, of the existing works are designed for static networks. Nonetheless, many realistic networks are intrinsically dynamic and presented as a collection of system logs (i.e., timestamped edges between entities). In this paper, we propose an end-to-end deep generative framework named TagGen, which can directly learn from a series of timestamped nodes and edges and preserve the structural and temporal characteristics of the input data. The experimental results in seven real-world data sets across a variety of metrics demonstrate that (1) TagGen outperforms all baselines in the temporal interaction network generation problem, and (2) TagGen significantly boosts the performance of the prediction models in the tasks of anomaly detection and link prediction.

References

[1]
Steven P. Abney. 2002. Bootstrapping. In Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics.
[2]
Leman Akoglu and Christos Faloutsos. 2009. RTG: a recursive realistic graph generator using random typing. Data Min. Knowl. Discov.
[3]
Ré ka Albert and Albert-Lá szló Barabá si. 2001. Statistical mechanics of complex networks. CoRR, Vol. cond-mat/0106096 (2001).
[4]
Yikun Ban, Xin Liu, Ling Huang, Yitao Duan, Xue Liu, and Wei Xu. 2019. No Place to Hide: Catching Fraudulent Entities in Tensors. In The World Wide Web Conference.
[5]
Aleksandar Bojchevski, Oleksandr Shchur, Daniel Zü gner, and Stephan Gü nnemann. 2018. NetGAN: Generating Graphs via Random Walks. In Proceedings of the 35th International Conference on Machine Learning.
[6]
Lé on Bottou. 2010. Large-Scale Machine Learning with Stochastic Gradient Descent. In 19th International Conference on Computational Statistics, COMPSTAT.
[7]
Dean V Buonomano and Michael M Merzenich. 1995. Temporal Information Transformed into a Spatial Code by a Neural Network with Realistic Properties. Science (1995).
[8]
Deepayan Chakrabarti, Yiping Zhan, and Christos Faloutsos. 2004. R-MAT: A Recursive Model for Graph Mining. In Proceedings of the Fourth SIAM International Conference on Data Mining.
[9]
Paul Erdös and Alfréd Rényi. 1959. On random graphs, I. Publicationes Mathematicae (Debrecen) (1959).
[10]
Frank Fischer and Christoph Helmberg. 2014. Dynamic graph generation for the shortest path problem in time expanded networks. Math. Program. (2014).
[11]
Anna Goldenberg, Alice X. Zheng, Stephen E. Fienberg, and Edoardo M. Airoldi. 2009. A Survey of Statistical Network Models. Foundations and Trends in Machine Learning (2009).
[12]
Ian J. Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron C. Courville, and Yoshua Bengio. 2014. Generative Adversarial Nets. In Advances in Neural Information Processing Systems.
[13]
Palash Goyal, Sujit Rokka Chhetri, and Arquimedes Canedo. 2020. dyngraph2vec: Capturing network dynamics using dynamic graph representation learning.
[14]
Carsten Grabow, Stefan Grosskinsky, Jü rgen Kurths, and Marc Timme. 2015. Collective Relaxation Dynamics of Small-World Networks. CoRR, Vol. abs/1507.04624 (2015). arxiv: 1507.04624
[15]
Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable Feature Learning for Networks. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
[16]
Jian Kang and Hanghang Tong. 2019. N2N: Network Derivative Mining. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management.
[17]
Diederik P. Kingma and Max Welling. 2014. Auto-Encoding Variational Bayes. (2014).
[18]
Thomas N. Kipf and Max Welling. 2016. Variational Graph Auto-Encoders. CoRR, Vol. abs/1611.07308 (2016). arxiv: 1611.07308
[19]
Jon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, and Andrew Tomkins. 1999. The Web as a Graph: Measurements, Models, and Methods. In 5th Annual International Conference of Computing and Combinatorics.
[20]
Srijan Kumar, Francesca Spezzano, V. S. Subrahmanian, and Christos Faloutsos. 2016. Edge Weight Prediction in Weighted Signed Networks. In IEEE 16th International Conference on Data Mining.
[21]
Srijan Kumar, Xikun Zhang, and Jure Leskovec. 2019. Predicting Dynamic Embedding Trajectory in Temporal Interaction Networks. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
[22]
Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinberg, Christos Faloutsos, and Zoubin Ghahramani. 2010. Kronecker Graphs: An Approach to Modeling Networks. J. Mach. Learn. Res. (2010).
[23]
Jure Leskovec and Andrej Krevl. 2015. $$SNAP Datasets$$:$$Stanford$$ Large Network Dataset Collection. (2015).
[24]
Taisong Li, Jiawei Zhang, Philip S. Yu, Yan Zhang, and Yonghong Yan. 2018. Deep Dynamic Network Embedding for Link Prediction. IEEE Access (2018).
[25]
Xu Liu, Jingrui He, Sam Duddy, and Liz O'Sullivan. 2019 a. Convolution-Consistent Collective Matrix Completion. In International Conference on Information and Knowledge Management.
[26]
Zhining Liu, Dawei Zhou, and Jingrui He. 2019 b. Towards Explainable Representation of Time-Evolving Graphs via Spatial-Temporal Graph Attention Networks. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management.
[27]
Giang Hoang Nguyen, John Boaz Lee, Ryan A. Rossi, Nesreen K. Ahmed, Eunyee Koh, and Sungchul Kim. 2018. Continuous-Time Dynamic Network Embeddings. In Companion of the The Web Conference 2018 on The Web Conference 2018.
[28]
Pietro Panzarasa, Tore Opsahl, and Kathleen M. Carley. 2009. Patterns and dynamics of users' behavior and interaction: Network analysis of an online community. J. Assoc. Inf. Sci. Technol. (2009).
[29]
Ashwin Paranjape, Austin R. Benson, and Jure Leskovec. 2017. Motifs in Temporal Networks. In Proceedings of the Tenth ACM International Conference on Web Search and Data Mining.
[30]
Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. 2014. DeepWalk: online learning of social representations. In The 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
[31]
Sumit Purohit, Lawrence B Holder, and George Chin. 2018. Temporal Graph Generation Based on a Distribution of Temporal Motifs. In Proceedings of the 14th International Workshop on Mining and Learning with Graphs.
[32]
Garry Robins, Pip Pattison, Yuval Kalish, and Dean Lusher. 2007. An introduction to exponential random graph (p(^* )) models for social networks. Soc. Networks (2007).
[33]
Huajie Shao, Dachun Sun, Jiahao Wu, Zecheng Zhang, Aston Zhang, Shuochao Yao, Shengzhong Liu, Tianshi Wang, Chao Zhang, and Tarek F. Abdelzaher. 2020. paper2repo: GitHub Repository Recommendation for Academic Papers. In The Web Conference.
[34]
Huajie Shao, Shuochao Yao, Yiran Zhao, Chao Zhang, Jinda Han, Lance M. Kaplan, Lu Su, and Tarek F. Abdelzaher. 2018. A Constrained Maximum Likelihood Estimator for Unguided Social Sensing. In IEEE Conference on Computer Communications.
[35]
George R Terrell and David W Scott. 1992. Variable Kernel Density Estimation. The Annals of Statistics (1992).
[36]
Hanghang Tong, Spiros Papadimitriou, Philip S. Yu, and Christos Faloutsos. 2008. Proximity Tracking on Time-Evolving Bipartite Graphs. In Proceedings of the SIAM International Conference on Data Mining.
[37]
Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, Lukasz Kaiser, and Illia Polosukhin. 2017. Attention is All you Need. In Advances in Neural Information Processing Systems.
[38]
Bernard M. Waxman. 1988. Routing of multipoint connections. IEEE J. Sel. Areas Commun. (1988).
[39]
Jiaxuan You, Bowen Liu, Zhitao Ying, Vijay S. Pande, and Jure Leskovec. 2018a. Graph Convolutional Policy Network for Goal-Directed Molecular Graph Generation. In Advances in Neural Information Processing Systems.
[40]
Jiaxuan You, Rex Ying, Xiang Ren, William L. Hamilton, and Jure Leskovec. 2018b. GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models. In Proceedings of the 35th International Conference on Machine Learning.
[41]
Bing Yu, Haoteng Yin, and Zhanxing Zhu. 2018. Spatio-Temporal Graph Convolutional Networks: A Deep Learning Framework for Traffic Forecasting. (2018).
[42]
Si Zhang, Dawei Zhou, Mehmet Yigit Yildirim, Scott Alcorn, Jingrui He, Hasan Davulcu, and Hanghang Tong. 2017. HiDDen: Hierarchical Dense Subgraph Detection with Application to Financial Fraud Detection. In Proceedings of the 2017 SIAM International Conference on Data Mining.
[43]
Dawei Zhou, Jingrui He, Hongxia Yang, and Wei Fan. 2018. SPARC: Self-Paced Network Representation for Few-Shot Rare Category Characterization. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
[44]
Dawei Zhou, Kangyang Wang, Nan Cao, and Jingrui He. 2015. Rare Category Detection on Time-Evolving Graphs. In IEEE International Conference on Data Mining.
[45]
Yuan Zuo, Guannan Liu, Hao Lin, Jia Guo, Xiaoqian Hu, and Junjie Wu. 2018. Embedding Temporal Network via Neighborhood Formation. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.

Cited By

View all
  • (2024)G2A2: Graph Generator with Attributes and AnomaliesProceedings of the 21st ACM International Conference on Computing Frontiers10.1145/3649153.3649206(3-11)Online publication date: 7-May-2024
  • (2024)Temporal Graph Generative ModelsProceedings of the 4th Workshop on Machine Learning and Systems10.1145/3642970.3655829(18-27)Online publication date: 22-Apr-2024
  • (2024)Automated Contrastive Learning Strategy Search for Time SeriesProceedings of the 33rd ACM International Conference on Information and Knowledge Management10.1145/3627673.3680086(4612-4620)Online publication date: 21-Oct-2024
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
KDD '20: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
August 2020
3664 pages
ISBN:9781450379984
DOI:10.1145/3394486
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 August 2020

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. graph generative model
  2. temporal networks
  3. transformer model

Qualifiers

  • Research-article

Funding Sources

Conference

KDD '20
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)265
  • Downloads (Last 6 weeks)43
Reflects downloads up to 13 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)G2A2: Graph Generator with Attributes and AnomaliesProceedings of the 21st ACM International Conference on Computing Frontiers10.1145/3649153.3649206(3-11)Online publication date: 7-May-2024
  • (2024)Temporal Graph Generative ModelsProceedings of the 4th Workshop on Machine Learning and Systems10.1145/3642970.3655829(18-27)Online publication date: 22-Apr-2024
  • (2024)Automated Contrastive Learning Strategy Search for Time SeriesProceedings of the 33rd ACM International Conference on Information and Knowledge Management10.1145/3627673.3680086(4612-4620)Online publication date: 21-Oct-2024
  • (2024)Causality-Aware Spatiotemporal Graph Neural Networks for Spatiotemporal Time Series ImputationProceedings of the 33rd ACM International Conference on Information and Knowledge Management10.1145/3627673.3679642(1027-1037)Online publication date: 21-Oct-2024
  • (2024)TrustLOG: The Second Workshop on Trustworthy Learning on GraphsCompanion Proceedings of the ACM Web Conference 202410.1145/3589335.3641305(1785-1788)Online publication date: 13-May-2024
  • (2024)System Identification for Temporal NetworksIEEE Transactions on Network Science and Engineering10.1109/TNSE.2023.333300711:2(1885-1895)Online publication date: Mar-2024
  • (2024)Robust Knowledge Adaptation for Dynamic Graph Neural NetworksIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.338845336:11(6920-6933)Online publication date: Nov-2024
  • (2024)Continuous-Time and Discrete-Time Representation Learning for Origin-Destination Demand PredictionIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2023.332394525:3(2382-2393)Online publication date: Mar-2024
  • (2024)Temporal Graph Generation Featuring Time-Bound Communities2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00187(2365-2378)Online publication date: 13-May-2024
  • (2024)Fairgen: Towards Fair Graph Generation2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00181(2285-2297)Online publication date: 13-May-2024
  • Show More Cited By

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media