atlas

Research map / Learning theory and algorithms / Clustering

One-Step Spectral Clustering via Dynamically Learning Affinity Matrix and Subspace

AAAI 2017 · Learning theory and algorithms › Clustering · approach: Subspace clustering · 23 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
one-step spectral clustering vs CLRspectral clustering · UmistACC: 69.22 -> 79.83Helped
one-step spectral clustering vs CLRspectral clustering · CoilACC: 85.35 -> 94.72Helped
one-step spectral clustering vs CLRspectral clustering · YaleBACC: 30.16 -> 45.94Helped
one-step spectral clustering vs CLRspectral clustering · WineACC: 72.47 -> 72.47No clear effect
one-step spectral clustering vs CLRspectral clustering · WineNMI: 39.27 -> 39.27No clear effect
one-step spectral clustering vs RCutspectral clustering · JaffeACC: 96.24 -> 96.71No clear effect
one-step spectral clustering vs CLRspectral clustering · YaleBNMI: 45.07 -> 49.70Helped
one-step spectral clustering vs NCut at high noisespectral clustering · Synthetic sigma 0.9ACC: 85% -> 95%Helped

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