The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Knowledge Graph Completion with Adaptive Sparse Transfer Matrix
Open accessAbstract
We model knowledge graphs for their completion by encoding each entity and relation into a numerical space. All previous work including Trans(E, H, R, and D) ignore the heterogeneity (some relations link many entity pairs and others do not) and the imbalance (the number of head entities and that of tail entities in a relation could be different) of knowledge graphs. In this paper, we propose a novel approach TranSparse to deal with the two issues. In TranSparse, transfer matrices are replaced by adaptive sparse matrices, whose sparse degrees are determined by the number of entities (or entity pairs) linked by relations. In experiments, we design structured and unstructured sparse patterns for transfer matrices and analyze their advantages and disadvantages. We evaluate our approach on triplet classification and link prediction tasks. Experimental results show that TranSparse outperforms Trans(E, H, R, and D) significantly, and achieves state-of-the-art performance.
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.
Integrity signals
Registry
Cites
Statistics
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.
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?
In the citing paper
“Then, TransRHS [30] first considers the Relation Hierarchical Structure (RHS) by incorporating RHS seamlessly into the embeddings.”
From A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multi-Modal (2024) · cites this paper as [30]
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
WordNet: a lexical database for English
Miller, G. A. (1995) · Communications of the ACM · doi:10.1145/219717.219748 · Cited by 14,015 · cited 1×
“We do triplet classification and link prediction tasks on WordNet (Miller 1995) and Freebase (Bollacker et al.”
MethodIterative Methods for Sparse Linear Systems
Saad, Y. (2003) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718003 · Cited by 13,790
(2010) · Cited by 8,261
Robust principal component analysis?
Candès, E. J., Li, X., Ma, Y., & Wright, J. (2011) · Journal of the ACM · doi:10.1145/1970392.1970395 · Cited by 6,921
(2013) · Cited by 5,726
Freebase: a collaboratively created graph database for structuring human knowledge
Bollacker, K., Evans, C., Paritosh, P., Sturge, T., & Taylor, J. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376746 · Cited by 4,852
Knowledge Graph Embedding by Translating on Hyperplanes
Wang, Z., Zhang, J., Feng, J., & Chen, Z. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8870 · Cited by 3,915
Learning Entity and Relation Embeddings for Knowledge Graph Completion
Lin, Y., Liu, Z., Sun, M., Liu, Y., & Zhu, X. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9491 · Cited by 3,749
5.7 The WORDNET lexical database of English
(2019) · Computer Corpus Lexicography · doi:10.1515/9781474471459-050 · Cited by 1,865
Knowledge Graph Embedding via Dynamic Mapping Matrix
Ji, G., He, S., Xu, L., Liu, K., & Zhao, J. (2015) · Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.3115/v1/p15-1067 · Cited by 1,816
Self-citation
Cited by
A Survey on Knowledge Graphs: Representation, Acquisition, and Applications
Ji, S., Pan, S., Cambria, E., Marttinen, P., & Yu, P. S. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3070843 · Cited by 2,947
Knowledge Graph Embedding: A Survey of Approaches and Applications
Wang, Q., Mao, Z., Wang, B., & Guo, L. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2754499 · Cited by 2,654
A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications
Cai, H., Zheng, V. W., & Chang, K. C.-C. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2807452 · Cited by 2,034
A review: Knowledge reasoning over knowledge graph
Chen, X., Jia, S., & Xiang, Y. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.112948 · Cited by 1,035
A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Network
Nguyen, D. Q., Nguyen, T. D., Nguyen, D. Q., & Phung, D. (2018) · Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Short Papers) · doi:10.18653/v1/n18-2053 · Cited by 923
Knowledge Graphs: Opportunities and Challenges
Peng, C., Xia, F., Naseriparsa, M., & Osborne, F. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10465-9 · Cited by 717
A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multi-Modal
Liang, K., Meng, L., Liu, M., Liu, Y., Tu, W., Wang, S., Zhou, S., Liu, X., Sun, F., & He, K. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2024.3417451 · Cited by 553
A Comprehensive Survey on Automatic Knowledge Graph Construction
Zhong, L., Wu, J., Li, Q., Peng, H., & Wu, X. (2024) · ACM Computing Surveys · doi:10.1145/3618295 · Cited by 382
KG-BERT: BERT for Knowledge Graph Completion
Yao, L., Mao, C., & Luo, Y. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.03193 · Cited by 366
Knowledge Graph Completion: A Review
Chen, Z., Wang, Y., Zhao, B., Cheng, J., Zhao, X., & Duan, Z. (2020) · IEEE Access · doi:10.1109/access.2020.3030076 · Cited by 346
Knowledge Transfer for Out-of-Knowledge-Base Entities : A Graph Neural Network Approach
Hamaguchi, T., Oiwa, H., Shimbo, M., & Matsumoto, Y. (2017) · Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/250 · Cited by 291
A Survey on Knowledge Graph Embedding: Approaches, Applications and Benchmarks
Dai, Y., Wang, S., Xiong, N. N., & Guo, W. (2020) · Electronics · doi:10.3390/electronics9050750 · Cited by 263
A Survey on Knowledge Graph Embeddings for Link Prediction
Wang, M., Qiu, L., & Wang, X. (2021) · Symmetry · doi:10.3390/sym13030485 · Cited by 212
Knowledge Base Completion: Baselines Strike Back
Kadlec, R., Bajgar, O., & Kleindienst, J. (2017) · Proceedings of the 2nd Workshop on Representation Learning for NLP · doi:10.18653/v1/w17-2609 · Cited by 173
“…303 86.7 - 87 64.4 - TransR (Lin et al., 2015b) 225 92.0 - 77 68.7 - CTransR (Lin et al., 2015b) 218 92.3 - 75 70.2 - KG2E (He et al., 2015) 331 92.8 - 59 74.0 - TransD (Ji et al., 2015) 212 92.2 - 91 77.3 - lppTransD (Yoon et al., 2016) 270 94.3 - 78 78.7 - TranSparse (Ji et al., 2016) 211 93.”
InfluentialModeling Relation Paths for Knowledge Graph Completion
Shen, Y., Ding, N., Zheng, H.-T., Li, Y., & Yang, M. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.2970044 · Cited by 153
Knowledge Graph Representation with Jointly Structural and Textual Encoding
Xu, J., Qiu, X., Chen, K., & Huang, X. (2017) · Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/183 · Cited by 121
Knowledge Graph Quality Management: a Comprehensive Survey
Xue, B., & Zou, L. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3150080 · Cited by 108
TransMS: Knowledge Graph Embedding for Complex Relations by Multidirectional Semantics
Yang, S., Tian, J., Zhang, H., Yan, J., He, H., & Jin, Y. (2019) · Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2019/268 · Cited by 75
BoxE: A Box Embedding Model for Knowledge Base Completion
Abboud, R., Ceylan, İ. İ., Lukasiewicz, T., & Salvatori, T. (2020) · arXiv · doi:10.48550/arxiv.2007.06267 · Cited by 74
Machine Learning for Refining Knowledge Graphs: A Survey
Subagdja, B., Shanthoshigaa, D., Wang, Z., & Tan, A.-H. (2024) · ACM Computing Surveys · doi:10.1145/3640313 · Cited by 24
Timespan-Aware Dynamic Knowledge Graph Embedding by Incorporating Temporal Evolution
Tang, X., Yuan, R., Li, Q., Wang, T., Yang, H., Cai, Y., & Song, H. (2020) · IEEE Access · doi:10.1109/access.2020.2964028 · Cited by 19
Composing Knowledge Graph Embeddings via Word Embeddings
Ma, L., Sun, P., Lin, Z., & Wang, H. (2019) · arXiv · doi:10.48550/arxiv.1909.03794 · Cited by 9
Metadata
- Authors
- Ji, G., Liu, K., He, S., & Zhao, J.
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2016-02-21
- Volume
- 30
- Issue
- 1
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W2433281745
- Cited by
- 425
- References
- 22
- FWCI
- 23.78
- Type
- conference paper
- Language
- en
- Open access
- diamond
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.