Link Prediction in Complex Hyper-Networks Leveraging HyperCentrality
In complex networks, predicting the formation of new connections, or links, within complex networks has been a central challenge, traditionally addressed using graph-based models. These models, however, are limited in their ability to capture higher-order interactions that exist in many real-world n...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10843197/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832590334504206336 |
|---|---|
| author | Y. V. Nandini T. Jaya Lakshmi Murali Krishna Enduri Mohd Zairul Mazwan Jilani |
| author_facet | Y. V. Nandini T. Jaya Lakshmi Murali Krishna Enduri Mohd Zairul Mazwan Jilani |
| author_sort | Y. V. Nandini |
| collection | DOAJ |
| description | In complex networks, predicting the formation of new connections, or links, within complex networks has been a central challenge, traditionally addressed using graph-based models. These models, however, are limited in their ability to capture higher-order interactions that exist in many real-world networks, such as social, biological, and technological systems. To account for these multi-node interactions, hyper-networks have emerged as a more flexible framework, where hyperedges can connect multiple nodes simultaneously. Traditional link prediction methods often treat all common neighbors equally, overlooking the fact that not all nodes contribute uniformly to the formation of future links. Each node within a network holds a distinct level of importance, which can influence the likelihood of link formation among its neighbors. To address this, we introduce a link prediction approach leveraging hypercentrality measures adapted from traditional centrality metrics such as degree, clustering coefficient, betweenness, and closeness to capture node significance and improve link prediction in hyper-networks. We propose the Link Prediction Based on HyperCentrality in hyper-networks (LPHC) model, which enhances traditional common neighbor and jaccard coefficient of hyper-network frameworks by incorporating centrality scores to account for node importance. Our approach is evaluated across multiple real-world hyper-networks datasets, demonstrating its superiority over traditional link prediction methods. The results show that link prediction in hypercentrality-based models, particularly those utilizing hyperdegree and hyperclustering coefficients for common neighbor and jaccard coefficent approaches in hyper-networks, consistently outperform existing methods in terms of both F1-score and Area Under the Precision-Recall Curve (AUPR), offering a more precise understanding of potential link formations in hyper-networks. The proposed LPHC model consistently outperforms the existing HCN and HJC models across all datasets, achieving an overall improvement of 69% compared to HCN and 68% compared to HJC. |
| format | Article |
| id | doaj-art-7000bb3d98b54f438875fab2a6872f58 |
| institution | Kabale University |
| issn | 2169-3536 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj-art-7000bb3d98b54f438875fab2a6872f582025-01-24T00:01:36ZengIEEEIEEE Access2169-35362025-01-0113122391225410.1109/ACCESS.2025.353024510843197Link Prediction in Complex Hyper-Networks Leveraging HyperCentralityY. V. Nandini0T. Jaya Lakshmi1https://orcid.org/0000-0003-0183-4093Murali Krishna Enduri2https://orcid.org/0000-0002-9029-2187Mohd Zairul Mazwan Jilani3Department of Computer Science and Engineering, SRM University-AP, Amaravati, Andhra Pradesh, IndiaDepartment of Computer Science and Engineering, SRM University-AP, Amaravati, Andhra Pradesh, IndiaDepartment of Computer Science and Engineering, SRM University-AP, Amaravati, Andhra Pradesh, IndiaDepartment of Computing, Sheffield Hallam University, Sheffield, U.K.In complex networks, predicting the formation of new connections, or links, within complex networks has been a central challenge, traditionally addressed using graph-based models. These models, however, are limited in their ability to capture higher-order interactions that exist in many real-world networks, such as social, biological, and technological systems. To account for these multi-node interactions, hyper-networks have emerged as a more flexible framework, where hyperedges can connect multiple nodes simultaneously. Traditional link prediction methods often treat all common neighbors equally, overlooking the fact that not all nodes contribute uniformly to the formation of future links. Each node within a network holds a distinct level of importance, which can influence the likelihood of link formation among its neighbors. To address this, we introduce a link prediction approach leveraging hypercentrality measures adapted from traditional centrality metrics such as degree, clustering coefficient, betweenness, and closeness to capture node significance and improve link prediction in hyper-networks. We propose the Link Prediction Based on HyperCentrality in hyper-networks (LPHC) model, which enhances traditional common neighbor and jaccard coefficient of hyper-network frameworks by incorporating centrality scores to account for node importance. Our approach is evaluated across multiple real-world hyper-networks datasets, demonstrating its superiority over traditional link prediction methods. The results show that link prediction in hypercentrality-based models, particularly those utilizing hyperdegree and hyperclustering coefficients for common neighbor and jaccard coefficent approaches in hyper-networks, consistently outperform existing methods in terms of both F1-score and Area Under the Precision-Recall Curve (AUPR), offering a more precise understanding of potential link formations in hyper-networks. The proposed LPHC model consistently outperforms the existing HCN and HJC models across all datasets, achieving an overall improvement of 69% compared to HCN and 68% compared to HJC.https://ieeexplore.ieee.org/document/10843197/Hyper-networkslink predictioncentrality measures |
| spellingShingle | Y. V. Nandini T. Jaya Lakshmi Murali Krishna Enduri Mohd Zairul Mazwan Jilani Link Prediction in Complex Hyper-Networks Leveraging HyperCentrality IEEE Access Hyper-networks link prediction centrality measures |
| title | Link Prediction in Complex Hyper-Networks Leveraging HyperCentrality |
| title_full | Link Prediction in Complex Hyper-Networks Leveraging HyperCentrality |
| title_fullStr | Link Prediction in Complex Hyper-Networks Leveraging HyperCentrality |
| title_full_unstemmed | Link Prediction in Complex Hyper-Networks Leveraging HyperCentrality |
| title_short | Link Prediction in Complex Hyper-Networks Leveraging HyperCentrality |
| title_sort | link prediction in complex hyper networks leveraging hypercentrality |
| topic | Hyper-networks link prediction centrality measures |
| url | https://ieeexplore.ieee.org/document/10843197/ |
| work_keys_str_mv | AT yvnandini linkpredictionincomplexhypernetworksleveraginghypercentrality AT tjayalakshmi linkpredictionincomplexhypernetworksleveraginghypercentrality AT muralikrishnaenduri linkpredictionincomplexhypernetworksleveraginghypercentrality AT mohdzairulmazwanjilani linkpredictionincomplexhypernetworksleveraginghypercentrality |