Efficient pattern synthesis for nearest neighbour classifier

Agrawal, Monu and Gupta, Neha and Shreelekshmi, R and Murty, Narasimha M (2005) Efficient pattern synthesis for nearest neighbour classifier. In: Pattern Recognition, 38 (11). pp. 2200-2203.

Preview

PDF A212.pdf Download (168kB)

Abstract

Synthetic pattern generation is one of the strategies to overcome the curse of dimensionality, but it has its own drawbacks. Most of the synthetic pattern generation techniques take more time than simple classification. In this paper, the authors propose a new strategy to reduce the time and memory requirements by applying prototyping as an intermediate step in the synthetic pattern generation technique. Results show that through the proposed strategy, classification can be done much faster without compromising much in terms of classification accuracy, in fact for some cases it gives better accuracy in lesser time. The classification time and accuracy can be balanced according to available memory and computing power of a system to get the best possible results.

Item Type:	Journal Article
Publication:	Pattern Recognition
Publisher:	Pattern Recognition Society
Additional Information:	Copyright for this article belongs to Pattern Recognition Society.
Keywords:	Pattern synthesis;Prototyping;Classification;Clustering;Partitioning
Department/Centre:	Division of Electrical Sciences > Electrical Engineering Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	23 Nov 2007
Last Modified:	19 Sep 2010 04:20
URI:	http://eprints.iisc.ac.in/id/eprint/3896

Actions (login required)

View Item