Probably certifiably correct k-means clustering
Math. Program., Volume abs/1509.07983, Issue 2, 2017.
Recently, Bandeira [arXiv:1509.00824] 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 ...More
PPT (Upload PPT)