CoChat
Cited by 97

The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.

EvoKG: Jointly Modeling Event Time and Network Structure for Reasoning over Temporal Knowledge Graphs

Park, Namyong, Liu, Fuchen, Mehta, Purvanshi, Cristofor, Dana, Faloutsos, Christos, Dong, Yuxiao · 2022 · Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3488560.3498451

Cites

14 of 14 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 An example TKG, where we aim to predict temporal links and event time.
Figure 1 An example TKG, where we aim to predict temporal links and event time.CC-BY · From the PDF
Figure 2 EvoKG wins. EvoKG achieves the best link prediction (top) and time prediction (bottom) results. × indicates that the corresponding method cannot predict event time.
Figure 2 EvoKG wins. EvoKG achieves the best link prediction (top) and time prediction (bottom) results. × indicates that the corresponding method cannot predict event time.CC-BY · From the PDF
Image 3
CC-BY · From the PDF
Figure 3 EvoKG achieves the best event time prediction results, with up to 77% less MAE than the second best method; all improvements are statistically significant with 𝑝 -value < 0.05. Note that many methods for TKGs (marked by × ) cannot predict event time. N/A denotes results are unavailable.
Figure 3 EvoKG achieves the best event time prediction results, with up to 77% less MAE than the second best method; all improvements are statistically significant with 𝑝 -value < 0.05. Note that many methods for TKGs (marked by × ) cannot predict event time. N/A denotes results are unavailable.CC-BY · From the PDF
Figure 4 EvoKG performs training (top) and inference (bottom) up to 30 × and 291 × faster than RE-Net.
Figure 4 EvoKG performs training (top) and inference (bottom) up to 30 × and 291 × faster than RE-Net.CC-BY · From the PDF
Image 6
CC-BY · From the PDF
Figure 6 Modeling event time improves temporal link prediction accuracy on all TKGs, by up to 61%.
Figure 6 Modeling event time improves temporal link prediction accuracy on all TKGs, by up to 61%.CC-BY · From the PDF

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 14 references

