Nearest neighbour group-based classification

Samsudin, Noor A. and Bradley, Andrew P. (2010) Nearest neighbour group-based classification. Pattern Recognition, 43. pp. 3458-3467.

Text J5061_6e2744f4a2e5bf643b35fa74d280ad24.pdf Restricted to Registered users only Download (695kB) | Request a copy

Abstract

The purpose of group-based classification (GBC) is to determine the class label for a set of test samples, utilising the prior knowledge that the samples belong to same, but unknown class. This can be seen as a simplification of the well studied, but computationally complex, non-sequential compound classifica�tion problem. In this paper, we extend three variants of the nearest neighbour algorithm to develop a number of non-parametric group-based classification techniques. The performances of the proposed techniques are then evaluated on both synthetic and real-world data sets and their performance compared with techniques that label test samples individually. The results show that, while no one algorithm clearly outperforms all others on all data sets, the proposed group-based classification techniques have the potential to outperform the individual-based techniques, especially as the (group) size of the test set increases. In addition, it is shown that algorithms that pool information from the whole test set perform better than two-stage approaches that undertake a vote based on the class labels of individual test samples.

Item Type:	Article
Uncontrolled Keywords:	Group-based classification; nearest neighbour; compound classification.
Subjects:	T Technology > T Technology (General)
Divisions:	Others Institution
Depositing User:	Mr. Abdul Rahim Mat Radzuan
Date Deposited:	17 Oct 2022 06:16
Last Modified:	17 Oct 2022 06:16
URI:	http://eprints.uthm.edu.my/id/eprint/7853

Actions (login required)

View Item