By Topic

Reducing Computational Complexity in k-NN based Adaptive Classifiers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Alippi, C. ; Politecnico di Milano, Milan ; Roveri, M.

Integrating new information in intelligent measurement systems during their operational life is always profitable from the accuracy point of view but it generally induces an increment in the complexity of the classifier. Adaptive classifiers, which provide adaptive mechanisms to update their knowledge base over time, are able to exploit fresh information to improve accuracy but, traditionally, do not consider complexity issues. In this paper we propose a design solution for adaptive classifiers able to reduce the computational complexity and the memory requirements of k-NN classifiers by including condensing editing techniques. Moreover, we propose a novel approach for estimating the incoming innovation content which allows us for not including redundant or superfluous information (thus minimizing the knowledge base size).

Published in:

Computational Intelligence for Measurement Systems and Applications, 2007. CIMSA 2007. IEEE International Conference on

Date of Conference:

27-29 June 2007