Fast recommendation algorithms for large graphs based on link analysis.
License: Apache Software License
Author: Emmanouil (Manios) Krasanakis
Dependencies: networkx, numpy, scipy, sklearn, wget (required) tensorflow, torch (optional)
⛺
Roadmap for 0.2.X
The following roadmap overviews short-term development goals and will be updated appropriately.
to_scipy >> preprocessor.)
🛠️
Installation
pygrank is meant to work with Python 3.9 or later. It can be installed with pip per:
pip install pygrank
To automatically use the machine learning backends (e.g. to integrate the package in machine learning projects) tensorflow and pytorch, manually change the automatically created configuration file whose path is displayed in the error console. If you want others to run your code that depends on pygrank with specific backends, add the following recipe at your code's entry point to override other configurations:
import pygrank as pg
pg.load_backend(`pytorch`)
⚡
Quickstart
As a quick start, let us construct a networkx graph G and a set of nodes seeds.
>>> import networkx as nx
>>> graph = nx.Graph()
>>> graph.add_edge("A", "B")
>>> graph.add_edge("B", "C")
>>> graph.add_edge("C", "D")
>>> graph.add_edge("D", "E")
>>> graph.add_edge("A", "C")
>>> graph.add_edge("C", "E")
>>> graph.add_edge("B", "E")
>>> seeds = {"A", "B"}
We now run a personalized PageRank graph filter to score the structural relatedness of graph nodes to the ones of the given set. We start by importing the library,
>>> import pygrank as pg
For instructional purposes, we select the PageRank filter. This and more filters can be found in the module pygrank.algorithms.filters, but for ease-of-use can be accessed from the top-level import. We also set the default values of some parameters: the graph diffusion rate alpha required by the algorithm, a numerical tolerance tol at the convergence point and a graph preprocessing strategy "auto" normalization of the garph adjacency matrix to determine between column-based and symmetric normalization depending on whether the graph is undirected (as in this example) or not respectively.
>>> ranker = pg.PageRank(alpha=0.85, tol=1.E-6, normalization="auto")
>>> ranks = ranker(graph, {v: 1 for v in seeds})
Node ranking output is always organized into graph signals which can be used like dictionaries. For example, we can print the scores of some nodes per:
>>> print(ranks["B"], ranks["D"], ranks["E"])
0.25865456609095644 0.12484722044728883 0.17079023174039495
We alter this outcome so that it outputs node order, where higher node scores are assigned lower order. This is achieved by wrapping a postprocessor around the algorithm. There are various postprocessors, including ones to make scores fairness-aware. Again, postprocessors can be found in pygrank.algorithms.postprocess, but for shortcut purposes can be used from the top-level package import.
>>> ordinals = pg.Ordinals(ranker).rank(graph, {v: 1 for v in seeds})
>>> print(ordinals["B"], ordinals["D"], ordinals["E"])
1 5 4
How much time did it take for the base ranker to converge? (Depends on backend and device characteristics.)
>>> print(ranker.convergence)
19 iterations (0.001831000000009908 sec)
Since only the node order is important, we can use a different way to specify convergence:
>>> convergence = pg.RankOrderConvergenceManager(pagerank_alpha=0.85, confidence=0.98)
>>> early_stop_ranker = pg.PageRank(alpha=0.85, convergence=convergence)
>>> ordinals = pg.Ordinals(early_stop_ranker).rank(graph, {v: 1 for v in seeds})
>>> print(early_stop_ranker.convergence)
2 iterations (0.0006313000000091051 sec)
>>> print(ordinals["B"], ordinals["D"], ordinals["E"])
1 5 4
Close to the previous results at a fraction of the time!! Note that convergence time measurements do not take into account the time needed to preprocess graphs.
🧠
Overview
Analyzing graph edges (links) between nodes can help rank/score graph nodes based on their structural proximity to structural or attribute-based communities of nodes. With the introduction of graph signal processing and decoupled graph neural networks the importance of node ranking has drastically increased, as its ability to perform inductive learning by quickly spreading node information through edges has been theoretically and experimentally corroborated. For example, it can be used to make predictions based on few known node attributes or base predictions outputted by low-quality feature-based machine learning models.
pygrank is a collection of node ranking algorithms and practices that support real-world conditions, such as large graphs and heterogeneous preprocessing and postprocessing requiremenets. Thus, it provides ready-to-use tools that simplify deployment of theoretical advancements and testing of new algorithms.
Some of the library's advantages are:
- Compatibility with networkx, tensorflow and pytorch.
- Datacentric interfaces that do not require transformations to identifiers.
- Large graph support with sparse representations and fast algorithms.
- Seamless pipelines, from graph preprocessing up to benchmarking and evaluation.
- Modular combination of components.
🔗
Material
Quick links
Measures
Graph Filters
Postprocessors
Tuners
Downloadable Datasets
🔥
Features
- Graph filters
- Community detection
- Graph normalization
- Convergence criteria
- Postprocessing (e.g. fairness awareness)
- Evaluation measures
- Benchmarks
- Autotuning
👍
Contributing
Feel free to contribute in any way, for example through the issue tracker or by participating in discussions. Please check out the contribution guidelines to bring modifications to the code base. If so, make sure to follow the pull checklist described in the guidelines.
📓
Citation
If pygrank has been useful in your research and you would like to cite it in a scientific publication, please refer to the following paper:
TBD
To publish research that uses provided methods, please cite the appropriate publications.
3 Jul 26, 2022
16 Oct 16, 2022
3 Apr 15, 2022
65 Dec 27, 2022
190 Dec 01, 2022
90 Oct 19, 2022
46 Dec 07, 2022
3 Aug 24, 2021
89 Dec 23, 2022
771 Dec 15, 2022
96 Dec 27, 2022
24 Oct 26, 2022
18.6k Jan 01, 2023
2 Oct 04, 2021
176 Jan 05, 2023
684 Dec 26, 2022
45 Nov 29, 2022
40 Dec 10, 2022
27 Dec 30, 2022
1.5k Jan 03, 2023