k-Nearest Neighbor Classification Algorithm

From GM-RKB
Revision as of 04:34, 26 September 2021 by Gmelli (talk | contribs) (Text replacement - ". ----" to ". ----")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

A k-Nearest Neighbor Classification Algorithm is a kNN algorithm that is a supervised classification algorithm that can be implemented by a kNN classification system (to solve a kNN classification task).



References

1999

  • (Zaiane, 1999) ⇒ Osmar Zaiane. (1999). “Glossary of Data Mining Terms. University of Alberta, Computing Science CMPUT-690: Principles of Knowledge Discovery in Databases.
    • Quote: Nearest Neighbour:A technique that classifies each record in a dataset based on a combination of the classes of the k record(s) most similar to it in a historical dataset (where k is greater than or equal to 1). Sometimes called a k-nearest neighbour technique.