Abstract
Networks (or graphs) are used to represent and analyze large datasets of objects and their relations. Naturally, real-world networks have a temporal component: for instance, interactions between objects have a timestamp and a duration. In this tutorial we present models and algorithms for mining temporal networks, i.e., network data with temporal information. We overview different models used to represent temporal networks. We highlight the main differences between static and temporal networks, and discuss the challenges arising from introducing the temporal dimension in the network representation. We present recent papers addressing the most well-studied problems in the setting of temporal networks, including computation of centrality measures, motif detection and counting, community detection and monitoring, event and anomaly detection, analysis of epidemic processes and influence spreading, network summarization, and structure prediction.
Original language | English |
---|---|
Title of host publication | KDD '19: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining |
Publisher | ACM |
Pages | 3225-3226 |
Number of pages | 2 |
ISBN (Electronic) | 978-1-4503-6201-6 |
DOIs | |
Publication status | Published - 2019 |
MoE publication type | A4 Article in a conference publication |
Event | ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - Anchorage, United States Duration: 4 Aug 2019 → 8 Aug 2019 Conference number: 25 |
Conference
Conference | ACM SIGKDD International Conference on Knowledge Discovery and Data Mining |
---|---|
Abbreviated title | KDD |
Country/Territory | United States |
City | Anchorage |
Period | 04/08/2019 → 08/08/2019 |
Keywords
- data mining
- graph mining
- temporal networks