By Topic

Subsymbolic inductive learning framework for large-scale data processing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
I. P. Chorbadjiev ; Brainware GmbH, Berlin, West Germany ; J. Stender

Recent years have witnessed the development of a large variety of Inductive methods for data analysis. This can be attributed to the fact that the decision tree-the most common representation of Inductive algorithms-provides a hierarchical framework for sequential decision making. This is a framework which non-professionals find easy to use and understand. Furthermore, it has been proved that Inductive Learning performs as well as, and indeed often better than Discriminant analysis and Multi Logic/Probit analysis. It has been also pointed out that some problems such as protein structure prediction, which are unsolvable with statistical methods can be approached quite successfully with Inductive methods. The authors aim in the paper is to express their experience in Inductive Learning in a strict form. They call this approach the subsymbolic Inductive Learning Framework, because it explores very primitive syntactic objects, and builds from them compound knowledge structures

Published in:

Symbols Versus Neurons, IEE Colloquium on

Date of Conference:

1 Oct 1990