k-Nearest Neighbors: From Global to Local

The weighted k-nearest neighbors algorithm is one of the most fundamental non-parametric methods in pattern recognition and machine learning. The question of setting the optimal number of neighbors as well as the optimal weights has received much attention throughout the years, nevertheless this pro...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2017-01
Hauptverfasser:	Anava, Oren, Levy, Kfir Y
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Data points Machine learning Pattern recognition
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!