Title
A relative reward-strength algorithm for the hierarchical structure learning automata operating in the general nonstationary multiteacher environment.
Abstract
A new learning algorithm for the hierarchical structure learning automata (HSLA) operating in the nonstationary multiteacher environment (NME) is proposed. The proposed algorithm is derived by extending the original relative reward-strength algorithm to be utilized in the HSLA operating in the general NME. It is shown that the proposed algorithm ensures convergence with probability 1 to the optimal path under a certain type of the NME. Several computer-simulation results, which have been carried out in order to compare the relative performance of the proposed algorithm in some NMEs against those of the two of the fastest algorithms today, confirm the effectiveness of the proposed algorithm.
Year
DOI
Venue
2006
10.1109/TSMCB.2005.862489
IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society
Keywords
DocType
Volume
computer-simulation result,general nonstationary multiteacher environment,relative performance,hsla operating,hierarchical structure,general nme,fastest algorithm,proposed algorithm,original relative reward-strength algorithm,certain type,automata operating,new learning algorithm,probability,convergence,computer simulation
Journal
36
Issue
ISSN
Citations 
4
1083-4419
3
PageRank 
References 
Authors
0.45
21
2
Name
Order
Citations
PageRank
Norio Baba113469.58
Yoshio Mogami230.45