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 条
[1]   Controlling Popularity Bias in Learning-to-Rank Recommendation [J].
Abdollahpouri, Himan ;
Burke, Robin ;
Mobasher, Bamshad .
PROCEEDINGS OF THE ELEVENTH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS'17), 2017, :42-46
[2]   Some new estimates of the 'Jensen gap' [J].
Abramovich, Shoshana ;
Persson, Lars-Erik .
JOURNAL OF INEQUALITIES AND APPLICATIONS, 2016, :1-9
[3]   Minimizing flows for the Monge-Kantorovich problem [J].
Angenent, S ;
Haker, S ;
Tannenbaum, A .
SIAM JOURNAL ON MATHEMATICAL ANALYSIS, 2003, 35 (01) :61-97
[4]  
Chapelle O., 2009, P 18 INT C WORLD WID, P1, DOI DOI 10.1145/1526709.1526711
[5]   Modeling Dynamic User Preference via Dictionary Learning for Sequential Recommendation [J].
Chen, Chao ;
Li, Dongsheng ;
Yan, Junchi ;
Yang, Xiaokang .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2022, 34 (11) :5446-5458
[6]  
Chen JW, 2021, Arxiv, DOI arXiv:2010.03240
[7]  
Clevert DA, 2016, Arxiv, DOI [arXiv:1511.07289, 10.48550/arXiv.1511.07289]
[8]  
Craswell Nick, 2008, P 2008 INT C WEB SEA, DOI [10.1145/1341531, DOI 10.1145/1341531.1341545]
[9]  
Ding L, 2022, AAAI CONF ARTIF INTE, P11864
[10]   Should Graph Convolution Trust Neighbors? A Simple Causal Inference Method [J].
Feng, Fuli ;
Huang, Weiran ;
He, Xiangnan ;
Xin, Xin ;
Wang, Qifan ;
Chua, Tat-Seng .
SIGIR '21 - PROCEEDINGS OF THE 44TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2021, :1208-1218