The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Tensor Decomposition-Based Temporal Knowledge Graph Embedding
Abstract
In order to meet the problems caused by sparse data and computational efficiency, knowledge graph (KG) is adopted to represent the semantic information of entities and relations as dense and low-dimensional vectors. While conventional KG representation methods mainly focuse on static data. These methods fail to deal with data that evolves with time which may only be valid for a certain period of time. To accommodate this problem, a temporal KG embedding model based on tensor decomposition is proposed in this paper, which regards the fact set in the KG as a fourth-order tensor including head entities, relations, tail entities and time dimensions. This method can be further generalized to other static KG embedding based on tensor decomposition. With experiments on temporal datasets extracted from real-world KG, extensive experiment results show that our approach outperforms state-of-the-art methods of KG embedding.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
[Lin and She, 2020] adopts an imaginary timestamp for static facts so that the model can learn from facts without timestamps.
“An imaginary timestamp is adopted for static facts so that the model is also capable of learning from facts without timestamps.”
From Temporal Knowledge Graph Completion: A Survey (2023) · cites this paper as Lin and She, 2020
[Lin and She, 2020] adopts CP decomposition for TKGC by regarding a knowledge graph as G ∈ R |E|×|R|×|E|×|T |.
“[Lin and She, 2020] adopts CP decomposition for TKGC by regarding a knowledge graph as G ∈ R |E|×|R|×|E|×|T | .”
From Temporal Knowledge Graph Completion: A Survey (2023) · cites this paper as Lin and She, 2020
[Lin and She, 2020] and [Lacroix et al., 2020] adopt temporal smoothness penalties to ensure neighboring timestamps learn similar representations.
“These two models further adopt temporal smoothness penalties to ensure neighboring timestamps learn similar representations.”
From Temporal Knowledge Graph Completion: A Survey (2023) · cites this paper as Lin and She, 2020
Citations
Cites
Complex Embeddings for Simple Link Prediction
Trouillon, T., Welbl, J., Riedel, S., Gaussier, É., & Bouchard, G. (2016) · arXiv · doi:10.48550/arxiv.1606.06357 · Cited by 2,100
Flagged first, then by citations
Research works printed but not linked: 24
- bordes, 0, Learning structured embeddings of knowledge bases[C], Twenty-Fifth AAAI Conference on Artificial Intelligence
- socher, 2013, Reasoning with neural tensor networks for knowledge base completion [C], Proc of NIPS, 926
- 10.1007/s10994-013-5363-6 · DOI · Paper page
- jiang, 0, Towards time-aware knowledge graph completion[C], Proceedings of COLING 2016 the 26th International Conference on Computational Linguistics Technical Papers, 1715
- 10.18653/v1/D18-1225 · DOI · Paper page
- 10.18653/v1/D18-1516 · DOI · Paper page
- nickel, 0, A three-way model for collective learning on multi-relational data[C], ICML, 11, 809
- goel, 2019, Diachronic embedding for temporal knowledge graph completion[J]
- bordes, 2013, Translating embeddings for modeling multi-relational data[C], Advances in neural information processing systems, 2787
- 10.3115/v1/P15-1026 · DOI
- boschee, 2015, ICEWS coded event data[J], Harvard dataverse, 12
- qin, 0, A survey on knowledge graph based recommender systems[J], Scientia Sinica Informationis
- 10.1109/ICDE.2013.6544920 · DOI
- 10.1002/sapm192761164 · DOI · Paper page
- kazemi, 2018, Simple embedding for link prediction in knowledge graphs[C], Advances in neural information processing systems, 4284
- 10.3233/SW-140134 · DOI
- yang, 2014, Embedding entities and relations for learning and inference in knowledge bases[J]
- 10.1145/1242572.1242667 · DOI · Paper page
- wang, 0, Knowledge graph embedding by translating on hyperplanes[C], Twenty-Eighth AAAI Conference on Artificial Intelligence
- paszke, 2017, Automatic differentiation in pytorch[J]
- lin, 2015, Learning entity and relation embedding for knowledge graph completion[C], Proc Of AAAI, 10.1609/aaai.v29i1.9491 · DOI · Paper page
- leetaru, 0, GDELT: Global data on events, location, and tone[C], ISA Annual Convention
- kingma, 2014, Adam A method for stochastic optimization[J]
- mikolov, 2013, Efficient estimation of word representations in vector space[J]
Cited by
Sorted by citations
Temporal Knowledge Graph Completion: A Survey
Cai, B., Xiang, Y., Gao, L., Zhang, H., Li, Y., & Li, J. (2023) · Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2023/734 · Cited by 133
A Survey on Temporal Knowledge Graph: Representation Learning and Applications
Cai, L., Mao, X., Zhou, Y., Long, Z., Wu, C., & Lan, M. (2024) · arXiv · doi:10.48550/arxiv.2403.04782 · Cited by 68
Metadata
- Authors
- Lin, L., & She, K.
- Venue
- 2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI)
- Publisher
- IEEE
- Published
- 2020-11
- Pages
- 969-975
- Cited by
- 10
- References
- 1
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