Compara mètodes
Revisa els mètodes seleccionats l'un al costat de l'altre; les files que difereixen es ressalten.
| Anàlisi de xarxes de món petit i lliures d'escala× | Predicció d'enllaços× | |
|---|---|---|
| Camp | Anàlisi de xarxes | Anàlisi de xarxes |
| Família | Process / pipeline | Process / pipeline |
| Any d'origen≠ | 1998 (small-world); 1999 (scale-free) | 2003 |
| Autor original | — | — |
| Tipus≠ | Descriptive / exploratory network analysis | Network inference task |
| Font seminal≠ | Watts, D.J. & Strogatz, S.H. (1998). Collective Dynamics of 'Small-World' Networks. Nature, 393(6684), 440-442. DOI ↗ | Liben-Nowell, D. & Kleinberg, J. (2007). The Link-Prediction Problem for Social Networks. Journal of the American Society for Information Science and Technology, 58(7), 1019-1031. DOI ↗ |
| Àlies≠ | Küçük Dünya ve Ölçek-Bağımsız Ağ Analizi, small-world network, scale-free network, preferential attachment analysis | Bağlantı Tahmini (Link Prediction), missing link prediction, future link prediction, edge prediction |
| Relacionats≠ | 9 | 5 |
| Resum≠ | Small-world and scale-free network analysis tests whether a real-world network exhibits two landmark topological signatures identified in 1998-1999: the Watts-Strogatz small-world property (high local clustering combined with short average path lengths) and the Barabási-Albert scale-free property (a degree distribution that follows a power law, meaning a small number of hubs connect to a disproportionately large share of other nodes). Together these frameworks transformed network science by showing that many social, biological, and technological networks share a common structural grammar. | Link prediction is a network-analysis task that estimates which edges are missing from an observed graph or which edges are likely to form in the future. Formalised by Liben-Nowell and Kleinberg (2003, 2007), it covers a spectrum of approaches — from simple structural similarity indices such as Common Neighbors, Jaccard coefficient, and Adamic-Adar, to matrix factorisation, and graph neural network (GNN) methods — and is evaluated with AUC and Average Precision to account for the heavily imbalanced ratio of real to non-existing edges. |
| ScholarGateConjunt de dades ↗ |
|
|