2016 Node2vecScalableFeatureLearning: Difference between revisions

From GM-RKB
Jump to navigation Jump to search
m (Text replacement - " ↵↵" to " ")
m (Text replacement - " Qiaozhu Mei" to " Qiaozhu Mei")
Line 53: Line 53:
* 26. B. Recht, C. Re, S. Wright, and F. Niu. Hogwild!: A Lock-free Approach to Parallelizing Stochastic Gradient Descent. In NIPS, 2011.
* 26. B. Recht, C. Re, S. Wright, and F. Niu. Hogwild!: A Lock-free Approach to Parallelizing Stochastic Gradient Descent. In NIPS, 2011.
* 27. S. T. Roweis and L. K. Saul. Nonlinear Dimensionality Reduction by Locally Linear Embedding. Science, 290(5500):2323--2326, 2000.
* 27. S. T. Roweis and L. K. Saul. Nonlinear Dimensionality Reduction by Locally Linear Embedding. Science, 290(5500):2323--2326, 2000.
* 28. Jian Tang, Meng Qu, Mingzhe Wang, Ming Zhang, Jun Yan, Qiaozhu Mei, LINE: Large-scale Information Network Embedding, Proceedings of the 24th International Conference on World Wide Web, May 18-22, 2015, Florence, Italy [http://doi.acm.org/10.1145/2736277.2741093 doi:10.1145/2736277.2741093]
* 28. Jian Tang, Meng Qu, Mingzhe Wang, Ming Zhang, Jun Yan, [[Qiaozhu Mei]], LINE: Large-scale Information Network Embedding, Proceedings of the 24th International Conference on World Wide Web, May 18-22, 2015, Florence, Italy [http://doi.acm.org/10.1145/2736277.2741093 doi:10.1145/2736277.2741093]
* 29. Lei Tang, Huan Liu, Leveraging Social Media Networks for Classification, Data Mining and Knowledge Discovery, v.23 n.3, p.447-478, November 2011 [https://dx.doi.org/10.1007/s10618-010-0210-x doi:10.1007/s10618-010-0210-x]
* 29. Lei Tang, Huan Liu, Leveraging Social Media Networks for Classification, Data Mining and Knowledge Discovery, v.23 n.3, p.447-478, November 2011 [https://dx.doi.org/10.1007/s10618-010-0210-x doi:10.1007/s10618-010-0210-x]
* 30. J. B. Tenenbaum, V. De Silva, and J. C. Langford. A Global Geometric Framework for Nonlinear Dimensionality Reduction. Science, 290(5500):2319--2323, 2000.
* 30. J. B. Tenenbaum, V. De Silva, and J. C. Langford. A Global Geometric Framework for Nonlinear Dimensionality Reduction. Science, 290(5500):2319--2323, 2000.

Revision as of 05:37, 16 February 2024

Subject Headings: node2vec Algorithm.

Notes

Cited By

Quotes

Abstract

Prediction tasks over nodes and edges in networks require careful effort in engineering features used by learning algorithms. Recent research in the broader field of representation learning has led to significant progress in automating prediction by learning the features themselves. However, present feature learning approaches are not expressive enough to capture the diversity of connectivity patterns observed in networks. Here we propose node2vec, an algorithmic framework for learning continuous feature representations for nodes in networks. In node2vec, we learn a mapping of nodes to a low-dimensional space of features that maximizes the likelihood of preserving network neighborhoods of nodes. We define a flexible notion of a node's network neighborhood and design a biased random walk procedure, which efficiently explores diverse neighborhoods. Our algorithm generalizes prior work which is based on rigid notions of network neighborhoods, and we argue that the added flexibility in exploring neighborhoods is the key to learning richer representations.

We demonstrate the efficacy of node2vec over existing state-of-the-art techniques on multi-label classification and link prediction in several real-world networks from diverse domains. Taken together, our work represents a new way for efficiently learning state-of-the-art task-independent representations in complex networks.

References

;

 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
2016 Node2vecScalableFeatureLearningJure Leskovec
Aditya Grover
node2vec: Scalable Feature Learning for Networks10.1145/2939672.29397542016