Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Prédiction de liens× | Plongement de réseau× | |
|---|---|---|
| Domaine | Analyse de réseaux | Analyse de réseaux |
| Famille | Process / pipeline | Process / pipeline |
| Année d'origine≠ | 2003 | 2014 (DeepWalk); 2016 (Node2Vec) |
| Auteur d'origine | — | — |
| Type≠ | Network inference task | Representation learning / unsupervised network method |
| Source fondatrice≠ | 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 ↗ | Grover, A. & Leskovec, J. (2016). Node2Vec: Scalable Feature Learning for Networks. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 855-864. DOI ↗ |
| Alias | Bağlantı Tahmini (Link Prediction), missing link prediction, future link prediction, edge prediction | node embedding, graph embedding, network representation learning, Ağ Gömme (Node2Vec, DeepWalk, LINE) |
| Apparentées≠ | 5 | 3 |
| Résumé≠ | 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. | Network embedding is a family of representation-learning methods that map each node of a graph into a dense, low-dimensional vector while preserving the network's structural properties. The approach was formalised for social-network data by Perozzi, Al-Rfou, and Skiena with DeepWalk (2014), which adapted the Word2Vec skip-gram model to random walks on graphs, and extended by Grover and Leskovec with Node2Vec (2016), which introduced a biased random walk that balances breadth-first and depth-first exploration. These embeddings turn relational data into feature vectors that standard machine-learning classifiers and clustering algorithms can consume directly. |
| ScholarGateJeu de données ↗ |
|
|