# Correlation Clustering and Biclustering with Locally Bounded Errors

26 Jun 2015Gregory J. PuleoOlgica Milenkovic

We consider a generalized version of the correlation clustering problem, defined as follows. Given a complete graph $G$ 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... (read more)

PDF Abstract

# Code Add Remove

No code implementations yet. Submit your code now