AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Hierarchical Clustering with Structural Constraints

Vaggos Chatziafratis, Rad Niazadeh, Moses Charikar

ICML 2018 · Learning theory and algorithms › Clustering · approach: Clustering approximation algorithms · 34 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
Add triplet constraints to noisy spectral clusteringRecursive spectral clustering · Zoo (20 animals)Dasgupta's HC cost: 1286 -> 1142Improved
Add triplet constraints to noisy spectral clusteringRecursive spectral clustering · Zoo (50 animals)Dasgupta's HC cost: 25216 -> 23443Improved
Add triplet constraints to noisy spectral clusteringRecursive spectral clustering · Zoo (80 animals)Dasgupta's HC cost: 99211 -> 90419Improved
Add triplet constraints to noisy spectral clusteringRecursive spectral clustering · Zoo (100 animals)Dasgupta's HC cost: 190205 -> 173499Improved

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