Enhancing link prediction efficiency with shortest path and structural attributes
Main Author: | |
---|---|
Publication Date: | 2023 |
Other Authors: | , , , |
Format: | Article |
Language: | eng |
Source: | Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
Download full: | http://hdl.handle.net/11328/4885 https://doi.org/10.3233/IDA-230030 |
Summary: | Link prediction is one of the most essential and crucial tasks in complex network research since it seeks to forecast missing links in a network based on current ones. This problem has applications in a variety of scientific disciplines, including social network research, recommendation systems, and biological networks. In previous work, link prediction has been solved through different methods such as path, social theory, topology, and similarity-based. The main issue is that path-based methods ignore topological features, while structure-based methods also fail to combine the path and structured-based features. As a result, a new technique based on the shortest path and topological features’ has been developed. The method uses both local and global similarity indices to measure the similarity. Extensive experiments on real-world datasets from a variety of domains are utilized to empirically test and compare the proposed framework to many state-of-the-art prediction techniques. Over 100 iterations, the collected data showed that the proposed method improved on the other methods in terms of accuracy. SI and AA, among the existing state-of-the-art algorithms, fared best with an AUC value of 82%, while the proposed method has an AUC value of 84%. |
id |
RCAP_da37042adb8a5ea07762d4aca85dcd11 |
---|---|
oai_identifier_str |
oai:repositorio.upt.pt:11328/4885 |
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 |
Enhancing link prediction efficiency with shortest path and structural attributesLink predictionComplex networksGlobal featuresLocal featuresLink prediction is one of the most essential and crucial tasks in complex network research since it seeks to forecast missing links in a network based on current ones. This problem has applications in a variety of scientific disciplines, including social network research, recommendation systems, and biological networks. In previous work, link prediction has been solved through different methods such as path, social theory, topology, and similarity-based. The main issue is that path-based methods ignore topological features, while structure-based methods also fail to combine the path and structured-based features. As a result, a new technique based on the shortest path and topological features’ has been developed. The method uses both local and global similarity indices to measure the similarity. Extensive experiments on real-world datasets from a variety of domains are utilized to empirically test and compare the proposed framework to many state-of-the-art prediction techniques. Over 100 iterations, the collected data showed that the proposed method improved on the other methods in terms of accuracy. SI and AA, among the existing state-of-the-art algorithms, fared best with an AUC value of 82%, while the proposed method has an AUC value of 84%.IOS Press2023-07-05T10:40:36Z2023-07-052023-06-29T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfWasim, M., Al-Obeidat, F., Amin, A., Gul, H., & Moreira, F. (2023). Enhancing link prediction efficiency with shortest path and structural attributes. Intelligent Data Analysis, (Published online: 29 june 2023), 1-17. https://doi.org/10.3233/IDA-230030. Repositório Institucional UPT. http://hdl.handle.net/11328/4885http://hdl.handle.net/11328/4885Wasim, M., Al-Obeidat, F., Amin, A., Gul, H., & Moreira, F. (2023). Enhancing link prediction efficiency with shortest path and structural attributes. Intelligent Data Analysis, (Published online: 29 june 2023), 1-17. https://doi.org/10.3233/IDA-230030. Repositório Institucional UPT. http://hdl.handle.net/11328/4885http://hdl.handle.net/11328/4885https://doi.org/10.3233/IDA-230030eng1571-4128https://content.iospress.com/articles/intelligent-data-analysis/ida230030info:eu-repo/semantics/restrictedAccessinfo:eu-repo/semantics/openAccessWasim, MuhammadAl-Obeidat, FerasAmin, AdnanGul, HajiMoreira, 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:05:09Zoai:repositorio.upt.pt:11328/4885Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-28T19:32:06.438122Repositó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 |
Enhancing link prediction efficiency with shortest path and structural attributes |
title |
Enhancing link prediction efficiency with shortest path and structural attributes |
spellingShingle |
Enhancing link prediction efficiency with shortest path and structural attributes Wasim, Muhammad Link prediction Complex networks Global features Local features |
title_short |
Enhancing link prediction efficiency with shortest path and structural attributes |
title_full |
Enhancing link prediction efficiency with shortest path and structural attributes |
title_fullStr |
Enhancing link prediction efficiency with shortest path and structural attributes |
title_full_unstemmed |
Enhancing link prediction efficiency with shortest path and structural attributes |
title_sort |
Enhancing link prediction efficiency with shortest path and structural attributes |
author |
Wasim, Muhammad |
author_facet |
Wasim, Muhammad Al-Obeidat, Feras Amin, Adnan Gul, Haji Moreira, Fernando |
author_role |
author |
author2 |
Al-Obeidat, Feras Amin, Adnan Gul, Haji Moreira, Fernando |
author2_role |
author author author author |
dc.contributor.author.fl_str_mv |
Wasim, Muhammad Al-Obeidat, Feras Amin, Adnan Gul, Haji Moreira, Fernando |
dc.subject.por.fl_str_mv |
Link prediction Complex networks Global features Local features |
topic |
Link prediction Complex networks Global features Local features |
description |
Link prediction is one of the most essential and crucial tasks in complex network research since it seeks to forecast missing links in a network based on current ones. This problem has applications in a variety of scientific disciplines, including social network research, recommendation systems, and biological networks. In previous work, link prediction has been solved through different methods such as path, social theory, topology, and similarity-based. The main issue is that path-based methods ignore topological features, while structure-based methods also fail to combine the path and structured-based features. As a result, a new technique based on the shortest path and topological features’ has been developed. The method uses both local and global similarity indices to measure the similarity. Extensive experiments on real-world datasets from a variety of domains are utilized to empirically test and compare the proposed framework to many state-of-the-art prediction techniques. Over 100 iterations, the collected data showed that the proposed method improved on the other methods in terms of accuracy. SI and AA, among the existing state-of-the-art algorithms, fared best with an AUC value of 82%, while the proposed method has an AUC value of 84%. |
publishDate |
2023 |
dc.date.none.fl_str_mv |
2023-07-05T10:40:36Z 2023-07-05 2023-06-29T00: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 |
Wasim, M., Al-Obeidat, F., Amin, A., Gul, H., & Moreira, F. (2023). Enhancing link prediction efficiency with shortest path and structural attributes. Intelligent Data Analysis, (Published online: 29 june 2023), 1-17. https://doi.org/10.3233/IDA-230030. Repositório Institucional UPT. http://hdl.handle.net/11328/4885 http://hdl.handle.net/11328/4885 Wasim, M., Al-Obeidat, F., Amin, A., Gul, H., & Moreira, F. (2023). Enhancing link prediction efficiency with shortest path and structural attributes. Intelligent Data Analysis, (Published online: 29 june 2023), 1-17. https://doi.org/10.3233/IDA-230030. Repositório Institucional UPT. http://hdl.handle.net/11328/4885 http://hdl.handle.net/11328/4885 https://doi.org/10.3233/IDA-230030 |
identifier_str_mv |
Wasim, M., Al-Obeidat, F., Amin, A., Gul, H., & Moreira, F. (2023). Enhancing link prediction efficiency with shortest path and structural attributes. Intelligent Data Analysis, (Published online: 29 june 2023), 1-17. https://doi.org/10.3233/IDA-230030. Repositório Institucional UPT. http://hdl.handle.net/11328/4885 |
url |
http://hdl.handle.net/11328/4885 https://doi.org/10.3233/IDA-230030 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
1571-4128 https://content.iospress.com/articles/intelligent-data-analysis/ida230030 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/restrictedAccess info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
restrictedAccess openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
IOS Press |
publisher.none.fl_str_mv |
IOS Press |
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_ |
1833598159165587456 |