Stochastic Learning-based Weak Estimation and Its Applications

Although the field of Artificial Intelligence (AI) has been researched for more than five decades, researchers, scientists and practitioners are constantly seeking superior methods that are applicable for increasingly difficult problems. In this chapter, our aim is to consider knowledge-based novel and intelligent cybernetic approaches for problems in which the environment (or medium) is time-varying. While problems of this sort can be approached from various perspectives, including those that appropriately model the time-varying nature of the environment, in this chapter, we shall concentrate on using new estimation or “training” methods. The new methods that we propose are based on the principles of stochastic learning, and are referred to as the Stochastic Learning Weak Estimators (SLWE). An empirical analysis on synthetic data shows the advantages of the scheme for non-stationary distributions, which is where we claim to advance the state-of-the-art. We also examine how these new methods can be applicable to learning and intelligent systems, and to Pattern Recognition (PR). The chapter briefly reports conclusive results that demonstrate the superiority of the SLWE in two applications, namely in PR and data compression. The application in PR involves artificial data and real-life news reports from the Canadian Broadcasting Corporation (CBC). We also demonstrate its applicabilty in data compression, where the underlying distribution of the files being compressed is, again, modeled as being nonstationary. The superiority of the SLWE in both these cases is demonstrated. DOI: 10.4018/978-1-61692-811-7.ch001

[1]  B. John Oommen,et al.  Continuous and discretized pursuit learning schemes: various algorithms and their comparison , 2001, IEEE Trans. Syst. Man Cybern. Part B.

[2]  R. Nigel Horspool,et al.  Algorithms for Adaptive Huffman Codes , 1984, Inf. Process. Lett..

[3]  Erik Ordentlich,et al.  On delayed prediction of individual sequences , 2002, IEEE Trans. Inf. Theory.

[4]  Georgios I. Papadimitriou A New Approach to the Design of Reinforcement Schemes for Learning Automata: Stochastic Estimator Learning Algorithms , 1994, IEEE Trans. Knowl. Data Eng..

[5]  Georgios I. Papadimitriou Hierarchical Discretized Pursuit Nonlinear Learning Automata with Rapid Convergence and High Accuracy , 1994, IEEE Trans. Knowl. Data Eng..

[6]  Sanjeev R. Kulkarni,et al.  Universal lossless source coding with the Burrows Wheeler Transform , 2002, IEEE Trans. Inf. Theory.

[7]  Mario Vento,et al.  A Multi-expert Approach for Shot Classification in News Videos , 2004, ICIAR.

[8]  B.J. Oommen,et al.  Stochastic Automata-Based Estimators for Adaptively Compressing Files With Nonstationary Distributions , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[9]  B. Ray,et al.  Bayesian methods for change‐point detection in long‐range dependent processes , 2002 .

[10]  B OommenJohn,et al.  Advances in data compression and pattern recognition , 2002 .

[11]  Zainal Abidin Mohamed,et al.  Opening the Black Box of Leadership in the Successful Development of Local E-Government Initiative in a Developing Country , 2011, InnovaInt. J. Actor Netw. Theory Technol. Innov..

[12]  Robert G. Gallager,et al.  Variations on a theme by Huffman , 1978, IEEE Trans. Inf. Theory.

[13]  B. J. Oommen,et al.  Greedy adaptive Fano coding , 2002, Proceedings, IEEE Aerospace Conference.

[14]  Kanagasabai Rajaraman,et al.  Finite time analysis of the pursuit algorithm for learning automata , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[15]  B. Johnoommen Absorbing and Ergodic Discretized Two-Action Learning Automata , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[16]  Kalle Lyytinen,et al.  Desituating Context in Ubiquitous Computing: Exploring Strategies for the Use of Remote Diagnostic Systems for Maintenance Work , 2010, InnovaInt. J. Actor Netw. Theory Technol. Innov..

[17]  Arthur Tatnall Social and Professional Applications of Actor-Network Theory for Technology Development , 2012 .

[18]  Philippe Jacquet,et al.  A universal predictor based on pattern matching , 2002, IEEE Trans. Inf. Theory.

[19]  Edit Gombay,et al.  Sequential Change-Point Detection and Estimation , 2003 .

[20]  Ralf Herbrich,et al.  Learning Kernel Classifiers: Theory and Algorithms , 2001 .

[21]  B. John Oommen,et al.  Discretized estimator learning automata , 1992, IEEE Trans. Syst. Man Cybern..

[22]  B. John Oommen,et al.  A nearly-optimal Fano-based coding algorithm , 2004, Inf. Process. Manag..

[23]  M. Subrahmanyam,et al.  Multivariate Binomial Approximations for Asset Prices with Non-Stationary Variance and Covariance Characteristics , 1995 .

[24]  B.J. Oommen,et al.  Ε-optimal Discretized Linear Reward-penalty Learning Automata , 1988, IEEE Trans. Syst. Man Cybern..

[25]  Jun Muramatsu On the performance of recency-rank and block-sorting universal lossless data compression algorithms , 2002, IEEE Trans. Inf. Theory.

[26]  B. John Oommen,et al.  Stochastic learning-based weak estimation of multinomial random variables and its applications to pattern recognition in non-stationary environments , 2006, Pattern Recognit..

[27]  B. John Oommen,et al.  A New Family of Weak Estimators for Training in Non-stationary Distributions , 2004, SSPR/SPR.

[28]  Michael Baron,et al.  Consistent Estimation of Early and Frequent Change Points , 2003 .

[29]  B. John Oommen,et al.  Discretized pursuit learning automata , 1990, IEEE Trans. Syst. Man Cybern..

[30]  En-Hui Yang,et al.  Grammar-based codes: A new class of universal lossless source codes , 2000, IEEE Trans. Inf. Theory.

[31]  P. S. Sastry,et al.  A Class of Rapidly Converging Algorithms for Learning Automata , 1984 .

[32]  Yeong Min Jang Jang Estimation and Prediction‐Based Connection Admission Control in Broadband Satellite Systems , 2000 .

[33]  P. Krishnaiah,et al.  19 Review about estimation of change points , 1988 .

[34]  Donald E. Knuth,et al.  Dynamic Huffman Coding , 1985, J. Algorithms.