AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Scalable and Effective Conductance-Based Graph Clustering

Longlong Lin, Ronghua Li, Tao Jia

AAAI 2023 · Learning theory and algorithms › Clustering · approach: Spectral clustering algorithms · 23 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use degree-ratio peeling instead of spectral clusteringPCon_de vs SC · DBLP, Youtube, Pokec, LJ, Orkut, Twitterruntime (seconds): 56 -> 11; 552 -> 39; 165 -> 141; 14492 -> 345; 837 -> 577; 130570 -> 7655Improved
Use degree-ratio peeling instead of spectral clusteringPCon_de vs SC · DBLPconductance: 0.009 -> 0.027Hurt
Use degree-ratio peeling instead of spectral clusteringPCon_de vs SC · Youtube, Pokec, LJ, Orkut, Twitterconductance: 0.006 -> 0.004; 0.002 -> 0.001; 0.001 -> 0.000; 0.007 -> 0.006; 0.002 -> 0.000Improved
Use degeneracy ordering rather than degree-ratio scoresPCon_core vs PCon_de · Real-world graphsruntime (seconds)Improved
Use degeneracy ordering rather than degree-ratio scoresPCon_core vs PCon_de · Real-world graphsconductanceHurt
Use linear-space peeling algorithms instead of SCPCon_core and PCon_de vs SC · Real-world graphsmemory overhead: 1.4 ∼ 7.8 times less memoryImproved
Increase diffusion parameter εNIBBLE_PPR and HK_Relax · Real-world graphsconductanceHurt

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy