Work

An Empirical Study of Distance Metrics for k-Nearest Neighbor Algorithm

Year: 2015
Type: conference-paper
Abstract: This research aims at studying the performance of k-nearest neighbor classification when applying different distance measurements. In this work, we comparatively study 11 distance metrics including Euclidean, Standardized Euclidean, Mahalanobis, City block, Minkowski, Chebychev, Cosine, Correlation, Hamming, Jaccard, and Spearman. A series of experimentations has been performed on eight synthetic datasets with various kinds of distribution. The distance computations that provide highly accurate prediction consist of City block, Chebychev, Euclidean, Mahalanobis, Minkowski, and Standardize Euclidean techniques.
Language: English
Open Access status: hybrid
OpenAlex ID: W2332271625
FWCI: 3.532
Cites: 6
Cited by: 265
Related to: 10