The maximum capability of a topological feature in link prediction
© The Author(s) 2024. Published by Oxford University Press on behalf of National Academy of Sciences..
Networks offer a powerful approach to modeling complex systems by representing the underlying set of pairwise interactions. Link prediction is the task that predicts links of a network that are not directly visible, with profound applications in biological, social, and other complex systems. Despite intensive utilization of the topological feature in this task, it is unclear to what extent a feature can be leveraged to infer missing links. Here, we aim to unveil the capability of a topological feature in link prediction by identifying its prediction performance upper bound. We introduce a theoretical framework that is compatible with different indexes to gauge the feature, different prediction approaches to utilize the feature, and different metrics to quantify the prediction performance. The maximum capability of a topological feature follows a simple yet theoretically validated expression, which only depends on the extent to which the feature is held in missing and nonexistent links. Because a family of indexes based on the same feature shares the same upper bound, the potential of all others can be estimated from one single index. Furthermore, a feature's capability is lifted in the supervised prediction, which can be mathematically quantified, allowing us to estimate the benefit of applying machine learning algorithms. The universality of the pattern uncovered is empirically verified by 550 structurally diverse networks. The findings have applications in feature and method selection, and shed light on network characteristics that make a topological feature effective in link prediction.
| Medienart: |
E-Artikel |
|---|
| Erscheinungsjahr: |
2024 |
|---|---|
| Erschienen: |
2024 |
| Enthalten in: |
Zur Gesamtaufnahme - volume:3 |
|---|---|
| Enthalten in: |
PNAS nexus - 3(2024), 3 vom: 25. März, Seite pgae113 |
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Ran, Yijun [VerfasserIn] |
|---|
| Links: |
|---|
| Themen: |
Journal Article |
|---|
| Anmerkungen: |
Date Revised 29.03.2024 published: Electronic-eCollection Citation Status PubMed-not-MEDLINE |
|---|
| doi: |
10.1093/pnasnexus/pgae113 |
|---|
| funding: |
|
|---|---|
| Förderinstitution / Projekttitel: |
|
| PPN (Katalog-ID): |
NLM370185099 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLM370185099 | ||
| 003 | DE-627 | ||
| 005 | 20240330001429.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 240327s2024 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1093/pnasnexus/pgae113 |2 doi | |
| 028 | 5 | 2 | |a pubmed24n1355.xml |
| 035 | |a (DE-627)NLM370185099 | ||
| 035 | |a (NLM)38528954 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Ran, Yijun |e verfasserin |4 aut | |
| 245 | 1 | 4 | |a The maximum capability of a topological feature in link prediction |
| 264 | 1 | |c 2024 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ƒaComputermedien |b c |2 rdamedia | ||
| 338 | |a ƒa Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Date Revised 29.03.2024 | ||
| 500 | |a published: Electronic-eCollection | ||
| 500 | |a Citation Status PubMed-not-MEDLINE | ||
| 520 | |a © The Author(s) 2024. Published by Oxford University Press on behalf of National Academy of Sciences. | ||
| 520 | |a Networks offer a powerful approach to modeling complex systems by representing the underlying set of pairwise interactions. Link prediction is the task that predicts links of a network that are not directly visible, with profound applications in biological, social, and other complex systems. Despite intensive utilization of the topological feature in this task, it is unclear to what extent a feature can be leveraged to infer missing links. Here, we aim to unveil the capability of a topological feature in link prediction by identifying its prediction performance upper bound. We introduce a theoretical framework that is compatible with different indexes to gauge the feature, different prediction approaches to utilize the feature, and different metrics to quantify the prediction performance. The maximum capability of a topological feature follows a simple yet theoretically validated expression, which only depends on the extent to which the feature is held in missing and nonexistent links. Because a family of indexes based on the same feature shares the same upper bound, the potential of all others can be estimated from one single index. Furthermore, a feature's capability is lifted in the supervised prediction, which can be mathematically quantified, allowing us to estimate the benefit of applying machine learning algorithms. The universality of the pattern uncovered is empirically verified by 550 structurally diverse networks. The findings have applications in feature and method selection, and shed light on network characteristics that make a topological feature effective in link prediction | ||
| 650 | 4 | |a Journal Article | |
| 650 | 4 | |a link prediction | |
| 650 | 4 | |a maximum capability | |
| 650 | 4 | |a supervised approach | |
| 650 | 4 | |a topological feature | |
| 650 | 4 | |a unsupervised approach | |
| 700 | 1 | |a Xu, Xiao-Ke |e verfasserin |4 aut | |
| 700 | 1 | |a Jia, Tao |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t PNAS nexus |d 2022 |g 3(2024), 3 vom: 25. März, Seite pgae113 |w (DE-627)NLM338905472 |x 2752-6542 |7 nnns |
| 773 | 1 | 8 | |g volume:3 |g year:2024 |g number:3 |g day:25 |g month:03 |g pages:pgae113 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1093/pnasnexus/pgae113 |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a GBV_NLM | ||
| 951 | |a AR | ||
| 952 | |d 3 |j 2024 |e 3 |b 25 |c 03 |h pgae113 | ||