atlas

Research map / Learning theory and algorithms / Clustering

Compressive Spectral Clustering

ICML 2016 · Learning theory and algorithms › Clustering · approach: Spectral clustering algorithms · 57 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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
Replace k-means on all N nodes with k-means on O(k log k) sampled nodes, with interpolation (CSC)Spectral clustering · Amazon co-purchasing networkmodularity and computation timeNo clear effect
Replace eigendecomposition and full k-means with compressive filtering, sampling and interpolation (CSC)Spectral clustering on stochastic block model · SBM, N up to 10^5Adjusted Rand index and computation timeNo clear effect
Use power method instead of eigendecomposition for feature extractionSpectral clustering on Amazon network · Amazon co-purchasing networkcomputation timeHurt
Use CSC instead of SC for large k (k=200)SBM clustering time · SBM, N up to 10^5computation time: up to an order of magnitude faster at k=200Helped
Use CSC instead of SC for small k (k=20)SBM clustering time · SBM, k=20computation timeHurt

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