AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Consistency of Constrained Spectral Clustering under Graph Induced Fair Planted Partitions

Shubham Gupta, Ambedkar Dukkipati

NeurIPS 2022 · Learning theory and algorithms › Clustering · approach: Spectral clustering algorithms · 4 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 URepSC instead of USCspectral clustering · synthetic d-regular representation graphs, varying NaccuracyMixed
use URepSC instead of USC as K increases with Nspectral clustering · synthetic d-regular representation graphs, varying KaccuracyImproved
use URepSC (approx.) instead of UFairSCclustering with representation graphs sampled from a planted partition model · synthetic non-d-regular representation graphsaverage individual balance / ratio-cutMixed
use URepSC (approx.) instead of UFairSCFAO trade network · FAO trade networkaverage balance / ratio-cutImproved
apply URepSC (approx.) when the representation graph is not d-regularrepresentation-aware spectral clustering · synthetic and real-world representation graphsperformanceImproved

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