计算机科学
关系(数据库)
背景(考古学)
归纳推理
自然语言处理
人工智能
上下文模型
认知科学
机器学习
数据挖掘
心理学
生物
古生物学
对象(语法)
作者
Xiaoshu Chen,Sihang Zhou,Ke Liang,Jiafei Wu,Xinwang Liu,Dongsheng Li,Kai Lu
标识
DOI:10.1109/tkde.2025.3591056
摘要
Inductive relation prediction aims to predict missing connections between entities unseen during training. Recent approaches adopt binary (positive or negative) training labels, which indicate whether the query relation exists between the entities, as supervision to teach models recognizing the entity-independent relation patterns in the context (enclosed subgraph or connective path). However, we argue that in this kind of method, the trained models are guided to make relation predictions by remembering whether the query relation and its contextual relational pattern co-occur more frequently in positive or negative samples. This solution could introduce two major limitations: 1) the model struggles with long-tail combinations, i.e., the combination between query relation and the relational pattern rarely occurs during training; 2) when noisy relational patterns, which fail to provide evidence for predicting the query relation, frequently occur with the query relation in positive training samples, the model will be misled into considering the noisy relational patterns as a feature supporting the existence of the query relation. To solve these problems, we propose ToC (Thinking on Context). ToC first utilizes large language models (LLMs) to incorporate a chain of thought as an additional supervisory constraint, guiding the model to make relational predictions based on logical reasoning instead of co-occurrence frequency. Additionally, ToC employs the reasoning capabilities of LLMs to construct context-level negative samples, aiding the model in identifying and disregarding noisy relational patterns. Extensive experiments show that ToC significantly outperforms state-of-the-art methods across three widely used datasets in multiple inductive settings https://github.com/AI-Chen/ToC_KGC.
科研通智能强力驱动
Strongly Powered by AbleSci AI