AN ALGORITHM FOR COMPUTING TYPICAL TESTORS BASED ON ELIMINATION OF GAPS AND REDUCTION OF COLUMNS
Authors:
- 18 December 2013
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Pattern Recognition and Artificial Intelligence
- Vol. 27 (08)
Abstract
Typical testors are useful tools for feature selection and for determining feature relevance in supervised classification problems. Nowadays, computing all typical testors of a training matrix is very expensive; all reported algorithms have exponential complexity depending on the number of columns in the matrix. In this paper, we introduce the faster algorithm BR (Boolean Recursive), called fast-BR algorithm, that is based on elimination of gaps and reduction of columns. Fast-BR algorithm is designed to generate all typical testors from a training matrix, requiring a reduced number of operations. Experimental results using this fast implementation and the comparison with other state-of-the-art related algorithms that generate typical testors are presented.Keywords
This publication has 8 references indexed in Scilit:
- Hardware–software platform for computing irreducible testorsExpert Systems with Applications, 2012
- A Fast Implementation for the Typical Testor Property Identification Based on an Accumulative Binary TupleInternational Journal of Computational Intelligence Systems, 2012
- Pattern recognition with mixed and incomplete dataPattern Recognition and Image Analysis, 2008
- Construction of all non-reducible descriptorsPattern Recognition, 2004
- Generalized non-reducible descriptorsPattern Recognition, 2004
- An overview of the evolution of the concept of testorPattern Recognition, 2001
- The logical combinatorial approach to pattern recognition, an overview through selected worksPattern Recognition, 2001
- A new approach to differential diagnosis of diseasesInternational Journal of Bio-Medical Computing, 1996