Research map / Learning theory and algorithms / Clustering
Higher-Order Spectral Clustering of Directed Graphs
Steinar Laenen, He Sun
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 SimpleHerm instead of Herm-RW or DD-SYM | Directed Stochastic Block Model, n=1000, k=4 · Synthetic DSBM with path structure | Adjusted Rand Index (ARI) | Improved |
| Use SimpleHerm instead of Herm-RW or DD-SYM | Directed Stochastic Block Model, n=2000, k=8 · Synthetic DSBM with significant path topology | Adjusted Rand Index (ARI) | Improved |
| Use SimpleHerm rather than DD-SYM for year-to-year clustering | UN Comtrade oil trade data · International oil trade, 2002–2017 | Clustering stability | Improved |
Closest papers by meaning
- Pass-Efficient Algorithms for Graph Spectral Clustering (Student Abstract) (AAAI 2024 · similarity 0.89)
- Fast Approximate Spectral Clustering for Dynamic Networks (ICML 2018 · similarity 0.89)
- Dynamic Spectral Clustering with Provable Approximation Guarantee (ICML 2024 · similarity 0.86)
- Optimal Graph Clustering without Edge Density Signals (NeurIPS 2025 · similarity 0.86)
- Equivalence between Graph Spectral Clustering and Column Subset Selection (Student Abstract) (AAAI 2024 · similarity 0.86)
- A Differentially Private Clustering Algorithm for Well-Clustered Graphs (ICLR 2024 · 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.
