A case-based reasoning (CBR) system solves a new problem by retrieving `cases' that are similar to the given problem. If such a system can achieve high accuracy, it is appealing owing to its simplicity, interpretability, and scalability. In this paper, we demonstrate that such a system is achievable for reasoning in knowledge-bases (KBs). Our approach predicts attributes for an entity by gathering reasoning paths from similar entities in the KB. Our probabilistic model estimates the likelihood that a path is effective at answering a query about the given entity. The parameters of our model can be efficiently computed using simple path statistics and require no iterative optimization. Our model is non-parametric, growing dynamically as new entities and relations are added to the KB. On several benchmark datasets our approach significantly outperforms other rule learning approaches and performs comparably to state-of-the-art embedding-based approaches. Furthermore, we demonstrate the effectiveness of our model in an "open-world" setting where new entities arrive in an online fashion, significantly outperforming state-of-the-art approaches and nearly matching the best offline method. Code available at https://github.com/ameyagodbole/Prob-CBR
Dynamic Anticipation and Completion for Multi-Hop Reasoning over Sparse Knowledge Graph
Department of Computer Science and Technology, BNRist(计算机科学与技术系,BNRist);KIRC, Institute for Artificial Intelligence, Tsinghua University(清华大学人工智能研究院,知识图谱与智能推理中心(KIRC));Alibaba Group(阿里巴巴集团)
Large Language Model-Enhanced Symbolic Reasoning for Knowledge Base Completion
College of Computing and Data Science, Nanyang Technological University(南洋理工大学计算与数据科学学院);School of Computer Science and Engineering, Nanjing University of Science and Technology(南京理工大学计算机科学与工程学院)
One Subgraph for All: Efficient Reasoning on Opening Subgraphs for Inductive Knowledge Graph Completion
School of Computer Science, Central China Normal University(华中师范大学计算机学院);Faculty of Artificial Intelligence in Education, Central China Normal University(华中师范大学人工智能教育学部);School of Computer Science, Wuhan University(武汉大学计算机学院);York University(约克大学)
StruProKGR: A Structural and Probabilistic Framework for Sparse Knowledge Graph Reasoning
CAS Key Laboratory of Network Data Science and Technology, Institute of Computing Technology, Chinese Academy of Sciences(中国科学院网络数据科学与技术重点实验室,计算技术研究所);School of Computer Science and Technology, University of Chinese Academy of Sciences(中国科学院大学计算机科学与技术学院)
GMH: A General Multi-hop Reasoning Model for KG Completion
Nankai University(南开大学);Sichuan University(四川大学);University of Innsbruck(因斯布鲁克大学);National University of Singapore(新加坡国立大学);Mashang Consumer Finance Co., Ltd.(马上消费金融股份有限公司)
Context-aware Inductive Knowledge Graph Completion with Latent Type Constraints and Subgraph Reasoning
The Chinese University of Hong Kong(香港中文大学);International Digital Economy Academy(国际数字经济研究院);Hong Kong University of Science and Technology (Guangzhou)(香港科技大学(广州));University of Cambridge(剑桥大学)
COTCAgent: Preventive Consultation via Probabilistic Chain-of-Thought Completion
School of Computing and Data Science, The University of Hong Kong(香港大学计算与数据科学学院);Shenzhen Institute for Advanced Study, University of Electronic Science and Technology of China(中国电子科学与技术大学深圳高级研究所);School of Computer Science, The University of Sydney(悉尼大学计算机科学学院)
Path-based knowledge reasoning with textual semantic information for medical knowledge graph completion
Institute of Automation, Chinese Academy of Sciences(中国科学院自动化研究所);University of Chinese Academy of Sciences(中国科学院大学);Beijing Unisound Information Technology Co., Ltd(北京云知声信息技术有限公司)
Beyond Completion: A Foundation Model for General Knowledge Graph Reasoning
Zhejiang University(浙江大学);Shopee Pte.Ltd.(Shopee公司);University of Macau(澳门大学);Zhejiang Key Laboratory of Big Data Intelligent Computing(浙江大学大数据智能计算重点实验室)
Humans and LLMs Diverge on Probabilistic Inferences
McGill University(麦吉尔大学);Mila – Quebec AI Institute(魁北克人工智能研究所);University of Vienna(维也纳大学);FNRS – UCLouvain(佛罗伦萨-鲁汶大学);Canada CIFAR AI Chair(加拿大CIFAR人工智能主席)