|
|
Автор: Jesse Russel
Год: 2012
Издание:
Книга по Требованию
Страниц: 100
ISBN: 9785513913382
High Quality Content by WIKIPEDIA articles! In pattern recognition, the k-nearest neighbor algorithm (k-NN) is a method for classifying objects based on closest training examples in the feature space. k-NN is a type of instance-based learning, or lazy learning where the function is only approximated locally and all computation is deferred until classification. The k-nearest neighbor algorithm is amongst the simplest of all machine learning algorithms: an object is classified by a majority vote of its neighbors, with the object being assigned to the class most common amongst its k nearest neighbors (k is a positive integer, typically small). If k = 1, then the object is simply assigned to the class of its nearest neighbor. Данное издание представляет собой компиляцию сведений, находящихся в свободном доступе в среде Интернет в целом, и в информационном сетевом ресурсе "Википедия" в частности. Собранная по частотным запросам указанной тематики, данная компиляция построена по принципу...
|
|
Jesse RusselK-nearest neighbor algorithm
Jesse RussellNearest-neighbor chain algorithm
Gregory ShakhnarovichNearest–Neighbor Methods in Learning and Vision