asajadi / fast-pagerankLinks
Fast (Personalized) PageRank Implementation
☆67Updated last year
Alternatives and similar repositories for fast-pagerank
Users that are interested in fast-pagerank are comparing it to the libraries listed below
Sorting:
- SIGN: Scalable Inception Graph Network☆96Updated 4 years ago
- tNodeEmbed☆79Updated 2 years ago
- Scalable Graph Neural Networks for Heterogeneous Graphs☆72Updated 4 years ago
- PPRGo model in PyTorch, as proposed in "Scaling Graph Neural Networks with Approximate PageRank" (KDD 2020)☆126Updated 3 years ago
- (Personalized) Page-Rank computation using PyTorch☆92Updated 2 years ago
- A Broader Picture of Random-walk Based Graph Embedding☆30Updated 3 years ago
- The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.☆18Updated 2 years ago
- Node Embeddings in Dynamic Graphs☆56Updated 3 years ago
- [WSDM 2021]Bipartite Graph Embedding via Mutual Information Maximization☆76Updated 3 years ago
- 🏅 KG Inductive Link Prediction Challenge (ILPC) 2022☆85Updated 3 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆70Updated 2 years ago
- HDGI code☆62Updated 5 years ago
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆87Updated 11 months ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆130Updated 4 years ago
- ☆210Updated last year
- Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings☆95Updated 4 years ago
- An implementation of "Graph Structural-topic Neural Network"☆72Updated 4 years ago
- PPRGo model in TensorFlow 1, as proposed in "Scaling Graph Neural Networks with Approximate PageRank" (KDD 2020)☆36Updated 3 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆83Updated 6 years ago
- Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks☆59Updated 3 years ago
- [NeurIPS 2021] Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods☆123Updated 2 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆162Updated 4 years ago
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆106Updated last year
- Unsupervised Attributed Multiplex Network Embedding (AAAI 2020)☆149Updated 2 years ago
- NetSMF: Large-Scale Network Embedding as Sparse Matrix Factorization☆132Updated 3 years ago
- Source code and dataset for KDD 2020 paper "Understanding Negative Sampling in Graph Representation Learning"☆113Updated 3 years ago
- ☆48Updated 2 years ago
- ☆21Updated last year
- Data for "Understanding Isomorphism Bias in Graph Data Sets" paper.☆89Updated 5 years ago
- A tiny library for larger graphs☆118Updated 8 months ago