Research works printed but not linked: 37

  1. Antoine Bordes, Nicolas Usunier, Alberto Garc'i a-Durá n, Jason Weston, and Oksana Yakhnenko. 2013. Translating Embeddings for Modeling Multi-relational Data. In NIPS. 2787--2795.
  2. Elizabeth Boschee, Jennifer Lautenschlager, Sean O'Brien, Steve Shellman, James Starz, and Michael Ward. 2015. ICEWS coded event data. Harvard Dataverse , Vol. 12 (2015).
  3. Shib Sankar Dasgupta, Swayambhu Nath Ray, and Partha P. Talukdar. 2018. HyTE: Hyperplane-based Temporally aware Knowledge Graph Embedding. In EMNLP. Association for Computational Linguistics, 2001--2011.
  4. Miguel Ramos de Araujo, Pedro Manuel Pinto Ribeiro, and Christos Faloutsos. 2017. TensorCast: Forecasting with Context Using Coupled Tensors (Best Paper Award). In ICDM. IEEE Computer Society, 71--80.
  5. Nan Du Hanjun Dai Rakshit Trivedi Utkarsh Upadhyay Manuel Gomez-Rodriguez and Le Song. 2016. Recurrent Marked Temporal Point Processes: Embedding Event History to Vector. In KDD. ACM 1555--1564. · DOI · Paper page
  6. Alberto Garc'i a-Durá n, Sebastijan Dumancic, and Mathias Niepert. 2018. Learning Sequence Encoders for Temporal Knowledge Graph Completion. In EMNLP. Association for Computational Linguistics, 4816--4821.
  7. Rishab Goel, Seyed Mehran Kazemi, Marcus Brubaker, and Pascal Poupart. 2020. Diachronic Embedding for Temporal Knowledge Graph Completion. In AAAI. AAAI Press, 3988--3995.
  8. Palash Goyal, Sujit Rokka Chhetri, and Arquimedes Canedo. 2020. dyngraph2vec: Capturing network dynamics using dynamic graph representation learning. Knowl. Based Syst. , Vol. 187 (2020).
  9. Palash Goyal, Nitin Kamra, Xinran He, and Yan Liu. 2018. DynGEM: Deep Embedding Method for Dynamic Graphs. CoRR , Vol. abs/1805.11273 (2018). · arXiv
  10. Ekta Gujral, Ravdeep Pasricha, and Evangelos E. Papalexakis. 2020. Beyond Rank-1: Discovering Rich Community Structure in Multi-Aspect Graphs. In WWW. ACM / IW3C2, 452--462.
  11. Zhen Han, Yunpu Ma, Yuyi Wang, Stephan Gü nnemann, and Volker Tresp. 2020. Graph Hawkes Neural Network for Forecasting on Temporal Knowledge Graphs. In AKBC.
  12. Byungsoo Jeon, Inah Jeon, Lee Sael, and U Kang. 2016. SCouT: Scalable coupled matrix-tensor factorization - algorithm and discoveries. In ICDE. IEEE Computer Society, 811--822.
  13. Woojeong Jin, Meng Qu, Xisen Jin, and Xiang Ren. 2020. Recurrent Event Network: Autoregressive Structure Inferenceover Temporal Knowledge Graphs. In EMNLP (1). Association for Computational Linguistics, 6669--6683.
  14. Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In ICLR (Poster) . OpenReview.net.
  15. 10.1137/07070111X · DOI · Paper page
  16. Srijan Kumar Xikun Zhang and Jure Leskovec. 2019. Predicting Dynamic Embedding Trajectory in Temporal Interaction Networks. In KDD. ACM 1269--1278. · DOI · Paper page
  17. Julien Leblay and Melisachew Wudage Chekol. 2018. Deriving Validity Time in Knowledge Graph. In WWW (Companion Volume) . ACM 1771--1776. · DOI · Paper page
  18. Kalev Leetaru and Philip A Schrodt. 2013. Gdelt: Global data on events, location, and tone, 1979--2012. In ISA annual convention , Vol. 2. Citeseer, 1--49.
  19. Farzaneh Mahdisoltani, Joanna Biega, and Fabian M. Suchanek. 2015. YAGO3: A Knowledge Base from Multilingual Wikipedias. In CIDR. www.cidrdb.org.
  20. Tomá s Mikolov Ilya Sutskever Kai Chen Gregory S. Corrado and Jeffrey Dean. 2013. Distributed Representations of Words and Phrases and their Compositionality. In NIPS. 3111--3119.
  21. Giang Hoang Nguyen, John Boaz Lee, Ryan A. Rossi, Nesreen K. Ahmed, Eunyee Koh, and Sungchul Kim. 2018. Continuous-Time Dynamic Network Embeddings. In WWW (Companion Volume) . ACM, 969--976.
  22. Maximilian Nickel, Volker Tresp, and Hans-Peter Kriegel. 2011. A Three-Way Model for Collective Learning on Multi-Relational Data. In ICML. Omnipress, 809--816.
  23. 10.1109/TPDS.2019.2908639 · DOI
  24. Aldo Pareja, Giacomo Domeniconi, Jie Chen, Tengfei Ma, Toyotaro Suzumura, Hiroki Kanezashi, Tim Kaler, Tao B. Schardl, and Charles E. Leiserson. 2020. EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs. In AAAI. AAAI Press, 5363--5370.
  25. Namyong Park Byungsoo Jeon Jungwoo Lee and U Kang. 2016. BIGtensor: Mining Billion-Scale Tensor Made Easy. In CIKM. ACM 2457--2460. · doi:10.1145/2983323.2983332
  26. 10.1007/s00778-019-00538-z · doi:10.1007/s00778-019-00538-z
  27. Aravind Sankar Yanhong Wu Liang Gou Wei Zhang and Hao Yang. 2020. DySAT: Deep Neural Representation Learning on Dynamic Graphs via Self-Attention Networks. In WSDM. ACM 519--527. · DOI · Paper page
  28. Youngjoo Seo, Michaë l Defferrard, Pierre Vandergheynst, and Xavier Bresson. 2018. Structured Sequence Modeling with Graph Convolutional Recurrent Networks. In ICONIP (1) (Lecture Notes in Computer Science), Vol. 11301. Springer, 362--373.
  29. Oleksandr Shchur Marin Bilos and Stephan Gü nnemann. 2020. Intensity-Free Learning of Temporal Point Processes. In ICLR. OpenReview.net. · DOI
  30. Uriel Singer Ido Guy and Kira Radinsky. 2019. Node Embedding over Temporal Graphs. In IJCAI. ijcai.org 4605--4612. · DOI
  31. Richard Socher, Danqi Chen, Christopher D. Manning, and Andrew Y. Ng. 2013. Reasoning With Neural Tensor Networks for Knowledge Base Completion. In NIPS. 926--934.
  32. Rakshit Trivedi, Hanjun Dai, Yichen Wang, and Le Song. 2017. Know-Evolve: Deep Temporal Reasoning for Dynamic Knowledge Graphs. In ICML (Proceedings of Machine Learning Research), Vol. 70. PMLR , 3462--3471.
  33. Rakshit Trivedi Mehrdad Farajtabar Prasenjeet Biswal and Hongyuan Zha. 2019. DyRep: Learning Representations over Dynamic Graphs. In ICLR (Poster) . OpenReview.net.
  34. Chengjin Xu, Mojtaba Nayyeri, Fouad Alkhoury, Jens Lehmann, and Hamed Shariat Yazdi. 2019. Temporal Knowledge Graph Embedding Model based on Additive Time Series Decomposition. CoRR , Vol. abs/1911.07893 (2019). · arXiv
  35. Da Xu, Chuanwei Ruan, Evren Kö rpeoglu, Sushant Kumar, and Kannan Achan. 2020. Inductive representation learning on temporal graphs. In ICLR. OpenReview.net.
  36. Le-kui Zhou, Yang Yang, Xiang Ren, Fei Wu, and Yueting Zhuang. 2018. Dynamic Network Embedding by Modeling Triadic Closure Process. In AAAI. AAAI Press, 571--578.
  37. 10.1109/TKDE.2016.2591009 · DOI · Paper page

Cited by

Metadata

Authors
Park, N., Liu, F., Mehta, P., Cristofor, D., Faloutsos, C., & Dong, Y.
Venue
Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining
Publisher
ACM
Published
2022-02-11
Pages
794-803
Cited by
97
References
14

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.