TY - JOUR
T1 - Constructing low-order discriminant neural networks using statistical feature selection
AU - Henderson, Eric K.
AU - Martinez, Tony R.
PY - 2007
Y1 - 2007
N2 - The selection of relevant inputs and determining an appropriate network topology are two critical issues faced when applying neural networks to classification problems. This paper presents an algorithm called Pair Attribute Learning (PAL) for addressing both input selection and the determination of network topology. The PAL algorithm uses a preprocessing stage to search for features derived from pairs of training instances. A statistical rank is used to select a good set of features, and these features are then used to drive the construction of a single hidden layer neural network. Only inputs relevant within the context of a feature are used in constructing the network. This results in a sparsely connected hidden layer and lower-order discriminants. The results on nine learning problems demonstrate that on average PAL-constructed networks are 70% less complex than networks built using other constructive techniques, without a significant loss of predictive accuracy. In addition, the PAL algorithm does not use iterative construction or suffer from bias mismatch. Because it addresses both input selection and network topology, the PAL algorithm provides an end-to-end solution for applying neural networks to classification problems.
AB - The selection of relevant inputs and determining an appropriate network topology are two critical issues faced when applying neural networks to classification problems. This paper presents an algorithm called Pair Attribute Learning (PAL) for addressing both input selection and the determination of network topology. The PAL algorithm uses a preprocessing stage to search for features derived from pairs of training instances. A statistical rank is used to select a good set of features, and these features are then used to drive the construction of a single hidden layer neural network. Only inputs relevant within the context of a feature are used in constructing the network. This results in a sparsely connected hidden layer and lower-order discriminants. The results on nine learning problems demonstrate that on average PAL-constructed networks are 70% less complex than networks built using other constructive techniques, without a significant loss of predictive accuracy. In addition, the PAL algorithm does not use iterative construction or suffer from bias mismatch. Because it addresses both input selection and network topology, the PAL algorithm provides an end-to-end solution for applying neural networks to classification problems.
KW - Architecture selection
KW - Feature selection
KW - Machine learning
KW - Network construction
KW - Neural networks
UR - http://www.scopus.com/inward/record.url?scp=34249890244&partnerID=8YFLogxK
U2 - 10.1515/JISYS.2007.16.1.27
DO - 10.1515/JISYS.2007.16.1.27
M3 - Article
AN - SCOPUS:34249890244
SN - 0334-1860
VL - 16
SP - 27
EP - 56
JO - Journal of Intelligent Systems
JF - Journal of Intelligent Systems
IS - 1
ER -