Login / Signup
Near Optimal LP Rounding Algorithm for Correlation Clustering on Complete and Complete k-partite Graphs.
Shuchi Chawla
Konstantin Makarychev
Tselil Schramm
Grigory Yaroslavtsev
Published in:
CoRR (2014)
Keyphrases
</>
correlation clustering
linear programming
k means
np hard
detection algorithm
graph structure
learning algorithm
similarity measure
objective function
dynamic programming
computational complexity
cost function
probabilistic model
data clustering
expectation maximization
computational efficiency