DualRep: Knowledge Graph Completion by Utilizing Dual Representation of Relational Paths and Tail Node Density Insights
Main Author: | |
---|---|
Publication Date: | 2024 |
Other Authors: | , , , |
Format: | Article |
Language: | eng |
Source: | Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
Download full: | https://hdl.handle.net/11328/6037 |
Summary: | Knowledge graphs (KGs) possess a vital role in enhancing the semantic comprehension of extensive datasets across many fields. It facilitate activities like recommendation systems, semantic searching, and intelligent data mining. However, lacking information can sometimes limit the usefulness of knowledge graphs (KGs), as the lack of relationships between entities could severely limit their practical application. Most existing approaches for KG completion primarily concentrate on embedding-based methods or just use relational paths, neglecting the valuable structural information offered by node density. This research presents an approach that effectively combines relational paths and the density features of tail nodes to enhance the accuracy of predicting relationships that are missing in knowledge graphs. Our method combines the sequential relational context represented by paths with the structural prominence indicated by node density, allowing for a dual view on possible entity connections. We validate the effectiveness of our technique by conducting comprehensive tests on many benchmark datasets, revealing substantial enhancements compared to conventional approaches. The Dual-Rep model, which incorporates relational paths and node density features, has continuously shown improved performance across several metrics, such as Mean Reciprocal Rank (MRR), Hit at 1 (Hit@1), and Hit at 3 (Hit@3). The DualRep model achieved a mean reciprocal rank (MRR) of 90.80. Additionally, it achieved a hit rate of 87.39 at rank 1 (Hit@1) and a hit rate of 91.18. |
id |
RCAP_c7fc3c6c0add3fab8c089993c61033b6 |
---|---|
oai_identifier_str |
oai:repositorio.upt.pt:11328/6037 |
network_acronym_str |
RCAP |
network_name_str |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
repository_id_str |
https://opendoar.ac.uk/repository/7160 |
spelling |
DualRep: Knowledge Graph Completion by Utilizing Dual Representation of Relational Paths and Tail Node Density InsightsKnowledge graph completionrelational pathsnode density analysisgraph structural featuresentity relationship predictiongraph neural networksmachine learning in knowledge graphsentity embeddingsrelational and structural dynamicsCiências Naturais - Ciências da Computação e da InformaçãoKnowledge graphs (KGs) possess a vital role in enhancing the semantic comprehension of extensive datasets across many fields. It facilitate activities like recommendation systems, semantic searching, and intelligent data mining. However, lacking information can sometimes limit the usefulness of knowledge graphs (KGs), as the lack of relationships between entities could severely limit their practical application. Most existing approaches for KG completion primarily concentrate on embedding-based methods or just use relational paths, neglecting the valuable structural information offered by node density. This research presents an approach that effectively combines relational paths and the density features of tail nodes to enhance the accuracy of predicting relationships that are missing in knowledge graphs. Our method combines the sequential relational context represented by paths with the structural prominence indicated by node density, allowing for a dual view on possible entity connections. We validate the effectiveness of our technique by conducting comprehensive tests on many benchmark datasets, revealing substantial enhancements compared to conventional approaches. The Dual-Rep model, which incorporates relational paths and node density features, has continuously shown improved performance across several metrics, such as Mean Reciprocal Rank (MRR), Hit at 1 (Hit@1), and Hit at 3 (Hit@3). The DualRep model achieved a mean reciprocal rank (MRR) of 90.80. Additionally, it achieved a hit rate of 87.39 at rank 1 (Hit@1) and a hit rate of 91.18.IEEE2024-12-19T15:56:26Z2024-12-192024-11-18T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfGul, H., Al-Obeidat, F., Amin, A., Wasim, M., & Moreira, F. (2024). DualRep: Knowledge Graph Completion by Utilizing Dual Representation of Relational Paths and Tail Node Density Insights. IEEE Access, 12, 179566-179578. https://doi.org/10.1109/ACCESS.2024.3501735.. Repositório Institucional UPT. https://hdl.handle.net/11328/6037https://hdl.handle.net/11328/6037Gul, H., Al-Obeidat, F., Amin, A., Wasim, M., & Moreira, F. (2024). DualRep: Knowledge Graph Completion by Utilizing Dual Representation of Relational Paths and Tail Node Density Insights. IEEE Access, 12, 179566-179578. https://doi.org/10.1109/ACCESS.2024.3501735.. Repositório Institucional UPT. https://hdl.handle.net/11328/6037https://hdl.handle.net/11328/6037eng2169-3536https://doi.org/10.1109/ACCESS.2024.3501735http://creativecommons.org/licenses/by/4.0/info:eu-repo/semantics/openAccessGul, HajiAl-Obeidat, FerasAmin, AdnanWasim, MuhammadMoreira, Fernandoreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2025-04-24T02:03:16Zoai:repositorio.upt.pt:11328/6037Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-28T19:27:50.387879Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse |
dc.title.none.fl_str_mv |
DualRep: Knowledge Graph Completion by Utilizing Dual Representation of Relational Paths and Tail Node Density Insights |
title |
DualRep: Knowledge Graph Completion by Utilizing Dual Representation of Relational Paths and Tail Node Density Insights |
spellingShingle |
DualRep: Knowledge Graph Completion by Utilizing Dual Representation of Relational Paths and Tail Node Density Insights Gul, Haji Knowledge graph completion relational paths node density analysis graph structural features entity relationship prediction graph neural networks machine learning in knowledge graphs entity embeddings relational and structural dynamics Ciências Naturais - Ciências da Computação e da Informação |
title_short |
DualRep: Knowledge Graph Completion by Utilizing Dual Representation of Relational Paths and Tail Node Density Insights |
title_full |
DualRep: Knowledge Graph Completion by Utilizing Dual Representation of Relational Paths and Tail Node Density Insights |
title_fullStr |
DualRep: Knowledge Graph Completion by Utilizing Dual Representation of Relational Paths and Tail Node Density Insights |
title_full_unstemmed |
DualRep: Knowledge Graph Completion by Utilizing Dual Representation of Relational Paths and Tail Node Density Insights |
title_sort |
DualRep: Knowledge Graph Completion by Utilizing Dual Representation of Relational Paths and Tail Node Density Insights |
author |
Gul, Haji |
author_facet |
Gul, Haji Al-Obeidat, Feras Amin, Adnan Wasim, Muhammad Moreira, Fernando |
author_role |
author |
author2 |
Al-Obeidat, Feras Amin, Adnan Wasim, Muhammad Moreira, Fernando |
author2_role |
author author author author |
dc.contributor.author.fl_str_mv |
Gul, Haji Al-Obeidat, Feras Amin, Adnan Wasim, Muhammad Moreira, Fernando |
dc.subject.por.fl_str_mv |
Knowledge graph completion relational paths node density analysis graph structural features entity relationship prediction graph neural networks machine learning in knowledge graphs entity embeddings relational and structural dynamics Ciências Naturais - Ciências da Computação e da Informação |
topic |
Knowledge graph completion relational paths node density analysis graph structural features entity relationship prediction graph neural networks machine learning in knowledge graphs entity embeddings relational and structural dynamics Ciências Naturais - Ciências da Computação e da Informação |
description |
Knowledge graphs (KGs) possess a vital role in enhancing the semantic comprehension of extensive datasets across many fields. It facilitate activities like recommendation systems, semantic searching, and intelligent data mining. However, lacking information can sometimes limit the usefulness of knowledge graphs (KGs), as the lack of relationships between entities could severely limit their practical application. Most existing approaches for KG completion primarily concentrate on embedding-based methods or just use relational paths, neglecting the valuable structural information offered by node density. This research presents an approach that effectively combines relational paths and the density features of tail nodes to enhance the accuracy of predicting relationships that are missing in knowledge graphs. Our method combines the sequential relational context represented by paths with the structural prominence indicated by node density, allowing for a dual view on possible entity connections. We validate the effectiveness of our technique by conducting comprehensive tests on many benchmark datasets, revealing substantial enhancements compared to conventional approaches. The Dual-Rep model, which incorporates relational paths and node density features, has continuously shown improved performance across several metrics, such as Mean Reciprocal Rank (MRR), Hit at 1 (Hit@1), and Hit at 3 (Hit@3). The DualRep model achieved a mean reciprocal rank (MRR) of 90.80. Additionally, it achieved a hit rate of 87.39 at rank 1 (Hit@1) and a hit rate of 91.18. |
publishDate |
2024 |
dc.date.none.fl_str_mv |
2024-12-19T15:56:26Z 2024-12-19 2024-11-18T00:00:00Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
Gul, H., Al-Obeidat, F., Amin, A., Wasim, M., & Moreira, F. (2024). DualRep: Knowledge Graph Completion by Utilizing Dual Representation of Relational Paths and Tail Node Density Insights. IEEE Access, 12, 179566-179578. https://doi.org/10.1109/ACCESS.2024.3501735.. Repositório Institucional UPT. https://hdl.handle.net/11328/6037 https://hdl.handle.net/11328/6037 Gul, H., Al-Obeidat, F., Amin, A., Wasim, M., & Moreira, F. (2024). DualRep: Knowledge Graph Completion by Utilizing Dual Representation of Relational Paths and Tail Node Density Insights. IEEE Access, 12, 179566-179578. https://doi.org/10.1109/ACCESS.2024.3501735.. Repositório Institucional UPT. https://hdl.handle.net/11328/6037 https://hdl.handle.net/11328/6037 |
identifier_str_mv |
Gul, H., Al-Obeidat, F., Amin, A., Wasim, M., & Moreira, F. (2024). DualRep: Knowledge Graph Completion by Utilizing Dual Representation of Relational Paths and Tail Node Density Insights. IEEE Access, 12, 179566-179578. https://doi.org/10.1109/ACCESS.2024.3501735.. Repositório Institucional UPT. https://hdl.handle.net/11328/6037 |
url |
https://hdl.handle.net/11328/6037 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
2169-3536 https://doi.org/10.1109/ACCESS.2024.3501735 |
dc.rights.driver.fl_str_mv |
http://creativecommons.org/licenses/by/4.0/ info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by/4.0/ |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
IEEE |
publisher.none.fl_str_mv |
IEEE |
dc.source.none.fl_str_mv |
reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia instacron:RCAAP |
instname_str |
FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
collection |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
repository.name.fl_str_mv |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia |
repository.mail.fl_str_mv |
info@rcaap.pt |
_version_ |
1833598114537144320 |