PIECEWISE-LINEAR CLASSIFIERS USING BINARY-TREE STRUCTURE AND GENETIC ALGORITHM

Citation
Bb. Chai et al., PIECEWISE-LINEAR CLASSIFIERS USING BINARY-TREE STRUCTURE AND GENETIC ALGORITHM, Pattern recognition, 29(11), 1996, pp. 1905-1917
Citations number
15
Categorie Soggetti
Computer Sciences, Special Topics","Engineering, Eletrical & Electronic","Computer Science Artificial Intelligence
Journal title
ISSN journal
00313203
Volume
29
Issue
11
Year of publication
1996
Pages
1905 - 1917
Database
ISI
SICI code
0031-3203(1996)29:11<1905:PCUBSA>2.0.ZU;2-T
Abstract
A linear decision binary tree structure is proposed in constructing pi ecewise linear classifiers with the Genetic Algorithm (GA) being shape d and employed at each nonterminal node in order to search for a linea r decision function, optimal in the sense of maximum impurity reductio n. The methodology works for both the two-class and multi-class cases. In comparison to several other well-known methods, the proposed Binar y Tree-Genetic Algorithm (BTGA) is demonstrated to produce a much lowe r cross validation misclassification rate. Finally, a modified BTGA is applied to the important pap smear cell classification. This results in a spectrum for the combination of the highest desirable sensitivity along with the lowest possible false alarm rate ranging from 27.34% s ensitivity, 0.62% false alarm rate to 97.02% sensitivity, 50.24% false alarm rate from resubstitution validation. The multiple choices offer ed by the spectrum for the sensitivity-false alarm rate combination wi ll provide the flexibility needed for the pap smear slide classificati on. Copyright (C) 1996 Pattern Recognition Society.