Parameter learning from stochastic teachers and stochastic compulsive liars

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 36, Issue 4, 2006, Pages 820-834

  Oommen, B John ^a   Raghunath, Govindachari ^a   Kuipers, Benjamin ^b  

^a CARLETON UNIVERSITY   (Canada)

^b University of Texas at Austin   (United States)

Author keywords

Learning automata (LA); Pattern recognition; Statistical parameter learning; Stochastic optimization

Indexed keywords

AUTOMATA THEORY; LEARNING ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; PATTERN RECOGNITION; RANDOM PROCESSES; STATISTICAL METHODS;

LEARNING AUTOMATA; STATISTICAL PARAMETER LEARNING; STOCHASTIC OPTIMIZATION;

LEARNING SYSTEMS;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; COMPULSION; COMPUTER SIMULATION; INTERPERSONAL COMMUNICATION; METHODOLOGY; STATISTICAL MODEL; STATISTICS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPULSIVE BEHAVIOR; COMPUTER SIMULATION; MODELS, STATISTICAL; PATTERN RECOGNITION, AUTOMATED; STOCHASTIC PROCESSES; TRUTH DISCLOSURE;

EID: 33746814813     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2005.863379     Document Type: Article

References (38)

1. M. Agache, "Estimator based learning algorithms," M.S. thesis, School Comput. Sci., Carleton Univ., Ottawa, ON, Canada, 2000.
2. M. Agache and B. J. Oommen, "Generalized pursuit learning schemes: New families of continuous and discretized learning automata," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 32, no. 6, pp. 738-749, Dec. 2002.
3. M. Agache and B. J. Oommen, "Generalized TSE: A new generalized estimator-based learning automaton," in Proc. IEEE Conf. Cybernetics and Intelligent Systems (CIS), Singapore, Dec. 2004, pp. 245-251.
4. A. F. Atlassis, N. H. Loukas, and A. V. Vasilakos, "The use of learning algorithms in ATM networks call admission control problem: A methodology," Comput. Netw., vol. 34, no. 3, pp. 341-353, Sep. 2000.
5. A. F. Atlassis and A. V. Vasilakos, "The use of reinforcement learning algorithms in traffic control of high speed networks," in Advances in Computational Intelligence and Learning. Norwell, MA: Kluwer, 2002, pp. 353-369.
6. R. A. Baeza-Yates, J. C. Culberson, and G. J. E. Rawlins, "Searching with uncertainty," in Proc. Scandinavian Workshop Algorithms and Theory (SWAT), Halmstad, Sweden, 1988, pp. 176-189.
7. R. A. Baeza-Yates and R. Schott, "Parallel searching in the plane," in Proc. Int. Conf. Chilean Computer Society (IC-SCCC), Santiago, Chile, 1992, pp. 269-279.
8. J. L. Bentley and A. C.-C. Yao, "An almost optimal algorithm for unbounded searching," Inf. Process. Lett., vol. 5, no. 3, pp. 82-87, Aug. 1976.
9. J. Kabudian, M. R. Meybodi, and M. M. Homayounpour, "Applying continuous action reinforcement learning automata (CARLA) to global training of hidden Markov models," in Proc. Int. Conf. Information Technology: Coding and Computing (ITCC), Las Vegas, NV, 2004, pp. 638-642.
10. R. L. Kashyap and B. J. Oommen, "Scale preserving smoothing of polygons," IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-5, no. 6, pp. 667-671, Nov. 1983.
11. S. Lakshmivarahan, Learning Algorithms Theory and Applications. New York: Springer-Verlag, 1981.
12. J. K. Lancôt and B. J. Oommen, "Discretized estimator learning automata," IEEE Trans. Syst., Man, Cybern., vol. 22, no. 6, pp. 1473-1483, Nov./Dec. 1992.
13. M. R. Meybodi and H. Beigy, "New learning automata based algorithms for adaptation of backpropagation algorithm parameters," Int. J. Neural Syst., vol. 12, no. 1, pp. 45-67, Feb. 2002.
14. S. Misra and B. J. Oommen, "GPSPA: A new adaptive algorithm for maintaining shortest path routing trees in stochastic networks," Int. J. Commun. Syst., vol. 17, no. 10, pp. 963-984, Sep. 2004.
15. K. Najim and A. S. Poznyak, Learning Automata: Theory and Applications. Oxford, U.K.: Pergamon, 1994.
16. K. S. Narendra and M. A. L. Thathachar, Learning Automata. Englewood Cliffs, NJ: Prentice-Hall, 1989.
17. M. S. Obaidat, G. I. Papadimitriou, and A. S. Pomportsis, "Learning automata: Theory, paradigms and applications," IEEE Trans. Syst., Man, Cybern., vol. 32, no. 6, pp. 706-709, Dec. 2002.
18. M. S. Obaidat, G. I. Papadimitriou, and A. S. Pomportsis, "Efficient fast learning automata," Inf. Sci., vol. 157, no. 1-2, pp. 121-133, Dec. 2003.
19. M. S. Obaidat, G. I. Papadimitriou, A. S. Pomportsis, and H. S. Laskaridis, "Learning automata-based bus arbitration for shared-medium ATM switches," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 32, no. 6, pp. 815-820, Dec. 2002.
20. B. J. Oommen and M. Agache, "Continuous and discretized pursuit learning schemes: Various algorithms and their comparison," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 31, no. 3, pp. 277-287, Jun. 2001.
21. B. J. Oommen and E. V. de St. Croix, "Graph partitioning using learning automata," IEEE Trans. Comput., vol. 45, no. 2, pp. 195-208, Feb. 1996.
22. B. J. Oommen and T. D. Roberts, "Continuous learning automata solutions to the capacity assignment problem," IEEE Trans. Comput., vol. 49, no. 6, pp. 608-620, Jun. 2000.
23. B. J. Oommen, "Stochastic searching on the line and its applications to parameter learning in nonlinear optimization," IEEE Trans. Syst., Man, Cybern., vol. 27, no. 4, pp. 733-739, Aug. 1997.
24. B. J. Oommen and G. Raghunath, "Automata learning and intelligent tertiary searching for stochastic point location," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 28, no. 6, pp. 947-954, Dec. 1998.
25. Y. H. Pao, Adaptive Pattern Recognition and Neural Networks. Reading, MA: Addison-Wesley, 1989.
26. G. I. Papadimitriou and A. S. Pomportsis, "Learning-automata-based TDMA protocols for broadcast communication systems with bursty traffic," IEEE Commun. Lett., vol. 4, no. 3, pp. 107-109, Mar. 2000.
27. T. Pavlidis, Structural Pattern Recognition. New York: Springer-Verlag, 1977.
28. A. S. Poznyak and K. Najim, Learning Automata and Stochastic Optimization. Berlin, Germany: Springer-Verlag, 1997.
29. W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling, Numerical Recipes: The Art of Scientific Computing. Cambridge, U.K.: Cambridge Univ. Press, 1986.
30. S. S. Rao, Optimization: Theory and Applications, 2nd ed. New Delhi, India: Wiley, 1984.
31. G. Santharam, P. S. Sastry, and M. A. L. Thathachar, "Continuous action set learning automata for stochastic optimization," J. Franklin Inst., vol. 331B, no. 5, pp. 607-628, 1994.
32. Y. Sawaragi and N. Baba, "A note on the learning behavior of variable-structure stochastic automata," IEEE Trans. Syst., Man, Cybern., vol. SMC-3, no. 6, pp. 644-647, 1973.
33. F. Seredynski, "Distributed scheduling using simple learning machines," Eur. J. Oper. Res., vol. 107, no. 2, pp. 401-413, 1998.
34. M. A. L. Thathachar and P. S. Sastry, Networks of Learning Automata: Techniques for Online Stochastic Optimization. Boston, MA: Kluwer, 2003.
35. C. Unsal, P. Kachroo, and J. S. Bay, "Simulation study of multiple intelligent vehicle control using stochastic learning automata," Trans. Soc. Comput. Simul. Int., vol. 14, no. 4, pp. 193-210, Dec. 1997.
36. A. V. Vasilakos, M. P. Saltouros, A. F. Atlassis, and W. Pedrycz, "Optimizing QoS routing in hierarchical ATM networks using computational intelligence techniques," IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 33, no. 3, pp. 297-312, Aug. 2003.
37. P. D. Wasserman, Neural Computing: Theory and Practice. New York: Van Nostrand Reinhold, 1989.
38. R. J. Williams, "Simple statistical gradient-following algorithms for connectioninst reinforcement learning," Mach. Learn., vol. 8, no. 3-4, pp. 229-256, May 1992.