[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content

Advertisement

Springer Nature Link
Log in

Improving question answering over incomplete knowledge graphs with relation prediction

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

Large-scale knowledge graphs (KGs) play a critical role in question answering over KGs (KGs-QA). Despite of large scale, KGs suffer from incompleteness, which has fueled a lot of research on relation prediction. Since existing researches of relation prediction process each triple independently, the hidden relations which are inherently present can not be captured. Complementarily, to simultaneously capture both entity features and relation features in a given entity’s neighborhood, an entity importance estimation network of attention-based graph embedding is proposed, which consists of the attention-based graph embedding module and the entity importance estimation module. Firstly, the new embedding of an entity from its n-hop neighbor is learned by an attention-based graph embedding module. Then, the learned new embedding is integrated into the entity importance estimation module to find entities of high importance in n-hop neighbors of the central entity. Finally, multi-hop relations are encapsulated and an auxiliary edge of n-hop neighbors is introduced, which realizes the relation prediction task. To the best our knowledge, we are the first to realize KGs-QA while realizing relation prediction, which alleviates the phenomenon of missing relations and the low-precision problem of KGs-QA. On the SQ datasets, the proposed method obtains a high F1 score (49.3%) in 10% missing relation, compared to QASE and MCCNNs with F1 scores of 44.2% and 46.3%, respectively.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Esposito M, Damiano E, Minutolo A et al (2020) Hybrid query expansion using lexical resources and word embeddings for sentence retrieval in question answering. Inf Sci 514:88–105

    Article  Google Scholar 

  2. Guo T, Zhou R, Tian C (2020) On the information leakage in private information retrieval systems. IEEE Trans Inf Forensics Secur 15:2999–3012

    Article  Google Scholar 

  3. Trovati M, Zhang H, Ray J et al (2019) An entropy-based approach to real-time information extraction for industry 4.0. IEEE Trans Ind Inform 16(9):6033–6041

    Article  Google Scholar 

  4. Gupta D, Ekbal A, Bhattacharyya P (2019) A deep neural network framework for English Hindi question answering. ACM Trans Asian and Low-Resour Lang Inf Process (TALLIP) 19(2):1–22

    Google Scholar 

  5. Yasunaga M, Ren H, Bosselut A et al (2021) QA-GNN: Reasoning with language models and knowledge graphs for question answering. arXiv preprint arXiv:2104.06378

  6. Vu T, Nguyen TD, Nguyen DQ et al (2019) A capsule network-based embedding model for knowledge graph completion and search personalization. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers). pp 2180–2189

  7. Nathani D, Chauhan J, Sharma C et al (2019) Learning attention-based embeddings for relation prediction in knowledge graphs. arXiv preprint arXiv:1906.01195

  8. Shang Z, Liu Y, Li G et al (2016) K-join: Knowledge-aware similarity join. IEEE Trans Knowl Data Eng 28(12):3293–3308

    Article  Google Scholar 

  9. Zheng W, Cheng H, Yu JX et al (2019) Interactive natural language question answering over knowledge graphs. Inf Sci 481:141–159

    Article  MathSciNet  Google Scholar 

  10. Hu S, Zou L, Yu JX et al (2017) Answering natural language questions by subgraph matching over knowledge graphs. IEEE Trans Knowledge Data Eng 30(5):824–837

    Article  Google Scholar 

  11. Y Lan, Jiang J (2020) Query graph generation for answering multi-hop complex questions from knowledge bases. In: Proceedings of the 58th annual meeting of the association for computational linguistics

  12. Srivastava S, Patidar M, Chowdhury S et al (2021) Complex Question Answering on knowledge graphs using machine translation and multi-task learning. In: Proceedings of the 16th conference of the European chapter of the association for computational linguistics: Main Volume. pp 3428–3439

  13. Guo D, Tang D, Duan N et al (2018) Dialog-to-action: Conversational question answering over a large-scale knowledge base. In: Advances in Neural Information Processing Systems. pp 2942–2951

  14. Chen L, Berant J, Le Q et al (2017) Neural Symbolic Machines: Learning Semantic Parsers on Freebase with Weak Supervision. In: Proceedings of the 55th annual meeting of the association for computational linguistics, ACL, 2017

  15. Cen Y, Zhang J, Wang G et al (2019) Trust relationship prediction in alibaba E-commerce platform. IEEE Trans Knowl Data Eng 32(5):1024–1035

    Article  Google Scholar 

  16. Malaviya C, Bhagavatula C, Bosselut A et al (2020) Commonsense knowledge base completion with structural and semantic context. In: Proceedings of the AAAI conference on artificial intelligence. vol 34(03), pp 2925–2933

  17. Lacroix T, Obozinski G, Usunier N (2020) Tensor decompositions for temporal knowledge base completion[J]. arXiv preprint arXiv:2004.04926

  18. Lei K, Zhang J, Xie Y et al (2020) Path-based reasoning with constrained type attention for knowledge graph completion. Neural Comput Appl 32(11):6957–6966

    Article  Google Scholar 

  19. Sajadmanesh S, Bazargani S, Zhang J et al (2019) Continuous-time relationship prediction in dynamic heterogeneous information networks. ACM Trans Knowle Discov Data (TKDD) 13(4):1–31

    Article  Google Scholar 

  20. Saxena A, Tripathi A, Talukdar P (2020) Improving multi-hop question answering over knowledge graphs using knowledge base embeddings. In: Proceedings of the 58th annual meeting of the association for computational linguistics. pp 4498–4507

  21. Mazumder S, Liu B (2017) Context-aware path ranking for knowledge base completion. arXiv preprint arXiv:1712.07745

  22. Nguyen DQ, Nguyen TD, Nguyen DQ et al (2017) A novel embedding model for knowledge base completion based on convolutional neural network. arXiv preprint arXiv:1712.02121

  23. Bordes A, Chopra S, Weston J (2014) Question answering with subgraph embeddings. arXiv preprint arXiv:1406.3676

  24. Dong L, Wei F, Zhou M et al (2015) Question answering over freebase with multi-column convolutional neural networks. In: Proceedings of the 53rd annual meeting of the association for computational linguistics and the 7th international joint conference on natural language processing (Volume 1: Long Papers). pp 260–269

  25. Bast H, Haussmann E (2015) More accurate question answering on freebase. In: Proceedings of the 24th ACM international on conference on information and knowledge management. pp 1431–1440

  26. Qiu Y, Zhang K, Wang Y et al (2020) Hierarchical query graph generation for complex question answering over knowledge graph. In: Proceedings of the 29th ACM international conference on information and knowledge management. 1285-1294

  27. Sun H, Bedrax-Weiss T, Cohen WW (2019) Pullnet: Open domain question answering with iterative retrieval on knowledge bases and text. arXiv preprint arXiv:1904.09537

  28. Xiong W, Yu M, Chang S, Guo X, Wang WY (2019) Improving question answering over incomplete kbs with knowledge-aware reader. In: Annual Meeting of the Association for Computational Linguistics (ACL)

  29. Liu H, Hu K, Wang FL et al (2021) Correction to: Aggregating neighborhood information for negative sampling for knowledge graph embedding. Neural Comput Appl 33:1399–1399

    Article  Google Scholar 

  30. Dettmers T, Minervini P, Stenetorp P et al (2018) Convolutional 2d knowledge graph embedding. In: Thirty-second AAAI conference on artificial intelligence

  31. Vashishth S, Sanyal S, Nitin V et al (2020) Interacte: Improving convolution-based knowledge graph embeddings by increasing feature interactions. In: Proceedings of the AAAI conference on artificial intelligence. vol 34(03), pp 3009–3016

  32. Ghorbani M, Baghshah MS, Rabiee HR (2019) MGCN: Semi-supervised classification in multi-layer graphs with graph convolutional networks. In: Proceedings of the IEEE/ACM international conference on advances in social networks analysis and mining. pp 208–211

  33. Song Y, Wang H, Wang Z et al (2011) Short text conceptualization using a probabilistic knowledgebase. In: Twenty-second international joint conference on artificial intelligence

  34. Park N, Kan A, Dong XL et al (2019) Estimating node importance in knowledge graphs using graph neural networks. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery and data mining. pp 596–606

  35. Cui W, Xiao Y, Wang H et al (2019) KBQA: learning question answering over QA corpora and knowledge bases. arXiv preprint arXiv:1903.02419

  36. Su Y, Sun H, Sadler B et al (2016) On generating characteristic-rich question sets for qa evaluation. In: Proceedings of the conference on empirical methods in natural language processing. pp 562–572

  37. Cabaleiro B, Peñas A, Manandhar S (2017) Grounding proposition stores for question answering over linked data. Knowl Based Syst 128:34–42

    Article  Google Scholar 

  38. Yang B, Yih W, He X et al (2014) Embedding entities and relations for learning and inference in knowledge bases. arXiv preprint arXiv:1412.6575

  39. Trouillon T, Welbl J, Riedel S, et al (2016) Complex embeddings for simple link prediction. In: International conference on machine learning. PMLR, pp 2071–2080

  40. Zheng W, Zou L, Lian X et al (2015) How to build templates for RDF question/answering: An uncertain graph similarity join approach. In: Proceedings of the ACM SIGMOD international conference on management of data. pp 1809–1824

  41. Abujabal A, Yahya M, Riedewald M et al (2017) Automated template generation for question answering over knowledge graphs. In: Proceedings of the 26th international conference on world wide web. pp 1191–1200

