ULYSSES: Automated FreqUentLY ASked QueStions for KnowlEdge GraphS

Author:

Vassiliou Giannis1,Trouli Georgia Eirini12ORCID,Troullinou Georgia2,Spyridakis Nikolaos1ORCID,Bitzarakis George1,Droumalia Fotini1,Karagiannakis Antonis1,Skouteli Georgia1,Oikonomou Nikolaos1,Deka Dimitra1,Makaronas Emmanouil1,Pronoitis Georgios1,Alexandris Konstantinos1,Kostopoulos Stamatios1ORCID,Kazantzakis Yiannis1,Vlassis Nikolaos1,Sfinarolaki Eleftheria1,Daskalakis Vardis1,Giannakos Iakovos1,Stamatoukou Argyro1,Papadakis Nikolaos1,Kondylakis Haridimos23ORCID

Affiliation:

1. Department of Electrical and Computer Engineering, Hellenic Mediterranean University (HMU), 71309 Heraklion, Greece

2. Institute of Computer Science, Foundation for Research and Technology-Hellas (FORTH), 70013 Heraklion, Greece

3. Computer Science Department, University of Crete, 70013 Heraklion, Greece

Abstract

The exponential growth of Knowledge Graphs necessitates effective and efficient methods for their exploration and understanding. Frequently Asked Questions (FAQ) is a service that typically presents a list of questions and answers related to a specific topic, and which is intended to help people understand that topic. Although FAQ has already shown its value on large websites and is widely used, to the best of our knowledge it has not yet been exploited for Knowledge Graphs. In this paper, we present ULYSSES, the first system for automatically constructing FAQ lists for large Knowledge Graphs. Our method consists of three key steps. First, we select the most frequent queries by exploiting the available query logs. Next, we answer the selected queries, using the original graph. Finally, we construct textual descriptions of both the queries and the corresponding answers, exploring state-of-the-art transformer models, i.e., ChatGPT 3.5 and Gemini 1.5 Pro. We evaluate the results of each model, using a human-constructed FAQ list, contributing a unique dataset to the domain and showing the benefits of our approach.

Publisher

MDPI AG

Reference34 articles.

1. Summarizing semantic graphs: A survey;Cebiric;VLDB J.,2019

2. Nascimento, M.A. (2006, January 16–20). Extracting and Searching Useful Information Available on Web FAQs. Proceedings of the XXI Simpósio Brasileiro de Banco de Dados, Florianópolis, SC, Brasil. Anais/Proceedings.

3. Trouli, G.E., Papadakis, N., and Kondylakis, H. (2024). Constructing Semantic Summaries Using Embeddings. Information, 15.

4. Vassiliou, G., Papadakis, N., and Kondylakis, H. (2023, January 6–10). iSummary: Demonstrating Workload-based, Personalized Summaries for Knowledge Graphs. Proceedings of the ISWC 2023 Posters and Demos: 22nd International Semantic Web Conference, Athens, Greece. Available online: https://ceur-ws.org/Vol-3632/ISWC2023_paper_435.pdf.

5. Exploring RDFS KBs Using Summaries;Vrandecic;Proceedings of the Semantic Web—ISWC 2018—17th International Semantic Web Conference,2018

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3