Skip navigation
Skip navigation

Weighted K-nearest Centroid Neighbor Classification

Gou, Jianping; Du, Lan; Xiong, Taisong

Description

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]

CollectionsANU Research Publications
Date published: 2012
Type: Journal article
URI: http://hdl.handle.net/1885/67690
Source: Journal of Computer Information Systems

Download

File Description SizeFormat Image
01_Gou_Weighted_K-nearest_Centroid_2012.pdf143.88 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator