A Critical Examination of RESCAL for Completion of Knowledge Bases with Transitive Relations
원문 초록
Link prediction in large knowledge graphs has received a lot of attention recently because of its importance for inferring missing relations and for completing and improving noisily extracted knowledge graphs. Over the years a number of machine learning researchers have presented various models for predicting the presence of missing relations in a knowledge base. Although all the previous methods are presented with empirical results that show high performance on select datasets, there is almost no previous work on understanding the connection between properties of a knowledge base and the performance of a model. In this paper we analyze the RESCAL method and prove that it can not encode asymmetric transitive relations in knowledge bases.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs
A Survey of Link Prediction in N-ary Knowledge Graphs
GenIC: An LLM-Based Framework for Instance Completion in Knowledge Graphs
Structural Alignment in Link Prediction
Social Biases in Knowledge Representations of Wikidata separates Global North from Global South
A Systematic Evaluation of Knowledge Graph Embeddings for Gene-Disease Association Prediction
토론
이 논문과 연결된 포럼 글이 아직 없습니다.