暂无分享,去创建一个
[1] Tommi S. Jaakkola,et al. Online Learning of Non-stationary Sequences , 2003, NIPS.
[2] Steven de Rooij,et al. Catching Up Faster in Bayesian Model Selection and Model Averaging , 2007, NIPS.
[3] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[4] Lawrence R. Rabiner,et al. A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.
[5] Lawrence R. Rabiner,et al. A tutorial on Hidden Markov Models , 1986 .
[6] P. Deb. Finite Mixture Models , 2008 .
[7] W. M. Koolen-Wijkstra,et al. Combining expert advice efficiently , 2008 .
[8] Andrew R. Barron,et al. Asymptotic minimax regret for data compression, gambling, and prediction , 1997, IEEE Trans. Inf. Theory.
[9] Vladimir Vovk,et al. Derandomizing Stochastic Prediction Strategies , 1997, COLT '97.
[10] O. Bousquet. A Note on Parameter Tuning for On-Line Shifting Algorithms , 2003 .
[11] Alistair Moffat,et al. Compression and Coding Algorithms , 2005, IEEE Trans. Inf. Theory.
[12] Frans M. J. Willems,et al. Switching between two universal source coding algorithms , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).
[13] Andrew R. Barron,et al. Mixture Density Estimation , 1999, NIPS.
[14] Manfred K. Warmuth,et al. Tracking a Small Set of Experts by Mixing Past Posteriors , 2003, J. Mach. Learn. Res..
[15] Peter Elias,et al. Universal codeword sets and representations of the integers , 1975, IEEE Trans. Inf. Theory.
[16] Mark Herbster,et al. Tracking the Best Expert , 1995, Machine Learning.