CoChat
Sign Up
Cited by 19

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

Timespan-Aware Dynamic Knowledge Graph Embedding by Incorporating Temporal Evolution

Tang, Xiaoli, Yuan, Rui, Li, Qianyu, Wang, Tengyun, Yang, Haizhi, Cai, Yundong, Song, Hengjie·2020·IEEE Access
DOI 10.1109/access.2020.2964028
Open this paper in CoChat — free account

Overview

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1109/access.2020.2964028

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Flagged first, then by citations

Show all 3 references

Research works printed but not linked: 49

  1. 10.1145/2623330.2623623 · DOI · Paper page
  2. dettmers, 2018, Convolutional 2D knowledge graph embeddings, Proc 32nd AAAI Conf Artif Intell
  3. yang, 2014, Embedding entities and relations for learning and inference in knowledge bases, arXiv 1412 6575
  4. ji, 2016, Knowledge graph completion with adaptive sparse transfer matrix, Proc 30th AAAI Conf Artif Intell
  5. 10.3115/v1/P15-1067 · DOI
  6. liu, 2019, Context-aware temporal knowledge graph embedding, Proc Int Conf Web Inf Syst Eng, 583
  7. balaževi?, 2019, Hypernetwork knowledge graph embeddings, Proc Int Conf Artif Neural Netw, 553
  8. nickel, 2016, Holographic embeddings of knowledge graphs, Proc 30th AAAI Conf Artif Intell
  9. kazemi, 2019, Relational representation learning for dynamic (knowledge) graphs: A survey, arXiv 1905 11485
  10. 10.18653/v1/D16-1260 · DOI
  11. jin, 2019, Recurrent event network: Global structure inference over temporal knowledge graph, arXiv 1904 05530
  12. 10.3233/SW-140134 · DOI
  13. 10.1145/1376616.1376746 · DOI · Paper page
  14. socher, 2013, Reasoning with neural tensor networks for knowledge base completion, Proc Adv Neural Inf Process Syst, 926
  15. 10.1109/TKDE.2018.2807452 · DOI · Paper page
  16. 10.1016/j.knosys.2018.03.022 · DOI · Paper page
  17. 10.18653/v1/D18-1225 · DOI · Paper page
  18. 10.1007/s10115-013-0693-z · DOI
  19. feng, 2016, Knowledge graph embedding by flexible translation, Proc 15th Int Conf Principles Knowl Represent Reasoning
  20. chung, 2014, Empirical evaluation of gated recurrent neural networks on sequence modeling, arXiv 1412 3555
  21. 10.1109/ACCESS.2019.2932466 · DOI
  22. erxleben, 2014, Introducing Wikidata to the linked data Web, Proc Int Semantic Web Conf, 50
  23. wang, 2016, Text-enhanced representation learning for knowledge graph, Proc IJCAI, 1293
  24. 10.1145/2506182.2506198 · DOI
  25. bordes, 2014, Open question answering with weakly supervised embedding models, Proc Knowl Discovery Data Mining, 165
  26. 10.1109/TKDE.2016.2591009 · DOI
  27. 10.3115/v1/D14-1067 · DOI
  28. 10.1109/TKDE.2017.2754499 · DOI · Paper page
  29. nickel, 2011, A three-way model for collective learning on multi-relational data, Proc ICML, 11, 809
  30. bordes, 2013, Translating embeddings for modeling multi-relational data, Proc Adv Neural Inf Process Syst, 2787
  31. lin, 2015, Learning entity and relation embeddings for knowledge graph completion, Proc 29th AAAI Conf Artif Intell
  32. jenatton, 2012, A latent factor model for highly multi-relational data, Proc Adv Neural Inf Process Syst, 3167
  33. 10.1007/s10994-013-5363-6 · DOI · Paper page
  34. carlson, 2010, Toward an architecture for never-ending language learning, Proc 24th AAAI Conf Artif Intell
  35. 10.1145/1242572.1242667 · DOI · Paper page
  36. heck, 2013, Leveraging knowledge graphs for Web-scale unsupervised semantic parsing, Proc INTERSPEECH
  37. berant, 2013, Semantic parsing on freebase from question-answer pairs, Proc Conf Empirical Methods Natural Lang Process, 1533
  38. 10.1109/WI-IAT.2012.26 · DOI
  39. damljanovic, 2012, Named entity disambiguation using linked data, 9th Extended Semantic Web Conference, 231
  40. 10.1145/3184558.3191639 · DOI · Paper page
  41. hoffmann, 2011, Knowledge-based weak supervision for information extraction of overlapping relations, Proc Annu Meeting Assoc Comput Linguist Conf Human Lang Technol, 1, 541
  42. pareja, 2019, EvolveGCN: Evolving graph convolutional networks for dynamic graphs, arXiv 1902 10191
  43. palm, 2018, Recurrent relational networks, Proc Adv Neural Inf Process Syst, 3368
  44. 10.18653/v1/D18-1516 · DOI · Paper page
  45. trivedi, 2017, Know-evolve: Deep temporal reasoning for dynamic knowledge graphs, Proc Int Conf Mach Learn (JMLR), 70, 3462
  46. 10.1145/3219819.3220054 · DOI
  47. zhou, 2018, Dynamic network embedding by modeling triadic closure process, Proc 32nd AAAI Conf Artif Intell
  48. battaglia, 2018, Relational inductive biases, deep learning, and graph networks, arXiv 1806 01261
  49. sanchez-gonzalez, 2018, Graph networks as learnable physics engines for inference and control, arXiv 1806 01242

Cited by

Sorted by citations

See all 19

Metadata

Authors
Tang, X., Yuan, R., Li, Q., Wang, T., Yang, H., Cai, Y., & Song, H.
ORCID
Venue
IEEE Access
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Published
2020
Volume
8
Pages
6849-6860
ISSN
2169-3536
DOI
10.1109/access.2020.2964028
Cited by
19
References
3
Licence
creativecommons.org/licenses/by/4.0/legalcode (vor)
Funders
  • Pre-Research Foundation of China (61400010205)
  • National Natural Science Foundation of China (71671069)
  • National Basic Research Program of China (2018YFC0830900)

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