Weighted K-nearest Centroid Neighbor Classification
The k-Nearest Centroid Neighbor rule (KNCN), as an extension of the k-Nearest Neighbor rule (KNN), is one of the promising algorithms in pattern classification. In this article, we take into consideration the proximity and spatial distribution of the neighbors by means of nearest centroid neighborhood for a query pattern, and introduce two weighted voting schemes for KNCN. Experimental results show that the proposed classifiers are effective algorithms, and obtain much improvement over the...[Show more]
|Collections||ANU Research Publications|
|Source:||Journal of Computer Information Systems|
|01_Gou_Weighted_K-nearest_Centroid_2012.pdf||143.88 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.