DocumentCode
467629
Title
A Neural Tree with Partial Incremental Learning Capability
Author
Su, Mu-Chun ; Lo, Hsu-Hsun
Author_Institution
Nat. Central Univ., Jhongli
Volume
1
fYear
2007
fDate
19-22 Aug. 2007
Firstpage
6
Lastpage
11
Abstract
This paper presents a new approach to constructing a neural tree with partial incremental learning capability. The proposed neural tree, called a quadratic-neuron-based neural tree (QUANT), is a tree structured neural network composed of neurons with quadratic neural-type junctions for pattern classification. The proposed QUANT integrates the advantages of decision trees and neural networks. Via a batch-mode training algorithm, the QUANT grows a neural tree containing quadratic neurons in its nodes. These quadratic neurons recursively partition the feature space into hyper-ellipsoidal-shaped sub-regions. The QUANT has the partial incremental capability so that it does not need to re-construct a new neural tree to accommodate new training data whenever new data are introduced to a trained QUANT. To demonstrate the performance of the proposed QUANT, several pattern recognition problems were tested.
Keywords
decision trees; learning (artificial intelligence); neural nets; pattern classification; decision trees; hyper-ellipsoidal-shaped subregions; partial incremental learning capability; pattern classification; quadratic-neuron-based neural tree; tree structured neural network; Decision trees; Machine learning; Neural networks; Neurons; Pattern classification; Pattern recognition; Testing; Training data; Tree data structures; Vectors; Decision tree; Incremental learning; Neural networks; Neural tree; Pattern classification;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics, 2007 International Conference on
Conference_Location
Hong Kong
Print_ISBN
978-1-4244-0973-0
Electronic_ISBN
978-1-4244-0973-0
Type
conf
DOI
10.1109/ICMLC.2007.4370106
Filename
4370106
Link To Document