atlas

Research map / Learning theory and algorithms / Clustering

Hierarchical Clustering Beyond the Worst-Case

NeurIPS 2017 · Learning theory and algorithms › Clustering · approach: Clustering approximation algorithms · 27 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
Use SVD projection seeding (LINKAGE++) before single-linkage instead of plain linkageLINKAGE++ · Synthetic HSBMclassification error: drops from 0.5 to 0 when n goes from 512 to 1024 (k=8)Helped
Use SVD projection seeding followed by agglomerative merging (LINKAGE++) versus classic linkage heuristicsLINKAGE++ · Real-world sklearn datasetsDasgupta cost (normalized)Helped
Use only the SVD phase (PCA+) without the agglomerative phase on hierarchical data (ablation)PCA+ · newsgroup (hierarchical) datasetDasgupta costHurt
Use only phase 1 SVD projection (PCA+) on synthetic highly structured HSBM (ablation)PCA+ · Synthetic HSBMclassification error and costNo clear effect
Replace SVD seeding with single-linkage/complete-linkage heuristics aloneclassic linkage heuristics · Synthetic HSBMnormalized Dasgupta costHurt

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