PRINCIPAL FEATURE CLASSIFICATION

Authors
Citation
Q. Li et Dw. Tufts, PRINCIPAL FEATURE CLASSIFICATION, IEEE transactions on neural networks, 8(1), 1997, pp. 155-160
Citations number
16
Categorie Soggetti
Computer Application, Chemistry & Engineering","Engineering, Eletrical & Electronic","Computer Science Artificial Intelligence","Computer Science Hardware & Architecture","Computer Science Theory & Methods
ISSN journal
10459227
Volume
8
Issue
1
Year of publication
1997
Pages
155 - 160
Database
ISI
SICI code
1045-9227(1997)8:1<155:PFC>2.0.ZU;2-M
Abstract
The concept, structures, and algorithms of principal feature classific ation (PFC) are presented in this paper. PFC is intended to solve comp lex classification problems with large data sets. A PFC network is des igned by sequentially finding principal features and removing training data which has already been correctly classified. PFC combines advant ages of statistical pattern recognition, decision trees, and artificia l neural networks (ANN's) and provides fast learning with good perform ance and a simple network structure. For the real-world applications o f this paper, PFC provides better performance than conventional statis tical pattern recognition, avoids the long training times of backpropa gation and other gradient-decent algorithms for ANN's, and provides a low-complexity structure for realization.