%0 Conference Paper %1 jalota2021_lauren %A Jalota, Rricha %A Vollmers, Daniel %A Moussallem, Diego %A Ngomo, Axel-Cyrille Ngonga %B Proceedings of the 15th IEEE International Conference on Semantic Computing (ICSC 2021) %D 2021 %K daikiri dice jalota knowgraphs moussallem ngonga raki speaker vollmers %T LAUREN - Knowledge Graph Summarization for Question Answering %U https://papers.dice-research.org/2021/ICSC2021_LAUREN/LAUREN_public.pdf %X Besides the challenge that a human can ask one question in many different ways, a key aspect in Question Answering approaches over Knowledge Graphs (KGQA) is to deal with the vast amount of information present in the knowledge graphs. Modern real-world knowledge graphs contain nearly millions of entities and relationships. Additionally, they are enriched with new facts every day. However, not all facts are relevant for answering particular questions, thus fostering several challenges to KGQA systems, which require interpretable and query-able data. One solution to filtering the extra data in knowledge graphs is to rely on graph summarization techniques. Graph-based summarization approaches aim to resize knowledge graphs to be more concise and precise by storing only relevant information. In this paper, we propose a framework named LAUREN that applies different summarization techniques on knowledge graphs to be used in KGQA systems. Our experiments show that LAUREN summarizes large knowledge graphs such as DBpedia by 2 million entities and its summarization still achieves the same performance on both question answering and linking tasks compared to the complete DBpedia.

@inproceedings{jalota2021_lauren, abstract = {Besides the challenge that a human can ask one question in many different ways, a key aspect in Question Answering approaches over Knowledge Graphs (KGQA) is to deal with the vast amount of information present in the knowledge graphs. Modern real-world knowledge graphs contain nearly millions of entities and relationships. Additionally, they are enriched with new facts every day. However, not all facts are relevant for answering particular questions, thus fostering several challenges to KGQA systems, which require interpretable and query-able data. One solution to filtering the extra data in knowledge graphs is to rely on graph summarization techniques. Graph-based summarization approaches aim to resize knowledge graphs to be more concise and precise by storing only relevant information. In this paper, we propose a framework named LAUREN that applies different summarization techniques on knowledge graphs to be used in KGQA systems. Our experiments show that LAUREN summarizes large knowledge graphs such as DBpedia by 2 million entities and its summarization still achieves the same performance on both question answering and linking tasks compared to the complete DBpedia.}, added-at = {2025-04-23T13:52:54.000+0200}, author = {Jalota, Rricha and Vollmers, Daniel and Moussallem, Diego and Ngomo, Axel-Cyrille Ngonga}, bdsk-url-1 = {https://papers.dice-research.org/2021/ICSC2021_LAUREN/LAUREN_public.pdf}, biburl = {https://www.bibsonomy.org/bibtex/2965f1836502627b693fffea66735c90a/dice-research}, booktitle = {Proceedings of the 15th {IEEE} {International} {Conference} on {Semantic} {Computing} ({ICSC} 2021)}, interhash = {fd4bfa2caa318daa878d03c9744498aa}, intrahash = {965f1836502627b693fffea66735c90a}, keywords = {daikiri dice jalota knowgraphs moussallem ngonga raki speaker vollmers}, timestamp = {2025-04-23T13:52:54.000+0200}, title = {{LAUREN - Knowledge Graph Summarization for Question Answering}}, url = {https://papers.dice-research.org/2021/ICSC2021_LAUREN/LAUREN_public.pdf}, year = 2021 }