The k-NN rules and their modifications offer usually very good performance. The main disadvantage of the k-NN rules is the necessity of keeping the reference set (i.e. training set) in the computer memory. Numerous algorithms for the reference set reduction have been already created. They concern the 1-NN rule and are based on the consistency idea. The 1-NN rule operating with a consistent reduced set classifies correctly, by virtue of consistency, all objects from the original reference set. Quite different approach, based on partitioning of the reference set into some subsets, was proposed earlier by the present authors. The gravity centers of the subsets form the reduced reference set. The paper compares the effectiveness of the two approaches mentioned above. Ten experiments with real data concerning remote sensing data are presented to show the superiority of the approach based on the reference set partitioning idea. ©2005 Copyright SPIE - The International Society for Optical Engineering.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||Two approaches to the sample set condensation. Experiments with remote sensing images|
|Data di pubblicazione:||1996|
|Tipologia:||4.1 Contributo in Atti di convegno|