Share Email Print

Proceedings Paper

Learning tree: a new concept in learning
Author(s): Tomas Landelius; Hans Knutsson
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

In this paper learning is considered to be the bootstrapping procedure where fragmented past experience of what to do when performing well is used for generation of new responses adding more information to the system about the environment. The gained knowledge is represented by a behavior probability density function which is decomposed into a number of normal distributions using a binary tree. This tree structure is built by storing highly reinforced stimuli-response combinations, decisions, and calculating their mean decision vector and covariance matrix. Thereafter the decision space is divided, through the mean vector, into two halves along the direction of maximal data variation. The mean vector and the covariance matrix are stored in the tree node and the procedure is repeated recursively for each of the two halves of the decision space forming a binary tree with mean vectors and covariance matrices in its nodes. The tree is the systems guide to response generation. Given a stimuli the system searches for decisions likely to give a high reinforcement.

Paper Details

Date Published: 1 September 1993
PDF: 12 pages
Proc. SPIE 1962, Adaptive and Learning Systems II, (1 September 1993); doi: 10.1117/12.150577
Show Author Affiliations
Tomas Landelius, Linkoping Univ. (Sweden)
Hans Knutsson, Linkoping Univ. (Sweden)

Published in SPIE Proceedings Vol. 1962:
Adaptive and Learning Systems II
Firooz A. Sadjadi, Editor(s)

© SPIE. Terms of Use
Back to Top