DocumentCode
2300252
Title
Nonoverlapped trees of probabilistic logic neurons
Author
Kan, W.K. ; Wong, K.H. ; Law, H.M.
Author_Institution
Dept. of Comput. Sci., Chinese Univ. of Hong Kong, Shatin, Hong Kong
fYear
1990
fDate
24-27 Sep 1990
Firstpage
37
Abstract
The working principles of nonoverlapped trees of probabilistic logic neurons (NOTPLN) are discussed. Three learning algorithms for NOTPLN are described. Simulation experiments are used to demonstrate that NOTPLN is insensitive to noise and is able to generalize the rules behind the training set. In this simulation, NOTPLN is trained with a set of road scenes as the input pattern and the corresponding actions for the driver as the output pattern. A conflict reduction algorithm is used. The road scene is modeled as one dimension. It is a horizontal line cut across the road and the pavement at both sides. The set of training patterns is shown
Keywords
learning systems; neural nets; trees (mathematics); conflict reduction algorithm; driver; learning algorithms; nonoverlapped trees; probabilistic logic neurons; road scenes; training set; Buffer storage; Computational modeling; Computer science; Neural networks; Neurons; Probabilistic logic; Random access memory; Read-write memory; Table lookup;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Communication Systems, 1990. IEEE TENCON'90., 1990 IEEE Region 10 Conference on
Print_ISBN
0-87942-556-3
Type
conf
DOI
10.1109/TENCON.1990.152561
Filename
152561
Link To Document