An efficient extension to mixture techniques for prediction and decision trees
暂无分享,去创建一个
[1] J. Ross Quinlan,et al. C4.5: Programs for Machine Learning , 1992 .
[2] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.
[3] Slava M. Katz,et al. Estimation of probabilities from sparse data for the language model component of a speech recognizer , 1987, IEEE Trans. Acoust. Speech Signal Process..
[4] Marcelo J. Weinberger,et al. Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm , 1992, IEEE Trans. Inf. Theory.
[5] David Haussler,et al. How to use expert advice , 1993, STOC.
[6] Jorma Rissanen,et al. Complexity of strings in the class of Markov sources , 1986, IEEE Trans. Inf. Theory.
[7] Raphail E. Krichevsky,et al. The performance of universal encoding , 1981, IEEE Trans. Inf. Theory.
[8] Vladimir Vovk,et al. Aggregating strategies , 1990, COLT '90.
[9] Meir Feder,et al. A universal finite memory source , 1995, IEEE Trans. Inf. Theory.
[10] Alfredo De Santis,et al. Learning probabilistic prediction functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[11] Abraham Lempel,et al. A sequential algorithm for the universal coding of finite memory sources , 1992, IEEE Trans. Inf. Theory.
[12] Frans M. J. Willems,et al. The context-tree weighting method: basic properties , 1995, IEEE Trans. Inf. Theory.
[13] Glen G. Langdon,et al. Universal modeling and coding , 1981, IEEE Trans. Inf. Theory.
[14] Yoram Singer,et al. Beyond Word N-Grams , 1996, VLC@ACL.
[15] Frederick Jelinek,et al. Statistical methods for speech recognition , 1997 .
[16] Manfred K. Warmuth,et al. The Weighted Majority Algorithm , 1994, Inf. Comput..
[17] I. Good. THE POPULATION FREQUENCIES OF SPECIES AND THE ESTIMATION OF POPULATION PARAMETERS , 1953 .
[18] Yoram Singer,et al. Adaptive Mixtures of Probabilistic Transducers , 1995, Neural Computation.
[19] Neri Merhav,et al. Optimal sequential probability assignment for individual sequences , 1994, IEEE Trans. Inf. Theory.
[20] Ian H. Witten,et al. The zero-frequency problem: Estimating the probabilities of novel events in adaptive text compression , 1991, IEEE Trans. Inf. Theory.
[21] Robert E. Schapire,et al. Predicting Nearly as Well as the Best Pruning of a Decision Tree , 1995, COLT.