K-nearest neighbors: differenze tra le versioni

Contenuto cancellato Contenuto aggiunto
m - Link errato (voce mancante)
mNessun oggetto della modifica
Riga 2:
 
== Caratteristiche principali ==
È l'algoritmo più semplice fra quelli utilizzati nell'[[apprendimento automatico]] (''machine learning'').
 
=== Il parametro ''k'' ===
Riga 57:
* [[Belur V. Dasarathy]], editor (1991) ''Nearest Neighbour (NN) Norms: NN Pattern Classification Techniques'', ISBN 0-8186-8930-7
* ''Nearest-Neighbour Methods in Learning and Vision'', edited by Shakhnarovish, Darrell, and Indyk, The MIT Press, 2005, ISBN 0-262-19547-X
 
* Estimation of forest stand volumes by Landsat TM imagery and stand-level field-inventory data. [[Forest Ecology and Management]], Volume 196, Issues 2-3, 26 July 2004, Pages 245-255. Helena Mäkelä and Anssi Pekkarinen
 
* Estimation and mapping of forest stand density, volume, and cover type using the ''k''-nearest neighbour method. Remote Sensing of Environment, Volume 77, Issue 3, September 2001, Pages 251-274. Hector Franco-Lopez, Alan R. Ek and Marvin E. Bauer