Provenance in Temporal Interaction Networks
Chrysanthi Kosyfaki, Nikos Mamoulis
Abstract
In temporal interaction networks, vertices correspond to entities, which exchange data quantities (e.g., money, bytes, messages) over time. Tracking the origin of data that have reached a given vertex at any time can help data analysts to understand the reasons behind the accumulated quantity at the vertex or behind the interactions between entities. In this paper, we study data provenance in a temporal interaction network. We investigate alternative propagation models that may apply to different application scenarios. For each such model, we propose annotation mechanisms that track the origin of propagated data in the network and the routes of data quantities. Besides analyzing the space and time complexity of these mechanisms, we propose techniques that reduce their cost in practice, by either (i) limiting provenance tracking to a subset of vertices or groups of vertices, or (ii) tracking provenance only for quantities that were generated in the near past or limiting the provenance data in each vertex by a budget constraint. Our experimental evaluation on five real datasets shows that quantity propagation models based on generation time or receipt order scale well on large graphs; on the other hand, a model that propagates quantities proportionally has high space and time requirements and can benefit from the aforementioned cost reduction techniques.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 12e8bfbc-8913-4c41-a48c-036e6a4e992bCited by top-tier papers1
Ask how each one uses itBuilds on6
- A Data-Driven Graph Generative Model for Temporal Interaction NetworksDawei Zhou, Lecheng Zheng, Jiawei Han, Jingrui HeKDD 2020 · 97 citations
- Vamsa: Automated Provenance Tracking in Data Science ScriptsMohammad Hossein Namaki, Avrilia Floratou, Fotis Psallidas, Subru Krishnan et al.KDD 2020 · 41 citations
- Approximate Summaries for Why and Why-not ProvenanceSeokki Lee, Bertram Ludäscher, Boris GlavicVLDB 2020 · 29 citations
- Mining Persistent Activity in Continually Evolving NetworksCaleb Belth, Xinyi Zheng, Danai KoutraKDD 2020 · 19 citations
- Flow Computation in Temporal Interaction NetworksChrysanthi Kosyfaki, Nikos Mamoulis, Evaggelia Pitoura, Panayiotis TsaparasICDE 2021 · 5 citations
Related papers
- Efficient Exact and Approximate Betweenness Centrality Computation for Temporal GraphsTianming Zhang, Yunjun Gao, Jie Zhao, Lu Chen et al.WWW 2024 · 18 citations
- Algorithmic Aspects of Temporal BetweennessSebastian Buß, Hendrik Molter, Rolf Niedermeier, Maciej RymarKDD 2020 · 31 citations
- Deep Temporal Graph ClusteringMeng Liu, Yue Liu, Ke Liang, Wenxuan Tu et al.ICLR 2024
- Temporal Walk Centrality: Ranking Nodes in Evolving NetworksLutz Oettershagen, Petra Mutzel, Nils M. KriegeWWW 2022 · 25 citations
- Clustering-based Partitioning for Large Web GraphsDeyu Kong, Xike Xie, Zhuoxu ZhangICDE 2022 · 22 citations
