Learning Optimal Conjunctive Concepts through a Team of Stochastic Automata

IEEE Transactions on Systems, Man and Cybernetics

Volumn 23, Issue 4, 1993, Pages 1175-1184

  Sastry, P S ^a   Rajaraman, K ^a   Ranjan, S R ^b  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b CENTRE FOR DEVELOPMENT OF ADVANCED COMPUTING   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; AUTOMATA THEORY; CONVERGENCE OF NUMERICAL METHODS; DISTRIBUTED COMPUTER SYSTEMS; FORMAL LOGIC; NEURAL NETWORKS; OPTIMAL SYSTEMS; PARALLEL PROCESSING SYSTEMS; PROBABILITY; STOCHASTIC CONTROL SYSTEMS;

DISJUNCTIVE NORMAL FORM; LEARNING OPTIMAL CONJUNCTIVE CONCEPTS; PARALLEL DISTRIBUTED NETWORK; STOCHASTIC AUTOMATA;

LEARNING SYSTEMS;

EID: 0027632405     PISSN: 00189472     EISSN: 21682909     Source Type: Journal    
DOI: 10.1109/21.247899     Document Type: Article

References (18)

1. E. B. Hunt, Concept Learning: An Information Processing Problem. New York: Wiley, 1973.
2. Angluin and Smith, “Inductive inference: Theory and methods,” ACM Comput. Surveys, vol. 15, no. 3, pp. 237-270, Sept. 1983.
3. R. S. Michalski et al., Eds., Machine Learning: An Artificial Intelligence Approach. San Francisco: Tiogo, 1983.
4. G. E. Hinton, “Connectionist learning procedures,” Artificial Intell, vol. 40, pp. 185-234, 1989.
5. L. G. Valiant, “A theory of the learnable,” Commun. ACM, vol. 27, pp. 1134-1142, 1984.
6. R. S. Michalski, “Pattern recognition as rule-guided inductive inference,” IEEE Trans. Patt. Analy. Machine Intell., vol. PAMI-2, no. 4, pp. 349-361, July 1980.
7. K. S. Narendra and M. A. L. Thathachar, Learning Automata: An Introduction. Englewood Cliffs, NJ: Prentice-Hall, 1989.
8. K. S. Narendra and R. M. Wheeler, “An N-Player sequential stochastic game with identical pay-offs,” IEEE Trans. Syst. Man Cybern., vol. SMC-3, pp. 1154-1158, Nov. 1983.
9. J. S. Quinlan, “The effect of noise on concept learning,” in Machine Learning: An Artificial Intelligence Approach. (R. S. Michalski, et al., Eds.) San Francisco: Morgan Kaufman, 1986, pp. 149-166, ch. 6, vol. 2.
10. R. Rada and R. Forsyth, Machine Learning: Applications to Expert Systems and Information Retrieval. Chichester, UK: Ellis Horwood, 1986.
11. S. R. Ranjan, “Stochastic automata models for concept learning,” M.S. Thesis, Dept. Elec. Engg., Indian Inst. Sci., Bangalore, India, Mar. 1989.
12. S. R. Ranjan and P. S. Sastry, “A parallel algorithm for concept learning,” in Frontiers in Parallel Computing, V. P. Bhatkar et al. New Delhi: Narosa, 1991, pp. 349-358.
13. A. G. Barto, “Learning by statistical cooperation of self-interested Neuron-like computing elements,” COINS Tech. Rept., Dept. of Comput. Inform. Sci., Univ. Massachusetts, Amherst, Apr. 1985.
14. R. O. Duda and P. E. Hart, Pattern Classification and Scene Analysis. New York: Wiley, 1973.
15. M. A. L. Thathachar and P. S. Sastry, “Learning optimal discriminant functions through a co-operating team of automata,” IEEE Trans. Syst., Man, Cybern., vol. SMC-17, no. 1, pp. 73-85, Jan.-Feb. 1987.
16. K. Rajaraman, “Learning automata models for concept learning,” M.E. Thesis, Dept. of Elect. Eng., Indian Inst., of Sci., Bangalore, India, Jan. 1991.
17. S. Mukhopadhyay, “Group behavior of learning automata,” M.E. Thesis, Dept. of Elect. Eng., Indian Inst. of Sci., Bangalore, India, Jan. 1987.
18. D. Haussler, “Quantifying inductive bias: AI learning algorithms and Valiant's learning framework,” Artificial Intell., vol. 36, pp. 177-221, 1988.