Research map / Graph learning / Graph algorithms and clustering
Scikit-network: Graph Analysis in Python
Thomas Bonald, Nathan de Lara, Quentin Lutz, Bertrand Charpentier
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use scikit-network instead of iGraph for Louvain clustering | Louvain · Orkut (Konect) | execution time (s): 1,978 -> 771 | Improved |
| use scikit-network instead of iGraph for PageRank | PageRank · Orkut (Konect) | execution time (s): 236 -> 48 | Improved |
| use scikit-network instead of graph-tool for PageRank | PageRank · Orkut (Konect) | execution time (s): 45 -> 48 | No clear effect |
| use scikit-network instead of iGraph for HITS | HITS · Orkut (Konect) | execution time (s): 80 -> 109 | Hurt |
| use scikit-network instead of graph-tool for HITS | HITS · Orkut (Konect) | execution time (s): 144 -> 109 | Improved |
| use scikit-network CSR representation instead of iGraph when loading the graph | graph loading · Orkut (Konect) | RAM usage (MB): 17,765 -> 1,222 | Improved |
| use scikit-network CSR representation instead of graph-tool when loading the graph | graph loading · Orkut (Konect) | RAM usage (MB): 10,366 -> 1,222 | Improved |
| use scikit-network instead of NetworkX on a 3,072,441-node graph | PageRank, HITS, Spectral · Orkut (Konect) | memory overflow | Improved |
Closest papers by meaning
- GraKeL: A Graph Kernel Library in Python (JMLR 2020 · similarity 0.83)
- scikit-multilearn: A Python library for Multi-Label Classification (JMLR 2019 · similarity 0.83)
- GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models (ICML 2018 · similarity 0.82)
- Beyond Real-world Benchmark Datasets: An Empirical Study of Node Classification with GNNs (NeurIPS 2022 · similarity 0.82)
- Graphon based Clustering and Testing of Networks: Algorithms and Theory (ICLR 2022 · similarity 0.82)
- A Fair Comparison of Graph Neural Networks for Graph Classification (ICLR 2020 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
