Construction of Hyper-Relational Knowledge Graphs Using Pre-Trained Large Language Models

dc.contributorAalto-yliopistofi
dc.contributorAalto Universityen
dc.contributor.advisorVitiugin, Fedor
dc.contributor.authorDatta, Preetha
dc.contributor.schoolPerustieteiden korkeakoulufi
dc.contributor.schoolSchool of Scienceen
dc.contributor.supervisorSawhney, Nitin
dc.date.accessioned2024-11-20T22:43:16Z
dc.date.available2024-11-20T22:43:16Z
dc.date.issued2024-09-12
dc.description.abstractHyper-relational knowledge graphs serve as a technique to organize previously unstructured data. Question-answering systems built on these graphs excel at handling multi-hop questions and offer clear, transparent answers. However, developing a question-answering system centered around knowledge graphs can pose significant challenges and demands considerable effort. This thesis endeavors to streamline the process by leveraging large language models to generate hyper-relational knowledge graphs since it implies cheaper knowledge graph construction methodologies in the future. This thesis tests a range of prompting strategies across a subset of large language models to thoroughly evaluate their effectiveness in extracting entities and relations. These entities and relations are essential building blocks for constructing a knowledge graph. By applying different prompting techniques, the research aims to determine the most efficient and accurate methods for entity and relation extraction. This evaluation provides insights into the capabilities and limitations of large language models in the context of knowledge graph development. We also perform a comparison of the prompting techniques with some existing supervised methodologies. The evaluation metric utilized in this thesis is BERTScore. Additionally, the thesis provides a comprehensive discussion on the advantages and disadvantages of BERTScore, as well as other evaluation metrics. This analysis aims to highlight the strengths and limitations of each metric, offering a balanced perspective on their applicability and effectiveness in assessing the outcomes of entity and relation extraction. The highest results achieved in this thesis are attributed to large language model based prompting that incorporates the relation descriptions of the dataset.en
dc.format.extent71
dc.format.mimetypeapplication/pdfen
dc.identifier.urihttps://aaltodoc.aalto.fi/handle/123456789/131840
dc.identifier.urnURN:NBN:fi:aalto-202411217352
dc.language.isoenen
dc.programmeMaster's Programme in Computer, Communication and Information Sciencesen
dc.programme.majorMachine Learning, Data Science and Artificial Intelligenceen
dc.subject.keywordlarge language modelsen
dc.subject.keywordknowledge graphsen
dc.subject.keywordBERTScoreen
dc.subject.keywordinformation retrievalen
dc.subject.keywordHyperREDen
dc.subject.keywordhyper-relational knowledge graph constructionen
dc.titleConstruction of Hyper-Relational Knowledge Graphs Using Pre-Trained Large Language Modelsen
dc.typeG2 Pro gradu, diplomityöfi
dc.type.ontasotMaster's thesisen
dc.type.ontasotDiplomityöfi
local.aalto.electroniconlyyes
local.aalto.openaccessyes

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
master_Datta_Preetha_2024.pdf
Size:
2.19 MB
Format:
Adobe Portable Document Format