By Topic

Learning optimal conjunctive concepts through a team of stochastic automata

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 $13
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

3 Author(s)
P. S. Sastry ; Dept. of Electr. Eng., Indian Inst. of Sci., Bangalore, India ; K. Rajaraman ; S. R. Ranjan

The problem of learning conjunctive concepts from a series of positive and negative examples of the concept is considered. Employing a probabilistic structure on the domain, the goal of such inductive learning is precisely characterized. A parallel distributed stochastic algorithm is presented. It is proved that the algorithm will converge to the concept description with maximum probability of correct classification in the presence of up to 50% unbiased noise. A novel neural network structure that implements the learning algorithm is proposed. Through empirical studies it is seen that the algorithm is quite efficient for learning conjunctive concepts

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:23 ,  Issue: 4 )