ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Overlap pattern synthesis with an efficient nearest neighbor classifier

Viswanath, P and Murty, Narasimha M and Bhatnagar, Shalabh (2005) Overlap pattern synthesis with an efficient nearest neighbor classifier. In: Pattern Recognition, 38 (8). pp. 1187-1195.

[img]
Preview
PDF
A78.pdf

Download (118Kb)

Abstract

Nearest neighbor (NN) classifier is the most popular non-parametric classifier. It is a simple classifier with no design phase and shows good performance. Important factors affecting the efficiency and performance of NN classifier are (i) memory required to store the training set, (ii) classification time required to search the nearest neighbor of a given test pattern, and (iii) due to the curse of dimensionality the number of training patterns needed by it to achieve a given classification accuracy becomes prohibitively large when the dimensionality of the data is high. In this paper, the authors propose novel techniques to improve the performance of NN classifier and at the same time to reduce its computational burden. These techniques are broadly based on: (i) overlap based pattern synthesis which can generate a larger number of artificial patterns than the number of input patterns and thus can reduce the curse of dimensionality effect, (ii) a compact representation of the given set of training patterns called over lappattern graph (OLP-graph) which can be incrementally built by scanning the training set only once and (iii) an efficient NN classifier called OLP-NNC which directly works with OLP-graph and does implicit overlap based pattern synthesis. A comparison based on experimental results is given between some of the relevant classifiers. The proposed schemes are suitable for applications dealing with large and high dimensional datasets like those in data mining.

Item Type: Journal Article
Additional Information: Copyright for this article belongs to Pattern Recognition Society.
Keywords: Nearest neighbor classifier;Pattern synthesis;Compact representation;Data mining
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 22 Nov 2007
Last Modified: 19 Sep 2010 04:19
URI: http://eprints.iisc.ernet.in/id/eprint/3330

Actions (login required)

View Item View Item