Building Knowledge Subgraphs in Question Answering over Knowledge Graphs

Sareh Aghaei*, Kevin Angele, Anna Fensel

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference paperAcademicpeer-review

1 Citation (Scopus)


Question answering over knowledge graphs targets to leverage facts in knowledge graphs to answer natural language questions. The presence of large number of facts, particularly in huge and well-known knowledge graphs such as DBpedia, makes it difficult to access the knowledge graph for each given question. This paper describes a generic solution based on Personal Page Rank for extracting a small subset from the knowledge graph as a knowledge subgraph which is likely to capture the answer of the question. Given a natural language question, relevant facts are determined by a bi-directed propagation process based on Personal Page Rank. Experiments are conducted over FreeBase, DBPedia and WikiMovie to demonstrate the effectiveness of the approach in terms of recall and size of the extracted knowledge subgraphs.

Original languageEnglish
Title of host publicationWeb Engineering - 22nd International Conference, ICWE 2022, Proceedings
EditorsTommaso Di Noia, In-Young Ko, Markus Schedl, Carmelo Ardito
Place of PublicationCham
Number of pages15
ISBN (Print)9783031099168
Publication statusPublished - 2022
Event22nd International Conference on Web Engineering, ICWE 2022 - Bari, Italy
Duration: 5 Jul 20228 Jul 2022

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13362 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference22nd International Conference on Web Engineering, ICWE 2022


  • Knowledge graphs
  • Knowledge subgraph
  • Personal Page Rank
  • Question answering systems


Dive into the research topics of 'Building Knowledge Subgraphs in Question Answering over Knowledge Graphs'. Together they form a unique fingerprint.

Cite this