Cited by 10,926Advanced Graph Neural NetworksComplex Network Analysis TechniquesTopological and Geometric Data Analysis

node2vec: Scalable Feature Learning for Networks

Grover, Aditya, Leskovec, Jure·2016·Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

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.

Integrity signals

Registry

Crossref · 10.1145/2939672.2939754

Cites

34 of 34 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Cites

Flagged first, then by citations

4 of the 38 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Grover, A., & Leskovec, J.
Affiliations
Stanford University (US)
Venue
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Publisher
ACM
Published
2016-08-13
Pages
855-864
OpenAlex
W2962756421
Cited by
10,926
References
38
Citations by year
2026: 594 · 2025: 1153 · 2024: 1271 · 2023: 1349 · 2022: 1336 · 2021: 1660 · 2020: 1472 · 2019: 1183 · 2018: 663 · 2017: 217 · 2016: 23 · 2015: 1 · 2012: 2
FWCI
367.64
Type
conference paper
Language
en
Open access
closed
Locations
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) (publishedVersion)
Funders
National Institute of Biomedical Imaging and Bioengineering (U54EB020405)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Topological and Geometric Data Analysis
Keywords
node2vec, node representation learning, graph representation learning, biased random walk, node embeddings, graph neural networks, edge prediction

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review