PecanPy: a fast, efficient and parallelized Python implementation of node2vec

27Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Learning low-dimensional representations (embeddings) of nodes in large graphs is key to applying machine learning on massive biological networks. Node2vec is the most widely used method for node embedding. However, its original Python and C++ implementations scale poorly with network density, failing for dense biological networks with hundreds of millions of edges. We have developed PecanPy, a new Python implementation of node2vec that uses cache-optimized compact graph data structures and precomputing/parallelization to result in fast, high-quality node embeddings for biological networks of all sizes and densities.

Cite

CITATION STYLE

APA

Liu, R., & Krishnan, A. (2021). PecanPy: a fast, efficient and parallelized Python implementation of node2vec. Bioinformatics, 37(19), 3377–3379. https://doi.org/10.1093/bioinformatics/btab202

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free