EEMCS EPrints Service
|
||||||||||||||||||||||||||||||||||||
|
Arthur, D. and Manthey, B. and Röglin, H.
(2009)
k-Means has polynomial smoothed complexity.
In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009), 24-27 Oct 2009, Atlanta, GA, USA.
pp. 405-414.
IEEE Computer Society.
ISBN 978-0-7695-3850-1
Full text available as:
Official URL: http://doi.ieeecomputersociety.org/10.1109/FOCS.2009.14 ![]() AbstractThe k-means method is one of the most widely used clustering algorithms, drawing its popularity from its speed in practice. Recently, however, it was shown to have exponential worst-case running time. In order to close the gap between practical performance and theoretical analysis, the k-means method has been studied in the model of smoothed analysis. But even the smoothed analyses so far are unsatisfactory as the bounds are still super-polynomial in the number n of data points.
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
||||||||||||||||||||||||||||||||||||
