Query2Triple: Unified Query Encoding for Answering Diverse Complex Queries over Knowledge Graphs

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Xu, Yao, He, Shizhu, Wang, Cunguang, Cai, Li, Liu, Kang, Zhao, Jun
Format: Preprint
Publié: 2023
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866911179790614528
author Xu, Yao
He, Shizhu
Wang, Cunguang
Cai, Li
Liu, Kang
Zhao, Jun
author_facet Xu, Yao
He, Shizhu
Wang, Cunguang
Cai, Li
Liu, Kang
Zhao, Jun
contents Complex Query Answering (CQA) is a challenge task of Knowledge Graph (KG). Due to the incompleteness of KGs, query embedding (QE) methods have been proposed to encode queries and entities into the same embedding space, and treat logical operators as neural set operators to obtain answers. However, these methods train KG embeddings and neural set operators concurrently on both simple (one-hop) and complex (multi-hop and logical) queries, which causes performance degradation on simple queries and low training efficiency. In this paper, we propose Query to Triple (Q2T), a novel approach that decouples the training for simple and complex queries. Q2T divides the training into two stages: (1) Pre-training a neural link predictor on simple queries to predict tail entities based on the head entity and relation. (2) Training a query encoder on complex queries to encode diverse complex queries into a unified triple form that can be efficiently solved by the pretrained neural link predictor. Our proposed Q2T is not only efficient to train, but also modular, thus easily adaptable to various neural link predictors that have been studied well. Extensive experiments demonstrate that, even without explicit modeling for neural set operators, Q2T still achieves state-of-the-art performance on diverse complex queries over three public benchmarks.
format Preprint
id arxiv_https___arxiv_org_abs_2310_11246
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Query2Triple: Unified Query Encoding for Answering Diverse Complex Queries over Knowledge Graphs
Xu, Yao
He, Shizhu
Wang, Cunguang
Cai, Li
Liu, Kang
Zhao, Jun
Artificial Intelligence
Complex Query Answering (CQA) is a challenge task of Knowledge Graph (KG). Due to the incompleteness of KGs, query embedding (QE) methods have been proposed to encode queries and entities into the same embedding space, and treat logical operators as neural set operators to obtain answers. However, these methods train KG embeddings and neural set operators concurrently on both simple (one-hop) and complex (multi-hop and logical) queries, which causes performance degradation on simple queries and low training efficiency. In this paper, we propose Query to Triple (Q2T), a novel approach that decouples the training for simple and complex queries. Q2T divides the training into two stages: (1) Pre-training a neural link predictor on simple queries to predict tail entities based on the head entity and relation. (2) Training a query encoder on complex queries to encode diverse complex queries into a unified triple form that can be efficiently solved by the pretrained neural link predictor. Our proposed Q2T is not only efficient to train, but also modular, thus easily adaptable to various neural link predictors that have been studied well. Extensive experiments demonstrate that, even without explicit modeling for neural set operators, Q2T still achieves state-of-the-art performance on diverse complex queries over three public benchmarks.
title Query2Triple: Unified Query Encoding for Answering Diverse Complex Queries over Knowledge Graphs
topic Artificial Intelligence
url https://arxiv.org/abs/2310.11246