Versione delle 16:11, 13 mar 2019 modifica Horcrux (discussione \| contributi) Amministratori dell'interfaccia, Amministratori 162 134 modifiche Annullata la modifica 103320996 di 93.47.171.144 (discussione) Etichetta: Annulla ← Differenza precedente		Versione delle 11:37, 2 mag 2019 modifica annulla LauBot (discussione \| contributi) Bot 856 854 modifiche m Bot: passaggio degli url da HTTP a HTTPS Differenza successiva →
Riga 91: * J. B. MacQueen (1967): "Some Methods for classification and Analysis of Multivariate Observations", Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, University of California Press, 1:281-297 * [https://web.archive.org/web/20060902143345/http://www.stanford.edu/~darthur/ D. Arthur], [https://web.archive.org/web/20060830055220/http://www.stanford.edu/~sergeiv/ S. Vassilvitskii] (2006): "How Slow is the k-means Method?," Proceedings of the 2006 Symposium on Computational Geometry (SoCG). * [~~http~~https://cseweb.ucsd.edu/~avattani A. Vattani] (2009): "k-means requires exponentially many iterations even in the plane," Proceedings of the 2009 Symposium on Computational Geometry (SoCG). * [https://web.archive.org/web/20060902143345/http://www.stanford.edu/~darthur/ D. Arthur], [http://wwwhome.math.utwente.nl/~mantheyb B. Manthey], [http://www.roeglin.org H. Roeglin] (2009): "k-means has polynomial smoothed complexity," Proceedings of the 50th Symposium on Foundations of Computer Science (FOCS).

K-means: differenze tra le versioni