AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Exact Clustering of Weighted Graphs via Semidefinite Programming

Aleksis Pirinen, Brendan Ames

JMLR 2019 · Graph learning › Graph algorithms and clustering · approach: Neural and local graph clustering

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
replace dense noise with sparse between-cluster noise (q = 1/sqrt(n))SDP relaxation of densest k-disjoint clique via ADMM · planted cluster model, n=1000minimum cluster size for exact recoveryImproved

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