Title: A pseudo nearest centroid neighbour classifier

Authors: Hongxing Ma; Jianping Gou; Xili Wang

Addresses: College of Computer Science, Shaanxi Normal University, Xi'an, Shaanxi, China; College of Electrical and Information Engineering, Beifang University of Nationalities, Yinchuan, Ningxia, China ' School of Computer Science and Telecommunication Engineering, JiangSu University, ZhenJiang, JiangSu, China ' College of Computer Science, Shaanxi Normal University, Xi'an, Shaanxi, China

Abstract: In this paper, we propose a new reliable classification approach, called the pseudo nearest centroid neighbour rule, which is based on the pseudo nearest neighbour rule (PNN) and nearest centroid neighbourhood (NCN). In the proposed PNCN, the nearest centroid neighbours rather than nearest neighbours per class are first searched by means of NCN. Then, we calculate k categorical local mean vectors corresponding to k nearest centroid neighbours, and assign a weight to each local mean vector. Using the weighted k local mean vectors for each class, PNCN designs the corresponding pseudo nearest centroid neighbour and decides the class label of the query pattern according to the closest pseudo nearest centroid neighbour among all classes. The classification performance of the proposed PNCN is evaluated on real and artificial datasets in terms of the classification accuracy. The experimental results demonstrate the effectiveness and robustness of PNCN over the competing methods in many practical classification problems.

Keywords: k-nearest neighbour rule; nearest centroid neighbourhood; pseudo nearest centroid neighbour rule; local mean vector; pattern classification.

DOI: 10.1504/IJCSE.2018.094420

International Journal of Computational Science and Engineering, 2018 Vol.17 No.1, pp.55 - 68

Received: 11 Oct 2015
Accepted: 13 Apr 2016
Published online: 03 Sep 2018 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article