Hierarchical Discretized Pursuit Nonlinear Learning Automata with Rapid Convergence and High Accuracy
Issue No. 04 - August (1994 vol. 6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.298184
<p>A new absorbing multiaction learning automaton that is epsilon-optimal is introduced. It is a hierarchical discretized pursuit nonlinear learning automaton that uses a new algorithm for positioning the actions on the leaves of the hierarchical tree. The proposed automaton achieves the highest performance (speed of convergence, central processing unit (CPU) time, and accuracy) among all the absorbing learning automata reported in the literature up to now. Extensive simulation results indicate the superiority of the proposed scheme. Furthermore, it is proved that the proposed automaton is epsilon-optimal in every stationary stochastic environment.</p>
finite automata; unsupervised learning; nonlinear systems; convergence; hierarchical systems; rapid convergence; absorbing multiaction learning automaton; discretized pursuit nonlinear learning automata; hierarchical tree; stationary stochastic environment; pursuit learning; nonlinear output function; epsilon-optimal learning; positioning algorithm
G. Papadimitriou, "Hierarchical Discretized Pursuit Nonlinear Learning Automata with Rapid Convergence and High Accuracy," in IEEE Transactions on Knowledge & Data Engineering, vol. 6, no. , pp. 654-659, 1994.