Towards event prediction in temporal graphs

Author:

Fan Wenfei1,Jin Ruochun2,Lu Ping3,Tian Chao4,Xu Ruiqi5

Affiliation:

1. University of Edinburgh and Shenzhen Institute of Computing Sciences and Beihang University

2. University of Edinburgh

3. Beihang University

4. Chinese Academy of Sciences

5. National University of Singapore

Abstract

This paper proposes a class of temporal association rules, denoted by TACOs, for event prediction. As opposed to previous graph rules, TACOs monitor updates to graphs, and can be used to capture temporal interests in recommendation and catch frauds in response to behavior changes, among other things. TACOs are defined on temporal graphs in terms of change patterns and (temporal) conditions, and may carry machine learning (ML) predicates for temporal event prediction. We settle the complexity of reasoning about TACOs, including their satisfiability, implication and prediction problems. We develop a system, referred to as TASTE. TASTE discovers TACOs by iteratively training a rule creator based on generative ML models in a creator-critic framework. Moreover, it predicts events by applying the discovered TACOs. Using real-life and synthetic datasets, we experimentally verify that TASTE is on average 31.4 times faster than conventional data mining methods in TACO discovery, and it improves the accuracy of state-of-the-art event prediction models by 23.4%.

Publisher

Association for Computing Machinery (ACM)

Subject

General Earth and Planetary Sciences,Water Science and Technology,Geography, Planning and Development

Reference111 articles.

1. Réka Albert and Albert-László Barabási . 2002. Statistical mechanics of complex networks. Reviews of modern physics 74, 1 ( 2002 ), 47. Réka Albert and Albert-László Barabási. 2002. Statistical mechanics of complex networks. Reviews of modern physics 74, 1 (2002), 47.

2. Boanerges Aleman-Meza , Christian Halaschek-Wiener , Ismailcem Budak Arpinar, and Amit P. Sheth . 2003 . Context-Aware Semantic Association Ranking . In SWDB. Boanerges Aleman-Meza, Christian Halaschek-Wiener, Ismailcem Budak Arpinar, and Amit P. Sheth. 2003. Context-Aware Semantic Association Ranking. In SWDB.

3. Balanced Graph Partitioning

4. Marcelo Arenas , Pedro Bahamondes , and Julia Stoyanovich . 2021. Temporal Regular Path Queries: Syntax, Semantics, and Complexity. CoRR abs/2107.01241 ( 2021 ). Marcelo Arenas, Pedro Bahamondes, and Julia Stoyanovich. 2021. Temporal Regular Path Queries: Syntax, Semantics, and Complexity. CoRR abs/2107.01241 (2021).

5. Michele Berlingerio Francesco Bonchi Björn Bringmann and Aristides Gionis. 2009. Mining Graph Evolution Rules. In ECML/PKDD. Michele Berlingerio Francesco Bonchi Björn Bringmann and Aristides Gionis. 2009. Mining Graph Evolution Rules. In ECML/PKDD.

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Enriching Recommendation Models with Logic Conditions;Proceedings of the ACM on Management of Data;2023-11-13

2. Making It Tractable to Catch Duplicates and Conflicts in Graphs;Proceedings of the ACM on Management of Data;2023-05-26

3. System Network Analytics: Evolution and Stable Rules of a State Series;2022 IEEE 9th International Conference on Data Science and Advanced Analytics (DSAA);2022-10-13

4. Big graphs;Proceedings of the VLDB Endowment;2022-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3