The Distance-Weighted k-Nearest-Neighbor Rule

Among the simplest and most intuitively appealing classes of nonprobabilistic classification procedures are those that weight the evidence of nearby sample observations most heavily. More specifically, one might wish to weight the evidence of a neighbor close to an unclassified observation more heav...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on systems, man, and cybernetics man, and cybernetics, 1976-04, Vol.SMC-6 (4), p.325-327
1. Verfasser:	Dudani, Sahibsingh A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Error correction H infinity control Nearest neighbor searches Upper bound
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!