Alternative method for the connectionist learning of k-DNF expressions

Thomas Bitterman

doi:10.1117/12.140102

1 July 1992 Alternative method for the connectionist learning of k-DNF expressions

Thomas Bitterman

Proceedings Volume 1710, Science of Artificial Neural Networks; (1992) https://doi.org/10.1117/12.140102
Event: Aerospace Sensing, 1992, Orlando, FL, United States

Abstract

We show that the extremely long learning times imposed upon connectionist systems by the use of general learning methods such as back propagation and simulated annealing can be drastically shortened by the use of methods geared toward the problem at hand. In particular, the learning of k-DNF expressions is analyzed and a new, more efficient, algorithm is proposed.

Citation Download Citation

Thomas Bitterman "Alternative method for the connectionist learning of k-DNF expressions", Proc. SPIE 1710, Science of Artificial Neural Networks, (1 July 1992); https://doi.org/10.1117/12.140102

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available