Nearest Neighbor Algorithm
From GM-RKB
A nearest neighbor algorithm is a search algorithm that locates the nearest neighbor according to some distance function.
- Context:
- It can be:
- a Nearest Neighbor Search Algorithm, to solve a Nearest Neighbor Search Task.
- a Nearest Neighbor Classification Algorithm, to solve a Supervised Classification Task.
- a Nearest Neighbor Regression Algorithm, to solve a Supervised Regression Task.
- It can be used by an Instance-based Learning Algorithm.
- It can be:
- Example(s):
- See: Case-based Reasoning Algorithm, Neighbor Relationship.
References
2011
- (Keogh, 2011b) ⇒ Eamonn Keogh. (2011). "Nearest Neighbor." In: (Sammut & Webb, 2011) p.714
2009
- (Wikipedia, 2009) ⇒ http://en.wikipedia.org/wiki/Nearest_neighbour_algorithm
- The nearest neighbour algorithm was one of the first algorithms used to determine a solution to the travelling salesman problem. It quickly yields a short tour, but usually not the optimal one.
- (Hastie et al., 2009) ⇒ Trevor Hastie, Robert Tibshirani, and Jerome H. Friedman. (2009). “The Elements of Statistical Learning: Data Mining, Inference, and Prediction; 2nd edition." Springer-Verlag. ISBN:0387848576
2006
- (Zezula et al., 2006) ⇒ Pavel Zezula, Giuseppe Amato, Vlastislav Dohnal, and Michal Batko. (2006). “Similarity Search: The Metric Space Approach. Springer, Advances in Database Systems.
1997
- (Mitchell, 1997) ⇒ Tom M. Mitchell. (1997). "Machine Learning." McGraw-Hill.
- QUOTE: Section 8.6 Remarks on Lazy and Eager Learning: In this chapter we considered three lazy learning methods: the k-'Nearest Neighbor algorithm, locally weighted regression, and case-based reasoning.
1973
- (Duda & Hart, 1973) ⇒ Richard O. Duda, and Peter E. Hart. (1973). "Pattern Classification and Scene Analysis." John Wiley & Sons, New York, NY.