Knowledge graphs(KGs)often suffer from incompleteness,which limits their performance in practice where a vast amount of entities may coexist.To aid,knowledge graph completion(KGC)has been proposed to infer the missing...Knowledge graphs(KGs)often suffer from incompleteness,which limits their performance in practice where a vast amount of entities may coexist.To aid,knowledge graph completion(KGC)has been proposed to infer the missing links between entities.Among them,reasoning over relation paths in incomplete KG is a popular research topic.However,there are still some issues remained to be solved,such as path noise,path sparsity of KG,the ambiguity of inferred relation and lack of explanability in path representation.To simultaneously address the aforementioned challenges,we propose a novel rule guided link prediction model with path noise avoidance and disambiguation of inferred relation,termed as RPND.Specifically,we utilize path selection strategy to filter noisy path and reduce the interference of path noise.To alleviate the path sparsity of KG,we leverage path overlapping feature of similar relations and combine them based on the semantic similarity.For the ambiguity of inferred relation,we draw the insight from language model like transformer by introducing position embedding to reflect the order of relation along the path when learning its representation.Meanwhile,we employ logic rules to compose paths in semantic level to enhance the explanability of path representation.Extensive experiments conducted on benchmark datasets demonstrate the superiority of our proposed RPND model compared to its SOTAs.展开更多
基金supported in part by the National Natural Science Foundation of China(Grant Nos.62120106008,62376085).
文摘Knowledge graphs(KGs)often suffer from incompleteness,which limits their performance in practice where a vast amount of entities may coexist.To aid,knowledge graph completion(KGC)has been proposed to infer the missing links between entities.Among them,reasoning over relation paths in incomplete KG is a popular research topic.However,there are still some issues remained to be solved,such as path noise,path sparsity of KG,the ambiguity of inferred relation and lack of explanability in path representation.To simultaneously address the aforementioned challenges,we propose a novel rule guided link prediction model with path noise avoidance and disambiguation of inferred relation,termed as RPND.Specifically,we utilize path selection strategy to filter noisy path and reduce the interference of path noise.To alleviate the path sparsity of KG,we leverage path overlapping feature of similar relations and combine them based on the semantic similarity.For the ambiguity of inferred relation,we draw the insight from language model like transformer by introducing position embedding to reflect the order of relation along the path when learning its representation.Meanwhile,we employ logic rules to compose paths in semantic level to enhance the explanability of path representation.Extensive experiments conducted on benchmark datasets demonstrate the superiority of our proposed RPND model compared to its SOTAs.
