{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"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,"slug":"in2v-bringing-transductive-node-embeddings-to","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","slug":"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,"slug":"a-quantum-annealing-approach-to-graph-node","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,"slug":"stationary-distribution-of-node2vec-random","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,"slug":"machine-learning-based-security-policy","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","slug":"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,"slug":"spatio-temporal-latent-representations-for","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,"slug":"risksea-a-scalable-graph-embedding-for","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,"slug":"from-first-order-to-higher-order-interactions","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","slug":"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,"slug":"subgraph2vec-a-random-walk-based-algorithm","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","slug":"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,"slug":"re-visiting-skip-gram-negative-sampling","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","slug":"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,"slug":"bert4fca-a-method-for-bipartite-link","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,"slug":"mastery-guided-non-parametric-clustering-to","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,"slug":"an-fpga-based-accelerator-for-graph-embedding","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,"slug":"detecting-anomalous-network-communication","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,"slug":"single-cell-clustering-via-dual-graph","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,"slug":"can-we-hedge-carbon-risk-a-network-embedding","title":"Hedging carbon risk with a network approach","date":"2023-11-21","arxiv_id":"2311.12450","n_code_links":0,"syntology":null},{"paper":null,"slug":"united-we-stand-divided-we-fall-unitygraph","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,"slug":"kg-frus-a-novel-graph-based-dataset-of-127","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","slug":"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,"slug":"positional-encoding-based-resident","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,"slug":"community-detection-and-classification","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","slug":"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,"slug":"node-embedding-for-homophilous-graphs-with","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","slug":"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,"slug":"noddle-node2vec-based-deep-learning-model-for","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,"slug":"kgtrust-evaluating-trustworthiness-of-siot","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},{"paper":null,"slug":"higher-order-organizational-features-can","title":"Higher order organizational features can distinguish protein interaction networks of disease classes: a case study of neoplasms and neurological diseases","date":"2022-12-26","arxiv_id":"2212.13171","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-heuristics-for-the-maximum-clique","title":"Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations","date":"2022-10-30","arxiv_id":"2210.16963","n_code_links":0,"syntology":null},{"paper":null,"slug":"local-intrinsic-dimensionality-measures-for","title":"Local Intrinsic Dimensionality Measures for Graphs, with Applications to Graph Embeddings","date":"2022-08-25","arxiv_id":"2208.11986","n_code_links":0,"syntology":null},{"paper":"/paper/on-the-surprising-behaviour-of-node2vec","slug":"on-the-surprising-behaviour-of-node2vec","title":"On the Surprising Behaviour of node2vec","date":"2022-06-16","arxiv_id":"2206.08252","n_code_links":1,"syntology":{"ran":4,"of":10,"n_ran_checked":4,"n_instrument":0,"unverified":6,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","official":{"repos":["aidos-lab/node2vec-surprises"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"kgea-a-knowledge-graph-enhanced-article","title":"KE-QI: A Knowledge Enhanced Article Quality Identification Dataset","date":"2022-06-15","arxiv_id":"2206.07556","n_code_links":0,"syntology":null},{"paper":"/paper/domain-adversarial-spatial-temporal-network-a","slug":"domain-adversarial-spatial-temporal-network-a","title":"Domain Adversarial Spatial-Temporal Network: A Transferable Framework for Short-term Traffic Forecasting across Cities","date":"2022-02-08","arxiv_id":"2202.03630","n_code_links":1,"syntology":null},{"paper":null,"slug":"taxonomy-enrichment-with-text-and-graph","title":"Taxonomy Enrichment with Text and Graph Vector Representations","date":"2022-01-21","arxiv_id":"2201.08598","n_code_links":0,"syntology":null},{"paper":"/paper/classic-graph-structural-features-outperform","slug":"classic-graph-structural-features-outperform","title":"Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling","date":"2022-01-20","arxiv_id":"2201.08481","n_code_links":1,"syntology":null},{"paper":"/paper/asymptotics-of-ell-2-regularized-network","slug":"asymptotics-of-ell-2-regularized-network","title":"Asymptotics of $\\ell_2$ Regularized Network Embeddings","date":"2022-01-05","arxiv_id":"2201.01689","n_code_links":1,"syntology":null},{"paper":null,"slug":"stjla-a-multi-context-aware-spatio-temporal","title":"STJLA: A Multi-Context Aware Spatio-Temporal Joint Linear Attention Network for Traffic Forecasting","date":"2021-12-04","arxiv_id":"2112.02262","n_code_links":0,"syntology":null},{"paper":null,"slug":"community-detection-using-low-dimensional","title":"Community detection using low-dimensional network embedding algorithms","date":"2021-11-04","arxiv_id":"2111.05267","n_code_links":0,"syntology":null},{"paper":"/paper/grape-fast-and-scalable-graph-processing-and","slug":"grape-fast-and-scalable-graph-processing-and","title":"GRAPE for Fast and Scalable Graph Processing and random walk-based Embedding","date":"2021-10-12","arxiv_id":"2110.06196","n_code_links":2,"syntology":null},{"paper":null,"slug":"harnessing-the-power-of-ego-network-layers","title":"Harnessing the Power of Ego Network Layers for Link Prediction in Online Social Networks","date":"2021-09-19","arxiv_id":"2109.09190","n_code_links":0,"syntology":null},{"paper":null,"slug":"knowledge-graph-based-neurodegenerative","title":"Knowledge Graph-based Neurodegenerative Diseases and Diet Relationship Discovery","date":"2021-09-13","arxiv_id":"2109.06123","n_code_links":0,"syntology":null},{"paper":null,"slug":"quint-node-embedding-using-network-hashing","title":"QUINT: Node embedding using network hashing","date":"2021-09-09","arxiv_id":"2109.04206","n_code_links":0,"syntology":null},{"paper":null,"slug":"integrating-transductive-and-inductive","title":"Integrating Transductive And Inductive Embeddings Improves Link Prediction Accuracy","date":"2021-08-23","arxiv_id":"2108.10108","n_code_links":0,"syntology":null},{"paper":"/paper/asymptotics-of-network-embeddings-learned-via","slug":"asymptotics-of-network-embeddings-learned-via","title":"Asymptotics of Network Embeddings Learned via Subsampling","date":"2021-07-06","arxiv_id":"2107.02363","n_code_links":2,"syntology":{"ran":8,"of":9,"n_ran_checked":6,"n_instrument":2,"unverified":1,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["aday651/embed-asym-exeriments","aday651/embed-asym-experiments"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"fund2vec-mutual-funds-similarity-using-graph","title":"Fund2Vec: Mutual Funds Similarity using Graph Learning","date":"2021-06-24","arxiv_id":"2106.12987","n_code_links":0,"syntology":null},{"paper":null,"slug":"high-tension-lines-predicting-robustness-of","title":"High Tension Lines: Predicting robustness of high-voltage power-grids to cascading failure using network embedding","date":"2021-05-27","arxiv_id":"2105.13224","n_code_links":0,"syntology":null},{"paper":null,"slug":"graph-based-link-prediction-between-human","title":"Graph Based Link Prediction between Human Phenotypes and Genes","date":"2021-05-25","arxiv_id":"2105.11989","n_code_links":0,"syntology":null},{"paper":"/paper/the-unknown-knowns-a-graph-based-approach-for","slug":"the-unknown-knowns-a-graph-based-approach-for","title":"The unknown knowns: a graph-based approach for temporal COVID-19 literature mining","date":"2021-03-23","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"persistent-homology-and-graphs-representation-1","title":"Persistent Homology and Graphs Representation Learning","date":"2021-03-08","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"persistent-homology-and-graphs-representation","title":"Persistent Homology and Graphs Representation Learning","date":"2021-02-25","arxiv_id":"2102.12926","n_code_links":0,"syntology":null},{"paper":"/paper/evaluating-node-embeddings-of-complex","slug":"evaluating-node-embeddings-of-complex","title":"Evaluating Node Embeddings of Complex Networks","date":"2021-02-16","arxiv_id":"2102.08275","n_code_links":2,"syntology":null},{"paper":"/paper/improving-graph-representation-learning-by","slug":"improving-graph-representation-learning-by","title":"Calibrating and Improving Graph Contrastive Learning","date":"2021-01-27","arxiv_id":"2101.11525","n_code_links":1,"syntology":null},{"paper":null,"slug":"consistency-of-random-walk-based-network","title":"Exact Recovery of Community Structures Using DeepWalk and Node2vec","date":"2021-01-18","arxiv_id":"2101.07354","n_code_links":0,"syntology":null},{"paper":"/paper/het-node2vec-second-order-random-walk","slug":"het-node2vec-second-order-random-walk","title":"Het-node2vec: second order random walk sampling for heterogeneous multigraphs embedding","date":"2021-01-05","arxiv_id":"2101.01425","n_code_links":1,"syntology":null},{"paper":"/paper/a-pipeline-for-fair-comparison-of-graph","slug":"a-pipeline-for-fair-comparison-of-graph","title":"A pipeline for fair comparison of graph neural networks in node classification tasks","date":"2020-12-19","arxiv_id":"2012.10619","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["karl-zhao/benchmarking-gnns-pyg"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"instantembedding-efficient-local-node-1","title":"InstantEmbedding: Efficient Local Node Representations","date":"2020-10-14","arxiv_id":"2010.06992","n_code_links":0,"syntology":null},{"paper":"/paper/k-simplex2vec-a-simplicial-extension-of","slug":"k-simplex2vec-a-simplicial-extension-of","title":"k-simplex2vec: a simplicial extension of node2vec","date":"2020-10-12","arxiv_id":"2010.05636","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":null,"slug":"cell-complex-neural-networks","title":"Cell Complex Neural Networks","date":"2020-10-02","arxiv_id":"2010.00743","n_code_links":0,"syntology":null},{"paper":null,"slug":"div2vec-diversity-emphasized-node-embedding","title":"div2vec: Diversity-Emphasized Node Embedding","date":"2020-09-21","arxiv_id":"2009.09588","n_code_links":0,"syntology":null},{"paper":null,"slug":"nextdoor-gpu-based-graph-sampling-for","title":"Accelerating Graph Sampling for Graph Machine Learning using GPUs","date":"2020-09-14","arxiv_id":"2009.06693","n_code_links":0,"syntology":null},{"paper":"/paper/snore-scalable-unsupervised-learning-of","slug":"snore-scalable-unsupervised-learning-of","title":"SNoRe: Scalable Unsupervised Learning of Symbolic Node Representations","date":"2020-09-08","arxiv_id":"2009.04535","n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-based-link-prediction-analysis-for","title":"Learning-based link prediction analysis for Facebook100 network","date":"2020-08-01","arxiv_id":"2008.00308","n_code_links":0,"syntology":null},{"paper":"/paper/pecanpy-a-parallelized-efficient-and","slug":"pecanpy-a-parallelized-efficient-and","title":"PecanPy: A parallelized, efficient, and accelerated node2vec in Python","date":"2020-07-23","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"epgat-gene-essentiality-prediction-with-graph","title":"EPGAT: Gene Essentiality Prediction With Graph Attention Networks","date":"2020-07-19","arxiv_id":"2007.09671","n_code_links":0,"syntology":null},{"paper":null,"slug":"build2vec-building-representation-in-vector","title":"Build2Vec: Building Representation in Vector Space","date":"2020-07-01","arxiv_id":"2007.00740","n_code_links":0,"syntology":null},{"paper":null,"slug":"adversarial-learning-for-debiasing-knowledge","title":"Adversarial Learning for Debiasing Knowledge Graph Embeddings","date":"2020-06-29","arxiv_id":"2006.16309","n_code_links":0,"syntology":null},{"paper":"/paper/the-effects-of-randomness-on-the-stability-of","slug":"the-effects-of-randomness-on-the-stability-of","title":"The Effects of Randomness on the Stability of Node Embeddings","date":"2020-05-20","arxiv_id":"2005.10039","n_code_links":2,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["SGDE2020/embedding_stability"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/machine-learning-on-graphs-a-model-and","slug":"machine-learning-on-graphs-a-model-and","title":"Machine Learning on Graphs: A Model and Comprehensive Taxonomy","date":"2020-05-07","arxiv_id":"2005.03675","n_code_links":1,"syntology":{"ran":2,"of":8,"n_ran_checked":2,"n_instrument":0,"unverified":6,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","official":{"repos":["google/gcnn-survey-paper"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":"/paper/recommendation-system-using-a-deep-learning","slug":"recommendation-system-using-a-deep-learning","title":"Recommendation system using a deep learning and graph analysis approach","date":"2020-04-17","arxiv_id":"2004.08100","n_code_links":1,"syntology":null},{"paper":null,"slug":"the-impossibility-of-low-rank-representations","title":"The impossibility of low rank representations for triangle-rich complex networks","date":"2020-03-27","arxiv_id":"2003.12635","n_code_links":0,"syntology":null},{"paper":null,"slug":"using-distributional-thesaurus-embedding-for","title":"Using Distributional Thesaurus Embedding for Co-hyponymy Detection","date":"2020-02-24","arxiv_id":"2002.11506","n_code_links":0,"syntology":null},{"paper":null,"slug":"predicting-event-attendance-exploring-social","title":"Predicting event attendance exploring social influence","date":"2020-02-16","arxiv_id":"2002.06665","n_code_links":0,"syntology":null},{"paper":null,"slug":"cnntop-a-cnn-based-trajectory-owner","title":"CNNTOP: a CNN-based Trajectory Owner Prediction Method","date":"2020-01-05","arxiv_id":"2001.01185","n_code_links":0,"syntology":null},{"paper":null,"slug":"characterizing-and-detecting-money-laundering","title":"Characterizing and Detecting Money Laundering Activities on the Bitcoin Network","date":"2019-12-27","arxiv_id":"1912.12060","n_code_links":0,"syntology":null},{"paper":null,"slug":"fca2vec-embedding-techniques-for-formal","title":"FCA2VEC: Embedding Techniques for Formal Concept Analysis","date":"2019-11-26","arxiv_id":"1911.11496","n_code_links":0,"syntology":null},{"paper":null,"slug":"network-embedding-an-overview","title":"Network Embedding: An Overview","date":"2019-11-26","arxiv_id":"1911.11726","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-network-embedding-for-machine-learning-on","title":"On Network Embedding for Machine Learning on Road Networks: A Case Study on the Danish Road Network","date":"2019-11-14","arxiv_id":"1911.06217","n_code_links":0,"syntology":null},{"paper":"/paper/prediction-of-missing-semantic-relations-in","slug":"prediction-of-missing-semantic-relations-in","title":"Prediction of Missing Semantic Relations in Lexical-Semantic Network using Random Forest Classifier","date":"2019-11-12","arxiv_id":"1911.04759","n_code_links":1,"syntology":null},{"paper":null,"slug":"dense-node-representation-for-geolocation","title":"Dense Node Representation for Geolocation","date":"2019-11-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"state2vec-off-policy-successor-features","title":"State2vec: Off-Policy Successor Features Approximators","date":"2019-10-22","arxiv_id":"1910.10277","n_code_links":0,"syntology":null},{"paper":null,"slug":"tutorial-on-nlp-inspired-network-embedding","title":"Tutorial on NLP-Inspired Network Embedding","date":"2019-10-16","arxiv_id":"1910.07212","n_code_links":0,"syntology":null},{"paper":null,"slug":"distributed-word2vec-using-graph-analytics","title":"Distributed Training of Embeddings using Graph Analytics","date":"2019-09-08","arxiv_id":"1909.03359","n_code_links":0,"syntology":null},{"paper":"/paper/fast-and-accurate-network-embeddings-via-very","slug":"fast-and-accurate-network-embeddings-via-very","title":"Fast and Accurate Network Embeddings via Very Sparse Random Projection","date":"2019-08-30","arxiv_id":"1908.11512","n_code_links":2,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["GTmac/FastRP"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"camsterdam-at-semeval-2019-task-6-neural-and","title":"CAMsterdam at SemEval-2019 Task 6: Neural and graph-based feature extraction for the identification of offensive tweets","date":"2019-06-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/network-representation-learning-consolidation","slug":"network-representation-learning-consolidation","title":"Network Representation Learning: Consolidation and Renewed Bearing","date":"2019-05-02","arxiv_id":"1905.00987","n_code_links":1,"syntology":null},{"paper":null,"slug":"190412605","title":"N2VSCDNNR: A Local Recommender System Based on Node2vec and Rich Information Network","date":"2019-04-12","arxiv_id":"1904.12605","n_code_links":0,"syntology":null},{"paper":null,"slug":"190501958","title":"Text2Node: a Cross-Domain System for Mapping Arbitrary Phrases to a Taxonomy","date":"2019-04-11","arxiv_id":"1905.01958","n_code_links":0,"syntology":null},{"paper":"/paper/incremental-embedding-for-temporal-networks","slug":"incremental-embedding-for-temporal-networks","title":"FILDNE: A Framework for Incremental Learning of Dynamic Networks Embeddings","date":"2019-04-06","arxiv_id":"1904.03423","n_code_links":1,"syntology":null},{"paper":"/paper/learning-vertex-representations-for-bipartite","slug":"learning-vertex-representations-for-bipartite","title":"Learning Vertex Representations for Bipartite Networks","date":"2019-01-16","arxiv_id":"1901.09676","n_code_links":1,"syntology":null},{"paper":null,"slug":"representation-learning-on-graphs-a","title":"Representation Learning on Graphs: A Reinforcement Learning Application","date":"2019-01-16","arxiv_id":"1901.05351","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynnode2vec-scalable-dynamic-network","title":"dynnode2vec: Scalable Dynamic Network Embedding","date":"2018-12-06","arxiv_id":"1812.02356","n_code_links":0,"syntology":null},{"paper":null,"slug":"syntree2vec-an-algorithm-to-augment-syntactic","title":"Syntree2Vec - An algorithm to augment syntactic hierarchy into word embeddings","date":"2018-08-14","arxiv_id":"1808.05907","n_code_links":0,"syntology":null},{"paper":"/paper/seq2seq-dependency-parsing","slug":"seq2seq-dependency-parsing","title":"Seq2seq Dependency Parsing","date":"2018-08-01","arxiv_id":null,"n_code_links":3,"syntology":null},{"paper":"/paper/spectral-network-embedding-a-fast-and","slug":"spectral-network-embedding-a-fast-and","title":"Spectral Network Embedding: A Fast and Scalable Method via Sparsity","date":"2018-06-07","arxiv_id":"1806.02623","n_code_links":1,"syntology":null},{"paper":null,"slug":"can-network-embedding-of-distributional","title":"Can Network Embedding of Distributional Thesaurus be Combined with Word Vectors for Better Representation?","date":"2018-02-17","arxiv_id":"1802.06196","n_code_links":0,"syntology":null},{"paper":"/paper/learning-role-based-graph-embeddings","slug":"learning-role-based-graph-embeddings","title":"Learning Role-based Graph Embeddings","date":"2018-02-07","arxiv_id":"1802.02896","n_code_links":2,"syntology":null},{"paper":null,"slug":"inductive-representation-learning-in-large","title":"Inductive Representation Learning in Large Attributed Graphs","date":"2017-10-25","arxiv_id":"1710.09471","n_code_links":0,"syntology":null}],"papers_shown":100,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":104,"with_a_code_link":35,"where_syntology_ran_a_sample":9,"not_listed_spam_title":0,"listed":104,"listed_where_code_ran":9,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":7,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":7,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":9,"papers_where_code_ran_first_page":"/method/node2vec/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"archive","page":2,"of":2,"url":"/method/node2vec/papers/2","json":"/method/node2vec/papers/2.json","rows":4},{"order":"ran","page":1,"of":1,"url":"/method/node2vec/papers/ran/1","json":"/method/node2vec/papers/ran/1.json","rows":9}],"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-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=node2vec","read_at":"2026-10-05T00:59:41+00:00","query":"node2vec","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"node2vec","origin_arxiv_id":"1607.00653"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"1607.00653","repositories":{"listed":5,"in_graph":20,"list_truncated":true,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"1607.00653","citations":12540},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'node2vec'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"1607.00653","page":"/paper/node2vec-scalable-feature-learning-for","syntology_url":"https://syntology.ai/paper/1607.00653","in_graph_layer":true,"samples":25,"ran":15,"n_ran_checked":12,"n_instrument":3,"unverified":10,"phrase":"15 ran (of which 2 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"repository known, no verified implementation (declared_code; repositories: 5 listed of 20 in the graph, strongest link: official). This answer is about arXiv:1607.00653, the paper the archive credits with this method.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"e93743f6a5ace6f066cfa69a4ad50ce33e0bcd0679a8e73dea5db226a92d5f6c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}