Posterior probability convergence of k-NN classification and K-means clustering

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Centroid based clustering methods, such as K-Means, form Voronoi cells whose radii are inversely proportional to number of clusters, K, and the expectation of posterior probability distribution in the closest cluster is related to that of a k-Nearest Neighbor Classifier (k-NN) due to the Law of Large Numbers. The aim of this study is to examine the relationship of these two seemingly different concepts of clustering and classification, more specifically, the relationship between k of k-NN and K of K-Means. One specific application area of this correspondence is local learning. The study provides experimental convergence evidence and complexity analysis to address the relative advantages of two methods in local learning applications. © 2013 Springer-Verlag London.

Cite

CITATION STYLE

APA

Kaya, H., Kurşun, O., & Gürgen, F. (2013). Posterior probability convergence of k-NN classification and K-means clustering. In Computer and Information Sciences III - 27th International Symposium on Computer and Information Sciences, ISCIS 2012 (pp. 171–179). Kluwer Academic Publishers. https://doi.org/10.1007/978-1-4471-4594-3_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free