From Chain to Tree: Refining Chain-like Rules into Tree-like Rules on Knowledge Graphs
원문 초록
With good explanatory power and controllability, rule-based methods play an important role in many tasks such as knowledge reasoning and decision support. However, existing studies primarily focused on learning chain-like rules, which limit their semantic expressions and accurate prediction abilities. As a result, chain-like rules usually fire on the incorrect grounding values, producing inaccurate or even erroneous reasoning results. In this paper, we propose the concept of tree-like rules on knowledge graphs to expand the application scope and improve the reasoning ability of rule-based methods. Meanwhile, we propose an effective framework for refining chain-like rules into tree-like rules. Experimental comparisons on four public datasets show that the proposed framework can easily adapt to other chain-like rule induction methods and the refined tree-like rules consistently achieve better performances than chain-like rules on link prediction. The data and code of this paper can be available at https://anonymous.4open.science/r/tree-rule-E3CD/.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.