2016 Node2vecScalableFeatureLearning: Difference between revisions
m (Text replacement - " Qiaozhu Mei" to " Qiaozhu Mei") |
m (Text replacement - " Lei Li" to " Lei Li") |
||
| Line 35: | Line 35: | ||
* 8. Brian Gallagher, Tina Eliassi-Rad, Leveraging Label-independent Features for Classification in Sparsely Labeled Networks: An Empirical Study, Proceedings of the Second International Conference on Advances in Social Network Mining and Analysis, p.1-19, August 24-27, 2008, Las Vegas, NV, USA | * 8. Brian Gallagher, Tina Eliassi-Rad, Leveraging Label-independent Features for Classification in Sparsely Labeled Networks: An Empirical Study, Proceedings of the Second International Conference on Advances in Social Network Mining and Analysis, p.1-19, August 24-27, 2008, Las Vegas, NV, USA | ||
* 9. Z. S. Harris. Word. Distributional Structure, 10(23):146--162, 1954. | * 9. Z. S. Harris. Word. Distributional Structure, 10(23):146--162, 1954. | ||
* 10. Keith Henderson, Brian Gallagher, Tina Eliassi-Rad, Hanghang Tong, Sugato Basu, Leman Akoglu, Danai Koutra, Christos Faloutsos, Lei Li, RolX: Structural Role Extraction & Mining in Large Graphs, Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 12-16, 2012, Beijing, China [http://doi.acm.org/10.1145/2339530.2339723 doi:10.1145/2339530.2339723] | * 10. Keith Henderson, Brian Gallagher, Tina Eliassi-Rad, Hanghang Tong, Sugato Basu, Leman Akoglu, Danai Koutra, Christos Faloutsos, [[Lei Li]], RolX: Structural Role Extraction & Mining in Large Graphs, Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 12-16, 2012, Beijing, China [http://doi.acm.org/10.1145/2339530.2339723 doi:10.1145/2339530.2339723] | ||
* 11. Keith Henderson, Brian Gallagher, Lei Li, Leman Akoglu, Tina Eliassi-Rad, Hanghang Tong, Christos Faloutsos, It's Who You Know: Graph Mining Using Recursive Structural Features, Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 21-24, 2011, San Diego, California, USA [http://doi.acm.org/10.1145/2020408.2020512 doi:10.1145/2020408.2020512] | * 11. Keith Henderson, Brian Gallagher, [[Lei Li]], Leman Akoglu, Tina Eliassi-Rad, Hanghang Tong, Christos Faloutsos, It's Who You Know: Graph Mining Using Recursive Structural Features, Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 21-24, 2011, San Diego, California, USA [http://doi.acm.org/10.1145/2020408.2020512 doi:10.1145/2020408.2020512] | ||
* 12. P. D. Hoff, A. E. Raftery, and M. S. Handcock. Latent Space Approaches to Social Network Analysis. J. of the American Statistical Association, 2002. | * 12. P. D. Hoff, A. E. Raftery, and M. S. Handcock. Latent Space Approaches to Social Network Analysis. J. of the American Statistical Association, 2002. | ||
* 13. Donald E. Knuth, The Stanford GraphBase: A Platform for Combinatorial Computing, ACM, New York, NY, 1993 | * 13. Donald E. Knuth, The Stanford GraphBase: A Platform for Combinatorial Computing, ACM, New York, NY, 1993 | ||
Latest revision as of 06:36, 8 March 2024
- (Grover & Leskovec, 2016) ⇒ Aditya Grover, and Jure Leskovec. (2016). “node2vec: Scalable Feature Learning for Networks.” In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ISBN:978-1-4503-4232-2 doi:10.1145/2939672.2939754
Subject Headings: node2vec Algorithm.
Notes
Cited By
- http://scholar.google.com/scholar?q=%222016%22+node2vec%3A+Scalable+Feature+Learning+for+Networks
- http://dl.acm.org/citation.cfm?id=2939672.2939754&preflayout=flat#citedby
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
;
| Author | volume | Date Value | title | type | journal | titleUrl | doi | note | year | |
|---|---|---|---|---|---|---|---|---|---|---|
| 2016 Node2vecScalableFeatureLearning | Jure Leskovec Aditya Grover | node2vec: Scalable Feature Learning for Networks | 10.1145/2939672.2939754 | 2016 |