DocumentCode
2624120
Title
Using nearest neighbor learning to improve Sanger´s tree-structured algorithm
Author
Chen, Cheng-Chi
Author_Institution
Inst. of Syst. Sci., Nat. Univ. of Singapore, Kent Ridge
fYear
1991
fDate
18-21 Nov 1991
Firstpage
827
Abstract
The author identifies several different neural network models which are related to nearest neighbor learning. They include radial basis functions, sparse distributed memory, and localized receptive fields. One way to improve the neural networks´ performance is by using the cooperation of different learning algorithms. The prediction of chaotic time series is used as an example to show how nearest neighbor learning can be employed to improve Sanger´s tree-structured algorithm which predicts future values of the Mackey-Glass differential delay equation
Keywords
chaos; learning systems; neural nets; trees (mathematics); Mackey-Glass differential delay equation; Sanger´s tree-structured algorithm; chaotic time series; learning algorithms; localized receptive fields; nearest neighbor learning; neural network models; radial basis functions; sparse distributed memory; Approximation algorithms; Chaos; Computer networks; Delay effects; Function approximation; Nearest neighbor searches; Neural networks; Optical computing; Pattern classification; Prediction algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks, 1991. 1991 IEEE International Joint Conference on
Print_ISBN
0-7803-0227-3
Type
conf
DOI
10.1109/IJCNN.1991.170503
Filename
170503
Link To Document