Probably certifiably correct k -means clustering

Mathematical Programming, pp. 605-642, 2017.

Cited by: 0|Bibtex|Views4|Links
Keywords:
65-XX 90-XX 46N10 68Q87

Abstract:

Recently, Bandeira (C R Math, 2015) introduced a new type of algorithm (the so-called probably certifiably correct algorithm) that combines fast solvers with the optimality certificates provided by convex relaxations. In this paper, we devise such an algorithm for the problem of k-means clustering. First, we prove that Peng and Wei’s semi...More

Code:

Data:

Your rating :
0

 

Tags
Comments