A Stochastic Search on the Line-Based Solution to Discretized Estimation
Recently, Oommen and Rueda  presented a strategy by which the parameters of a binomial/multinomial distribution can be estimated when the underlying distribution is nonstationary. The method has been referred to as the Stochastic Learning Weak Estimator (SLWE), and is based on the principles of continuous stochastic Learning Automata (LA). In this paper, we consider a new family of stochastic discretized weak estimators pertinent to tracking time-varying binomial distributions. As opposed to the SLWE, our proposed estimator is discretized, i.e., the estimate can assume only a finite number of values. It is well known in the field of LA that discretized schemes achieve faster convergence speed than their corresponding continuous counterparts. By virtue of discretization, our estimator realizes extremely fast adjustments of the running estimates by jumps, and it is thus able to robustly, and very quickly, track changes in the parameters of the distribution after a switch has occurred in the environment. The design principle of our strategy is based on a solution, pioneered by Oommen , for the Stochastic Search on the Line (SSL) problem. The SSL solution proposed in , assumes the existence of an Oracle which informs the LA whether to go “right” or “left”. In our application domain, in order to achieve efficient estimation, we have to first infer (or rather simulate) such an Oracle. In order to overcome this difficulty, we rather intelligently construct an “Artificial Oracle” that suggests whether we are to increase the current estimate or to decrease it. The paper briefly reports conclusive experimental results that demonstrate the ability of the proposed estimator to cope with non-stationary environments with a high adaptation rate, and with an accuracy that depends on its resolution. The results which we present are, to the best of our knowledge, the first reported results that resolve the problem of discretized weak estimation using a SSL-based solution.
KeywordsWeak Estimators Learning Automata Non-Stationary Environments Stochastic Point Location
Unable to display preview. Download preview PDF.
- 2.Basseville, M., Nikiforov, I.V.: Detection of abrupt changes: theory and application. Prentice-Hall, Inc. (1993)Google Scholar
- 6.May, M., Berendt, B., Cornuéjols, A., Gama, J., Giannotti, F., Hotho, A., Malerba, D., Menesalvas, E., Morik, K., Pedersen, R., Saitta, L., Saygin, Y., Schuster, A., Vanhoof, K.: Research challenges in ubiquitous knowledge discovery. In: Next Generation of Data Mining, 1st edn. Chapman Hall Crc Data Mining and Knowledge Discovery Series, Chapman Hall CRC (2008)Google Scholar
- 7.Oommen, B.J.: Stochastic searching on the line and its applications to parameter learning in nonlinear optimization. IEEE Transactions on Systems, Man and Cybernetics 27B, 733–739 (1997)Google Scholar
- 9.Oommen, B.J., Hansen, E.: The asymptotic optimality of discretized linear reward-inaction learning automata. IEEE Transactions on Systems, Man, and Cybernetics 14(3) (May/June 1986)Google Scholar
- 13.Shiryayev, A.N.: Optimal Stopping Rules. Springer (1978)Google Scholar
- 16.Thathachar, M.A.L., Oommen, B.J.: Discretized reward-inaction learning automata. Journal of Cybernetics and Information Science, 24–29 (Spring 1979)Google Scholar
- 17.Yazidi, A., Granmo, O.-C., Oommen, B.J: A novel stochastic discretized weak estimator operating in non-stationary environments. To appear in the Proceedings of ICNC 2012, the 2012 International Conference on Computing, Networking and Communications, Hawaii, USA (2012)Google Scholar
- 18.Yazidi, A., Granmo, O.C., Oommen, B.J.: On the design of novel discretized weak estimators based on the stochastic search on the line solution. Unabridged version of this paper. To be Submitted for PublicationGoogle Scholar
- 19.Zhan, J., Oommen, B.J., Crisostomo, J.: Anomaly detection in dynamic systems using weak estimators. ACM Trans. Internet Technol. 11, 3:1–3:16 (July 2011)Google Scholar