Knowledge graph question answering (KGQA) based on information retrieval aims
to answer a question by retrieving answer from a large-scale knowledge graph.
Most existing methods first roughly retrieve the knowledge subgraphs (KSG) that
may contain candidate answer, and then search for the exact answer in the KSG.
However, the KSG may contain thousands of candidate nodes since the knowledge
graph involved in querying is often of large scale, thus decreasing the
performance of answer selection. To tackle this problem, we first propose to
partition the retrieved KSG to several smaller sub-KSGs via a new subgraph
partition algorithm and then present a graph-augmented learning to rank model
to select the top-ranked sub-KSGs from them. Our proposed model combines a
novel subgraph matching networks to capture global interactions in both
question and subgraphs, and an Enhanced Bilateral Multi-Perspective Matching
model is proposed to capture local interactions. Finally, we apply an answer
selection model on the full KSG and the top-ranked sub-KSGs respectively to
validate the effectiveness of our proposed graph-augmented learning to rank
method. The experimental results on multiple benchmark datasets have
demonstrated the effectiveness of our approach.

提出了一种基于子图分区的图增强学习排序模型，该模型整合了子图匹配网络和增强双边多角度匹配模型，用于知识图谱问答中的答案选择。在多个基准数据集上的实验结果表明，该方法具有很好的效果。