Download references

Acknowledgements

This work is supported by Chongqing Postgraduate Research and Innovation Project under Grant CYB20175;National Natural Science Foundation of China under Grants 61903057; Science and Technology Reasearch Program of Chongqing Municipal Education Commission Grants KJQN202000602; the Chongqing Natural Science Foundation under Grant cstc2019jcyj-msxmX0129; the Artificial Intelligence Technology Innovation Significant Theme Special Project of Chongqing Science and Technology Commission cstc2019jscx-zdztzxX0027.

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing, 400065, China

    Fen Zhao, Yinguo Li & Ling Bai

  2. School of Automation, Chongqing University of Posts and Telecommunications, Chongqing, 400065, China

    Yinguo Li & Jie Hou

  3. Department of Electrical and Computer Engineering, McMaster University, Hamilton, L8S 4L8, Canada

    Ling Bai

Authors
  1. Fen Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yinguo Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jie Hou
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ling Bai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fen Zhao.

Ethics declarations

Conflict of interest

There are no potential competing interests in our paper. And all authors have seen the manuscript and approved to submit to your journal. We confirm that the content of the manuscript has not been published or submitted for publication elsewhere.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhao, F., Li, Y., Hou, J. et al. Improving question answering over incomplete knowledge graphs with relation prediction. Neural Comput & Applic 34, 6331–6348 (2022). https://doi.org/10.1007/s00521-021-06736-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-021-06736-7

Keywords

Search

Navigation