Decomposition of high dimensional pattern spaces for hierarchical classification. (English) Zbl 1274.68329

Summary: In this paper we present a novel approach to decomposing high dimensional spaces using a multiobjective genetic algorithm for identifying (near-)optimal subspaces for hierarchical classification. This strategy of pre-processing the data and explicitly optimising the partitions for subsequent mapping onto a hierarchical classifier is found to both reduce the learning complexity and the classification time with no degradation in overall classification error rate. Results of partitioning pattern spaces are presented and compared with various algorithms.


68T05 Learning and adaptive systems in artificial intelligence
68T10 Pattern recognition, speech recognition
Full Text: Link


[1] Friedman J. H.: A recursive partitioning decision role for nonparametric classification. IEEE Trans. Comput. 26 (1997), 4, 404-408 · Zbl 0403.62036
[2] Henrichon E. G., Fu K. S.: A nonparametric partitioning procedure for pattern classification. IEEE Trans. Comput. 18 (1969), 7, 614-624 · Zbl 0179.23004
[3] Kanal L. N.: Problem-solving models and search strategies for pattern recognition, IEEE Trans. Pattern Analysis Machine Intelligence 1 (1979), 2, 193-201 · Zbl 0418.68078
[4] Kumar R.: Feature Selection, Representation and Classification in Vision. Ph.D. Thesis, Dept. Electronic and Electrical Engineering, University of Sheffield, 1997
[5] al C. C. Taylor et: Dataset descriptions and results. Machine Learning, Neural and Statistical Classification (D. Michie, D. J. Spiegelhalter and C. C. Taylor, Ellis Horwood, London 1994, pp. 131-174
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.