Model reduction of neural network trees based on dimensionality reduction

Authors:
Hirotomo Hayashi;Qiangfu Zhao
Affiliations:
Department of Computer and Information Systems, The University of Aizu, Aizuwakamatsu, Japan;Department of Computer and Information Systems, The University of Aizu, Aizuwakamatsu, Japan
Venue:
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Year:
2009

Citing 5
Cited 1

The cascade-correlation learning architecture

Advances in neural information processing systems 2
Optimal brain damage

Advances in neural information processing systems 2
C4.5: programs for machine learning

C4.5: programs for machine learning
Pattern Classification (2nd Edition)

Pattern Classification (2nd Edition)
A system for induction of oblique decision trees

Journal of Artificial Intelligence Research

Induction of compact neural network trees through centroid based dimensionality reduction

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Neural network tree (NNTree) is a hybrid model for machine learning. Compared with single model fully connected neural networks, NNTrees are more suitable for structural learning, and faster for decision making. Recently, we proposed an efficient algorithm for inducing the NNTrees based on a heuristic grouping strategy. In this paper, we try to induce smaller NNTrees based on dimensionality reduction. The goal is to induce NNTrees that are compact enough to be implemented in a VLSI chip. Two methods are investigated for dimensionality reduction. One is the principal component analysis (PCA), and another is linear discriminant analysis (LDA). We conducted experiments on several public databases, and found that the NNTree obtained after dimensionality reduction usually has less nodes and much less parameters, while the performance is comparable with the NNTree obtained without dimensionality reduction.