Online algorithms for modeling distributions using examples
M.A.L. Thathachar, M.T. Arvind · 2002
This paper addresses the problem of modeling the relationships between observed samples of data as a distribution. An L-step dependent model is constructed and an online algorithm is designed for the model in order to minimize the Kullback measure. The algorithm is analyzed to show that it converges weakly to global optimum of Kullback measure for that model. Simulation studies indicate that the algorithm has better tracking properties for time-varying distributions, when compared with statistical estimation procedures.