K-means: differenze tra le versioni
Contenuto cancellato Contenuto aggiunto
m fix tag HTML per l'adeguamento al nuovo parser |
Recupero di 3 fonte/i e segnalazione di 0 link interrotto/i. #IABot (v1.6.5) |
||
Riga 90:
==Bibliografia==
* 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://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).
== Voci correlate ==
| |||