We introduce a new agnostic clustering method: minimax correlation clustering. Given a graph whose edges are labeled with $+$ or $-$, we wish to partition the graph into clusters while trying to avoid errors: $+$ edges between clusters or $-$ edges within clusters. Unlike classical →