AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Understanding Regularized Spectral Clustering via Graph Conductance

Yilin Zhang, Karl Rohe

NeurIPS 2018 · Learning theory and algorithms › Clustering · approach: Spectral clustering algorithms · 50 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 Regularized-SC instead of Vanilla-SCSpectral clustering on 37 SNAP networks · SNAP networkssize of smaller partitionImproved
Use Regularized-SC instead of Vanilla-SCSpectral clustering with edges split into training and testing sets · SNAP networkstesting-edge conductanceImproved
Use Regularized-SC instead of Vanilla-SCSpectral clustering in rARPACK · SNAP networksrunning time: roughly eight times fasterImproved
Use Vanilla-SC instead of Regularized-SCSpectral clustering with training edges · SNAP networkstraining-edge conductanceImproved
Add edge-wise regularization to spectral clusteringSparse and stochastic graphs with peripheral nodes · Inhomogeneous random graph modelcost assigned to small peripheral cutsImproved
Add edge-wise regularization to spectral clusteringSpectral clustering on graphs with dangling sets · Graphs containing g-dangling setssensitivity to small noisy cutsImproved

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