Research map / Learning theory and algorithms / Clustering
Parametrized Power-Iteration Clustering for Directed Graphs
Gwendal Debaussart-Joniec, Harry Sevi, Matthieu Jonckheere, Argyris Kalogeratos
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 parametrized reversible operator instead of symmetrized walk (S-PIC) | power-iteration clustering · DiSBM-Chain | AMI: 0.57 -> 0.93 | Improved |
| use parametrized operator instead of symmetrized walk (S-PIC) | power-iteration clustering · DiSBM-CP | AMI: 0.59 -> 1.00 | Improved |
| use parametrized operator instead of symmetrized walk (S-PIC) | power-iteration clustering · PolBlogs | AMI: 0.01 -> 0.39 | Improved |
| use parametrized operator instead of natural random walk (PIC) | power-iteration clustering · DiSBM-Chain | AMI: 0.28 -> 0.93 | Improved |
| use parametrized operator instead of natural walk (PIC) | power-iteration clustering · Email-Eu | AMI: 0.01 -> 0.48 | Improved |
| use parametrized operator instead of symmetrized walk (S-PIC) | power-iteration clustering · Email-Eu | AMI: 0.49 -> 0.48 | No clear effect |
| use parametrized operator instead of symmetrized walk (S-PIC) | power-iteration clustering · K-NN digraphs (10 datasets) | PRB: 0.96 -> 0.96 | No clear effect |
| use parametrized operator instead of symmetrized walk (S-PIC) | power-iteration clustering · Directed networks (5 graphs) | PRB: 0.65 -> 1.00 | Improved |
| vertex measure parameter gamma set to 0 instead of at least 0.25 (ablation) | ParPIC · DiSBM-Chain | AMI: gamma >= 0.25 perfect clustering -> 0 AMI at gamma=0 | Hurt |
| increase vertex measure parameter gamma close to 1 (ablation) | ParPIC · K-NN digraphs (Iris, Seeds, Vertebral, Control Chart, Glass) | AMI | Hurt |
| lower gamma on Email-Eu (ablation) | ParPIC · Email-Eu | AMI | Improved |
| select diffusion time by entropy instead of acceleration-based criterion (ablation) | ParPIC · diffusion time selection | AMI | Improved |
Closest papers by meaning
- Pass-Efficient Algorithms for Graph Spectral Clustering (Student Abstract) (AAAI 2024 · similarity 0.89)
- Structure-Aware Spectral Sparsification via Uniform Edge Sampling (NeurIPS 2025 · similarity 0.87)
- Optimal Graph Clustering without Edge Density Signals (NeurIPS 2025 · similarity 0.87)
- A Differentially Private Clustering Algorithm for Well-Clustered Graphs (ICLR 2024 · similarity 0.86)
- A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering (ICML 2024 · similarity 0.86)
- Online Sparsification of Bipartite-Like Clusters in Graphs (ICML 2025 · similarity 0.86)
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.
