A self-organizing binary decision tree for incrementally defined rule-based systems

An adaptive self-organizing concurrent system (ASOCS) model is presented for massively parallel processing of incrementally defined rule-based systems in such areas as adaptive logic, robotics, logical inference, and dynamic control. An ASOCS is an adaptive network composed of many simple computing...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on systems, man, and cybernetics man, and cybernetics, 1991-09, Vol.21 (5), p.1231-1238
Main Authors: Martinez, T.R., Campbell, D.M.
Format: Article
Language:English
Subjects:
Adaptive control
Adaptive systems
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer networks
Computer science
control theory
systems
Data processing
Decision trees
Exact sciences and technology
Knowledge based systems
Logic
Parallel processing
Parallel robots
Programmable control
Theoretical computing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An adaptive self-organizing concurrent system (ASOCS) model is presented for massively parallel processing of incrementally defined rule-based systems in such areas as adaptive logic, robotics, logical inference, and dynamic control. An ASOCS is an adaptive network composed of many simple computing elements operating asynchronously and in parallel. The authors focus on adaptive algorithm 3 (AA3) and detail its architecture and learning algorithm. It has advantages over previous ASOCS models in simplicity, implementability, and cost. An ASOCS can operate in either a data processing mode or a learning mode. During the data processing mode, an ASOCS acts as a parallel hardware circuit. In learning mode, rules expressed as Boolean conjunctions are incrementally presented to the ASOCS. All ASOCS learning algorithms incorporate a new rule in a distributed fashion in a short, bounded time.< >
ISSN:0018-9472
2168-2909
DOI:10.1109/21.120075