KASER: knowledge amplification by structured expert randomization

In this paper and attached video, we present a third-generation expert system named Knowledge Amplification by Structured Expert Randomization (KASER) for which a patent has been filed by the U.S. Navy's SPAWAR Systems Center, San Diego, CA (SSC SD). KASER is a creative expert system. It is cap...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on cybernetics 2004-12, Vol.34 (6), p.2317-2329
Main Authors: Rubin, S.H., Murthy, S.N.J., Smith, M.H., Trajkovic, L.
Format: Article
Language:English
Subjects:
Acceleration
Algorithms
Amplification
Artificial Intelligence
Chess
Computer errors
Computer science
Computer Simulation
Cybernetics
Electronic mail
Expert Systems
Fuzzy Logic
Games
Information retrieval
knowledge amplification
Machine learning
Models, Statistical
Naval engineering
object-oriented design
Production
Radar
Random Allocation
Randomization
Software
Studies
Symmetry
User-Computer Interface
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:In this paper and attached video, we present a third-generation expert system named Knowledge Amplification by Structured Expert Randomization (KASER) for which a patent has been filed by the U.S. Navy's SPAWAR Systems Center, San Diego, CA (SSC SD). KASER is a creative expert system. It is capable of deductive, inductive, and mixed derivations. Its qualitative creativity is realized by using a tree-search mechanism. The system achieves creative reasoning by using a declarative representation of knowledge consisting of object trees and inheritance. KASER computes with words and phrases. It possesses a capability for metaphor-based explanations. This capability is useful in explaining its creative suggestions and serves to augment the capabilities provided by the explanation subsystems of conventional expert systems. KASER also exhibits an accelerated capability to learn. However, this capability depends on the particulars of the selected application domain. For example, application domains such as the game of chess exhibit a high degree of geometric symmetry. Conversely, application domains such as the game of craps played with two dice exhibit no predictable pattern, unless the dice are loaded. More generally, we say that domains whose informative content can be compressed to a significant degree without loss (or with relatively little loss) are symmetric. Incompressible domains are said to be asymmetric or random. The measure of symmetry plus the measure of randomness must always sum to unity.
ISSN:1083-4419
2168-2267
1941-0492
2168-2275
DOI:10.1109/TSMCB.2004.835081