Modeling Long-distance Node Relations for KBQA with Global Dynamic Graph

12Citations
Citations of this article
69Readers
Mendeley users who have this article in their library.

Abstract

The structural information of Knowledge Bases (KBs) has proven effective to Question Answering (QA). Previous studies rely on deep graph neural networks (GNNs) to capture rich structural information, which may not model node relations in particularly long distance due to over-smoothing issue. To address this challenge, we propose a novel framework GlobalGraph, which models long-distance node relations from two views: 1) Node type similarity: GlobalGraph assigns each node a global type label and models long-distance node relations through the global type label similarity; 2) Correlation between nodes and questions: we learn similarity scores between nodes and the question, and model long-distance node relations through the sum score of two nodes. We conduct extensive experiments on two widely used multi-hop KBQA datasets to prove the effectiveness of our method.

Cite

CITATION STYLE

APA

Wang, X., Zhao, S., Han, J., Cheng, B., Yang, H., Ao, J., & Li, Z. (2020). Modeling Long-distance Node Relations for KBQA with Global Dynamic Graph. In COLING 2020 - 28th International Conference on Computational Linguistics, Proceedings of the Conference (pp. 2572–2582). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2020.coling-main.231

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free