Kairos: Enabling Prompt Monitoring of Information Diffusion Over Temporal Networks

被引:1
作者
Gaza, Haifa [1 ]
Byun, Jaewook [1 ]
机构
[1] Sejong Univ, Seoul 05006, South Korea
基金
新加坡国家研究基金会;
关键词
Information diffusion; Lifting equipment; Monitoring; Cryptocurrency; Engines; Dictionaries; Delays; Kairos; ChronoGraph; temporal graph traversal; incremental graph processing; temporal information diffusion;
D O I
10.1109/TKDE.2023.3347621
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Analyses of temporal graphs provide valuable insights into temporal data through the use of two analytical approaches: temporal evolution and temporal information diffusion. The former shows how a network evolves over time; the latter explains how information spreads throughout a network over time. Systems have been mainly proposed to efficiently handle graph snapshots, which are suitable for temporal evolution but inappropriate for temporal information diffusion. For analyses of temporal information diffusion, temporal graph traversal platforms have recently been proposed; however, it is still infeasible to handle infinitely evolving temporal data, especially for monitoring applications. In this paper, we propose an incremental approach and its graph processing engine, Kairos, to enable prompt monitoring of temporal information diffusion. This approach makes it possible to immediately process diffusion results for sources of interest by traversing a part of the whole network, which avoids full traversals influenced by a small change in the network, thus making monitoring applications feasible. The recipes for implementing incremental versions of existing temporal graph traversal algorithms and metrics will make it easier for users to build their ad-hoc programs.
引用
收藏
页码:8607 / 8621
页数:15
相关论文
共 47 条
[21]   The Sinkhorn-Knopp algorithm: Convergence and applications [J].
Knight, Philip A. .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2008, 30 (01) :261-275
[22]   An Adversarial Approach to Improve Long-Tail Performance in Neural Collaborative Filtering [J].
Krishnan, Adit ;
Sharma, Ashish ;
Sankar, Aravind ;
Sundaram, Hari .
CIKM'18: PROCEEDINGS OF THE 27TH ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2018, :1491-1494
[23]   The Hungarian Method for the assignment problem [J].
Kuhn, HW .
NAVAL RESEARCH LOGISTICS, 2005, 52 (01) :7-21
[24]  
Liang D., 2016, P CAUS FDN APPL WORK, V6, P108
[25]   A Graph-Enhanced Click Model for Web Search [J].
Lin, Jianghao ;
Liu, Weiwen ;
Dai, Xinyi ;
Zhang, Weinan ;
Li, Shuai ;
Tang, Ruiming ;
He, Xiuqiang ;
Hao, Jianye ;
Yu, Yong .
SIGIR '21 - PROCEEDINGS OF THE 44TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2021, :1259-1268
[26]  
Lin XR, 2022, AAAI CONF ARTIF INTE, P1620
[27]   A General Knowledge Distillation Framework for Counterfactual Recommendation via Uniform Data [J].
Liu, Dugang ;
Cheng, Pengxiang ;
Dong, Zhenhua ;
He, Xiuqiang ;
Pan, Weike ;
Ming, Zhong .
PROCEEDINGS OF THE 43RD INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '20), 2020, :831-840
[28]   Counterfactual Evaluation of Slate Recommendations with Sequential Reward Interactions [J].
McInerney, James ;
Brost, Brian ;
Chandar, Praveen ;
Mehrotra, Rishabh ;
Ben Carterette .
KDD '20: PROCEEDINGS OF THE 26TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2020, :1779-1788
[29]  
Meo P. D., 2008, Fast unfolding of communities in large networks
[30]  
Pearl J, 2009, Causality: Models, Reasoning, and Inference, V2