{"url":"/method/node2vec","slug":"node2vec","name":"node2vec","full_name":"node2vec","full_name_withheld":false,"description_markdown":"**node2vec** is a framework for learning graph embeddings for nodes in graphs. Node2vec maximizes a likelihood objective over mappings which preserve neighbourhood distances in higher dimensional spaces. From an algorithm design perspective, node2vec exploits the freedom to define neighbourhoods for nodes and provide an explanation for the effect of the choice of neighborhood on the learned representations. \r\n\r\nFor each node, node2vec simulates biased random walks based on an efficient network-aware search strategy and the nodes appearing in the random walk define neighbourhoods. The search strategy accounts for the relative influence nodes exert in a network. It also generalizes prior work alluding to naive search strategies by providing flexibility in exploring neighborhoods.","description_state":"present","introduced_year":null,"introduced_by":{"title":"node2vec: Scalable Feature Learning for Networks","paper":"/paper/node2vec-scalable-feature-learning-for","first_author":"Aditya Grover","n_authors":2,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/node2vec-scalable-feature-learning-for"},"source":{"url":"http://arxiv.org/abs/1607.00653v1","title":"node2vec: Scalable Feature Learning for Networks","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Embeddings","url":"/methods/category/graph-embeddings","pwc_aliases":[]}],"n_papers_tagged":104,"archive_num_papers":104,"papers_newest_first":[{"paper":null,"title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","date":"2025-06-05","arxiv_id":"2506.05039","n_code_links":0,"syntology":null},{"paper":"/paper/graph-based-floor-separation-using-node","title":"Graph-Based Floor Separation Using Node Embeddings and Clustering of WiFi Trajectories","date":"2025-05-12","arxiv_id":"2505.08088","n_code_links":1,"syntology":null},{"paper":null,"title":"A quantum annealing approach to graph node embedding","date":"2025-03-08","arxiv_id":"2503.06332","n_code_links":0,"syntology":null},{"paper":null,"title":"Stationary distribution of node2vec random walks on household models","date":"2025-02-26","arxiv_id":"2502.19039","n_code_links":0,"syntology":null},{"paper":null,"title":"Machine Learning-Based Security Policy Analysis","date":"2024-12-30","arxiv_id":"2501.00085","n_code_links":0,"syntology":null},{"paper":"/paper/two-layer-walk-a-community-aware-graph","title":"Two Layer Walk: A Community-Aware Graph Embedding","date":"2024-12-17","arxiv_id":"2412.12933","n_code_links":1,"syntology":null},{"paper":null,"title":"Spatio-temporal Latent Representations for the Analysis of Acoustic Scenes in-the-wild","date":"2024-12-10","arxiv_id":"2412.07648","n_code_links":0,"syntology":null},{"paper":null,"title":"RiskSEA : A Scalable Graph Embedding for Detecting On-chain Fraudulent Activities on the Ethereum Blockchain","date":"2024-10-03","arxiv_id":"2410.02160","n_code_links":0,"syntology":null},{"paper":null,"title":"From First-order to Higher-order Interactions: Enhanced Representation of Homotopic Functional Connectivity through Control of Intervening Variables","date":"2024-06-09","arxiv_id":"2406.05859","n_code_links":0,"syntology":null},{"paper":"/paper/network-analytics-for-anti-money-laundering-a","title":"Network Analytics for Anti-Money Laundering -- A Systematic Literature Review and Experimental Evaluation","date":"2024-05-29","arxiv_id":"2405.19383","n_code_links":1,"syntology":null},{"paper":null,"title":"Subgraph2vec: A random walk-based algorithm for embedding knowledge graphs","date":"2024-05-03","arxiv_id":"2405.02240","n_code_links":0,"syntology":null},{"paper":"/paper/robustness-of-graph-embedding-methods-for","title":"Robustness of graph embedding methods for community detection","date":"2024-05-01","arxiv_id":"2405.00636","n_code_links":1,"syntology":null},{"paper":null,"title":"Bypassing Skip-Gram Negative Sampling: Dimension Regularization as a More Efficient Alternative for Graph Embeddings","date":"2024-04-30","arxiv_id":"2405.00172","n_code_links":0,"syntology":null},{"paper":"/paper/are-graph-embeddings-the-panacea-an-empirical","title":"Are Graph Embeddings the Panacea? An Empirical Survey from the Data Fitness Perspective","date":"2024-04-25","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"title":"BERT4FCA: A Method for Bipartite Link Prediction using Formal Concept Analysis and BERT","date":"2024-02-13","arxiv_id":"2402.08236","n_code_links":0,"syntology":null},{"paper":null,"title":"Mastery Guided Non-parametric Clustering to Scale-up Strategy Prediction","date":"2024-01-04","arxiv_id":"2401.10210","n_code_links":0,"syntology":null},{"paper":null,"title":"An FPGA-Based Accelerator for Graph Embedding using Sequential Training Algorithm","date":"2023-12-23","arxiv_id":"2312.15138","n_code_links":0,"syntology":null},{"paper":null,"title":"Detecting Anomalous Network Communication Patterns Using Graph Convolutional Networks","date":"2023-11-30","arxiv_id":"2311.18525","n_code_links":0,"syntology":null},{"paper":null,"title":"Single-Cell Deep Clustering Method Assisted by Exogenous Gene Information: A Novel Approach to Identifying Cell Types","date":"2023-11-28","arxiv_id":"2311.17104","n_code_links":0,"syntology":null},{"paper":null,"title":"Hedging carbon risk with a network approach","date":"2023-11-21","arxiv_id":"2311.12450","n_code_links":0,"syntology":null},{"paper":null,"title":"United We Stand, Divided We Fall: UnityGraph for Unsupervised Procedure Learning from Videos","date":"2023-11-06","arxiv_id":"2311.03550","n_code_links":0,"syntology":null},{"paper":null,"title":"KG-FRUS: a Novel Graph-based Dataset of 127 Years of US Diplomatic Relations","date":"2023-10-30","arxiv_id":"2311.01606","n_code_links":0,"syntology":null},{"paper":"/paper/embedding-in-recommender-systems-a-survey","title":"Embedding in Recommender Systems: A Survey","date":"2023-10-28","arxiv_id":"2310.18608","n_code_links":1,"syntology":null},{"paper":null,"title":"Positional Encoding-based Resident Identification in Multi-resident Smart Homes","date":"2023-10-27","arxiv_id":"2310.17836","n_code_links":0,"syntology":null},{"paper":null,"title":"Community Detection Guarantees Using Embeddings Learned by Node2Vec","date":"2023-10-26","arxiv_id":"2310.17712","n_code_links":0,"syntology":null},{"paper":"/paper/topological-node2vec-enhanced-graph-embedding","title":"Topological Node2vec: Enhanced Graph Embedding via Persistent Homology","date":"2023-09-15","arxiv_id":"2309.08241","n_code_links":1,"syntology":null},{"paper":null,"title":"Node Embedding for Homophilous Graphs with ARGEW: Augmentation of Random walks by Graph Edge Weights","date":"2023-08-11","arxiv_id":"2308.05957","n_code_links":0,"syntology":null},{"paper":"/paper/scalable-and-equitable-math-problem-solving","title":"Scalable and Equitable Math Problem Solving Strategy Prediction in Big Educational Data","date":"2023-08-07","arxiv_id":"2308.03892","n_code_links":1,"syntology":null},{"paper":null,"title":"NODDLE: Node2vec based deep learning model for link prediction","date":"2023-05-25","arxiv_id":"2305.16421","n_code_links":0,"syntology":null},{"paper":null,"title":"KGTrust: Evaluating Trustworthiness of SIoT via Knowledge Enhanced Graph Neural Networks","date":"2023-02-22","arxiv_id":"2302.11396","n_code_links":0,"syntology":null}],"papers_shown":30,"tasks":[{"task":"/task/link-prediction","name":"Link Prediction","papers":26},{"task":"/task/representation-learning","name":"Representation Learning","papers":26},{"task":"/task/graph-embedding","name":"Graph Embedding","papers":19},{"task":"/task/network-embedding","name":"Network Embedding","papers":19},{"task":"/task/node-classification","name":"Node Classification","papers":17},{"task":"/task/community-detection","name":"Community Detection","papers":8},{"task":"/task/graph-representation-learning","name":"Graph Representation Learning","papers":8},{"task":"/task/machine-learning","name":"BIG-bench Machine Learning","papers":7},{"task":"/task/clustering","name":"Clustering","papers":7},{"task":"/task/recommendation-systems","name":"Recommendation Systems","papers":7},{"task":"/task/classification","name":"General Classification","papers":6},{"task":"/task/prediction","name":"Prediction","papers":6},{"task":"/task/knowledge-graphs","name":"Knowledge Graphs","papers":4},{"task":"/task/word-embeddings","name":"Word Embeddings","papers":4},{"task":"/task/anomaly-detection","name":"Anomaly Detection","papers":3},{"task":"/task/attribute","name":"Attribute","papers":3},{"task":"/task/decoder","name":"Decoder","papers":3},{"task":"/task/graph-learning","name":"Graph Learning","papers":3},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":3},{"task":"/task/self-supervised-learning","name":"Self-Supervised Learning","papers":3}],"tasks_shown":20,"n_tasks":86,"usage_by_year":[{"year":"2016","papers":1},{"year":"2017","papers":4},{"year":"2018","papers":6},{"year":"2019","papers":17},{"year":"2020","papers":19},{"year":"2021","papers":18},{"year":"2022","papers":9},{"year":"2023","papers":14},{"year":"2024","papers":12},{"year":"2025","papers":4}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/node2vec"},"syntology_read_at":"2026-09-24T18:15:14+00:00"}