Identifying accurate link predictors based on assortativity of complex networks

Abstract Link prediction algorithms in complex networks, such as social networks, biological networks, drug-drug interactions, communication networks, and so on, assign scores to predict potential links between two nodes. Link prediction (LP) enables researchers to learn unknown, new as well as futu...

Full description

Bibliographic Details
Main Authors: Ahmad F. Al Musawi, Satyaki Roy, Preetam Ghosh
Format: Article
Language:English
Published: Nature Portfolio 2022-10-01
Series:Scientific Reports
Online Access:https://doi.org/10.1038/s41598-022-22843-4
_version_ 1797991625041903616
author Ahmad F. Al Musawi
Satyaki Roy
Preetam Ghosh
author_facet Ahmad F. Al Musawi
Satyaki Roy
Preetam Ghosh
author_sort Ahmad F. Al Musawi
collection DOAJ
description Abstract Link prediction algorithms in complex networks, such as social networks, biological networks, drug-drug interactions, communication networks, and so on, assign scores to predict potential links between two nodes. Link prediction (LP) enables researchers to learn unknown, new as well as future interactions among the entities being modeled in the complex networks. In addition to measures like degree distribution, clustering coefficient, centrality, etc., another metric to characterize structural properties is network assortativity which measures the tendency of nodes to connect with similar nodes. In this paper, we explore metrics that effectively predict the links based on the assortativity profiles of the complex networks. To this end, we first propose an approach that generates networks of varying assortativity levels and utilize three sets of link prediction models combining the similarity of neighborhoods and preferential attachment. We carry out experiments to study the LP accuracy (measured in terms of area under the precision-recall curve) of the link predictors individually and in combination with other baseline measures. Our analysis shows that link prediction models that explore a large neighborhood around nodes of interest, such as CH2-L2 and CH2-L3, perform consistently for assortative as well as disassortative networks. While common neighbor-based local measures are effective for assortative networks, our proposed combination of common neighbors with node degree is a good choice for the LP metric in disassortative networks. We discuss how this analysis helps achieve the best-parameterized combination of link prediction models and its significance in the context of link prediction from incomplete social and biological network data.
first_indexed 2024-04-11T08:53:51Z
format Article
id doaj.art-5ce3437d514746a7af8ca514d4523173
institution Directory Open Access Journal
issn 2045-2322
language English
last_indexed 2024-04-11T08:53:51Z
publishDate 2022-10-01
publisher Nature Portfolio
record_format Article
series Scientific Reports
spelling doaj.art-5ce3437d514746a7af8ca514d45231732022-12-22T04:33:20ZengNature PortfolioScientific Reports2045-23222022-10-0112111610.1038/s41598-022-22843-4Identifying accurate link predictors based on assortativity of complex networksAhmad F. Al Musawi0Satyaki Roy1Preetam Ghosh2Department of Information Technology, University of Thi QarDepartment of Genetics, University of North CarolinaDepartment of Computer Science, Virginia Commonwealth UniversityAbstract Link prediction algorithms in complex networks, such as social networks, biological networks, drug-drug interactions, communication networks, and so on, assign scores to predict potential links between two nodes. Link prediction (LP) enables researchers to learn unknown, new as well as future interactions among the entities being modeled in the complex networks. In addition to measures like degree distribution, clustering coefficient, centrality, etc., another metric to characterize structural properties is network assortativity which measures the tendency of nodes to connect with similar nodes. In this paper, we explore metrics that effectively predict the links based on the assortativity profiles of the complex networks. To this end, we first propose an approach that generates networks of varying assortativity levels and utilize three sets of link prediction models combining the similarity of neighborhoods and preferential attachment. We carry out experiments to study the LP accuracy (measured in terms of area under the precision-recall curve) of the link predictors individually and in combination with other baseline measures. Our analysis shows that link prediction models that explore a large neighborhood around nodes of interest, such as CH2-L2 and CH2-L3, perform consistently for assortative as well as disassortative networks. While common neighbor-based local measures are effective for assortative networks, our proposed combination of common neighbors with node degree is a good choice for the LP metric in disassortative networks. We discuss how this analysis helps achieve the best-parameterized combination of link prediction models and its significance in the context of link prediction from incomplete social and biological network data.https://doi.org/10.1038/s41598-022-22843-4
spellingShingle Ahmad F. Al Musawi
Satyaki Roy
Preetam Ghosh
Identifying accurate link predictors based on assortativity of complex networks
Scientific Reports
title Identifying accurate link predictors based on assortativity of complex networks
title_full Identifying accurate link predictors based on assortativity of complex networks
title_fullStr Identifying accurate link predictors based on assortativity of complex networks
title_full_unstemmed Identifying accurate link predictors based on assortativity of complex networks
title_short Identifying accurate link predictors based on assortativity of complex networks
title_sort identifying accurate link predictors based on assortativity of complex networks
url https://doi.org/10.1038/s41598-022-22843-4
work_keys_str_mv AT ahmadfalmusawi identifyingaccuratelinkpredictorsbasedonassortativityofcomplexnetworks
AT satyakiroy identifyingaccuratelinkpredictorsbasedonassortativityofcomplexnetworks
AT preetamghosh identifyingaccuratelinkpredictorsbasedonassortativityofcomplexnetworks