By Topic

Test feature classifiers: performance and applications

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)
Lashkia, V. ; Dept. of Inf. & Comput. Eng., Okayama Univ. of Sci., Japan ; Aleshin, S.

In this paper, we present a class of test feature classifiers (TFCs). We discuss the properties and performance of the proposed classifiers and describe cases when a 100% recognition rate on test data can be achieved. When the number of features increases, classes having no more than a polynomial number of instances (in the number of features) are the only cases possible to process. We prove that for almost all pairs of classes with a polynomial number of instances, a 100% recognition rate on any test data can be achieved. To test the performance of the classifiers, we apply them to both artificial and real data. For the real data, we use the well known breast cancer, phoneme, and satimage databases, which are recognized to be difficult classification problems. Our experimental results show that the proposed classifiers not only have a high recognition ability but, also, the ability to achieve a 100% recognition rate in difficult classification problems

Published in:

Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on  (Volume:31 ,  Issue: 4 )