atlas

Research map / Learning theory and algorithms / Clustering

New l1-Norm Relaxations and Optimizations for Graph Clustering

AAAI 2016 · Learning theory and algorithms › Clustering · approach: Spectral clustering algorithms · 25 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 squared-distance spectral relaxation with l1-norm relaxation (NR-RC)Ratio Cut · Breast cancer (2-way)clustering accuracy: 0.851 -> 0.913Helped
replace spectral relaxation with l1-norm relaxation (NR-NC)Normalized Cut · Breast cancer (2-way)clustering accuracy: 0.872 -> 0.938Helped
replace spectral relaxation with l1-norm relaxation (NR-RC)Ratio Cut · Ecoli (multi-way)clustering accuracy (%): 44.74 -> 64.35Helped
replace spectral relaxation with l1-norm relaxation (NR-NC)Normalized Cut · Ecoli (multi-way)clustering accuracy (%): 46.81 -> 63.22Helped
replace spectral relaxation with l1-norm relaxation (NR-NC)Normalized Cut · COIL20 (multi-way)clustering accuracy (%): 77.51 -> 78.42Helped
replace spectral relaxation with l1-norm relaxation (NR-RC)Ratio Cut · UMIST (multi-way)NMI (%): 76.45 -> 77.19Helped

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