krishnanlab / PecanPyLinks
A fast, parallelized, memory efficient, and cache-optimized Python implementation of node2vec
☆172Updated last week
Alternatives and similar repositories for PecanPy
Users that are interested in PecanPy are comparing it to the libraries listed below
Sorting:
- A tiny library for larger graphs☆119Updated last year
- Fast and scalable node2vec implementation☆97Updated 2 years ago
- TigerLily: Finding drug interactions in silico with the Graph.☆100Updated 2 years ago
- Code for the CIKM 2019 Paper "Fast and Accurate Network Embeddings via Very Sparse Random Projection"☆59Updated 6 years ago
- 🍇 Ensmallen is the Rust/Python high-performance graph processing submodule of the GRAPE library.☆40Updated 2 months ago
- Community Discovery Library☆408Updated 2 months ago
- Fastest network node embeddings in the west☆556Updated 11 months ago
- Hetnets in Python (relocated from dhimmel/hetio)☆99Updated 3 months ago
- Fastest random walks generator on networkx graphs☆76Updated last year
- 🍇 GRAPE is a Rust/Python Graph Representation Learning library for Predictions and Evaluations☆615Updated last year
- Hierarchical graph clustering☆38Updated 7 years ago
- NetworkX-based Python library for representing ontologies☆90Updated 2 years ago
- Graph Algorithms☆625Updated 2 weeks ago
- Given an input graph (ArangoDB or PyG) it generates graph embeddings using Low-Code framework built on top of PyG.☆68Updated last year
- A general purpose recommender metrics library for fair evaluation.☆278Updated 2 years ago
- ☆18Updated 11 months ago
- OBO-formatted ontologies → networkx (Python 3)☆150Updated 8 months ago
- Uniform Manifold Approximation with Two-phase Optimization (IEEE VIS 2022 short)☆112Updated 3 months ago
- A python library for hierarchical classification compatible with scikit-learn☆135Updated 9 months ago
- Implementation of Rank-biased Overlap☆150Updated last year
- Py3plex - A multilayer complex network visualization and analysis library in python3☆174Updated this week
- markov clustering in python☆175Updated 3 years ago
- Positive-unlabeled learning with Python.☆242Updated last week
- A performant, powerful query framework to search for network motifs☆89Updated 5 months ago
- Fastest Gephi's ForceAtlas2 graph layout algorithm implemented for Python and NetworkX☆304Updated last year
- OntoMerger is an ontology alignment library for deduplicating knowledge graph nodes that represent the same domain.☆101Updated last year
- Code, notebooks and examples with ECG: Ensemble Clustering for Graphs☆32Updated 3 years ago
- Hierarchical Uniform Manifold Approximation and Projection☆239Updated 9 months ago
- Fast hierarchical clustering routines for R and Python.☆155Updated 2 weeks ago
- The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…☆49Updated 2 years ago