Efficient extension to mixture techniques for prediction and decision trees

Machine Learning

Volumn 36, Issue 3, 1999, Pages 183-199

  Pereira, Fernando C ^a   Singer, Yoram ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; DECISION THEORY; MATHEMATICAL MODELS; TREES (MATHEMATICS);

EDGE BASED PRUNING; NODE-BASED PRUNING; WEIGHT ALLOCATION ALGORITHM;

LEARNING SYSTEMS;

EID: 0032595782     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007670818503     Document Type: Article

References (24)

1. Bell, T. C., Cleary, J. G., & Witten, I. H. (1990). Text Compression. Englewood Cliffs, New Jersey: Prentice Hall.
2. Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984). Classification and Regression trees. Wadsworth International Group.
3. Buntine, W. L. (1990). A theory of learning classification rules. Unpublished doctoral dissertation, University of Technology, Sydney.
4. Cesa-Bianchi, N., Freund, Y., Helmbold, D. P., Haussler, D., Schapire, R. E., & Warmuth, M. K. (1997). How to use expert advice. Journal of the Association for Computing Machinery, 44(3), 427-485.
5. DeSantis, A., Markowsky, G., & Wegman, M. N. (1988). Learning probabilistic prediction functions. Proceedings of the 1988 Workshop on Computational Learning Theory (pp. 312-328). San Francisco, California: Morgan Kaufmann.
6. Freund, Y., & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119-139.
7. Good, I. J. (1953). The population frequencies of species and the estimation of population parameters. Biometrika, 40(3), 237-264.
8. Helmbold, D. P., & Schapire, R. E. (1997). Predicting nearly as well as the best pruning of a decision tree. Machine Learning, 27(1), 51-68.
9. Jelinek, F. (1998). Statistical methods for speech recognition. Cambridge, Massachusetts: MIT Press.
10. Katz, S. M. (1987). Estimation of probabilities from sparse data for the language model component of a speech recognizer. IEEE Transactions on Acoustics Speech and Signal Processing, 35(3), 400-401.
11. Krichevsky, R. E., & Trofimov, V. K. (1981). The performance of universal coding. IEEE Transactions on Information Theory, 27, 199-207.
12. Littlestone, N., & Warmuth, M. K. (1994). The weighted majority algorithm. Information and Computation, 108, 212-261.
13. Pereira, F. C. N., Singer, Y., & Tishby, N. (1995). Beyond word n-grams. In D. Yarowsky, & K. Church (Eds.), Proceedings of the Third Workshop on Very Large Corpora (pp. 95-106). Somerset, New Jersey: Association for Computational Linguistics.
14. Quinlan, J. R. (1993). C4.5: Programs for machine learning. San Francisco, California: Morgan Kaufmann.
15. Rissanen, J. (1986). Complexity of strings in the class of Markov sources. IEEE Transactions on Information Theory, 32(4), 526-532.
16. Rissanen, J., & Langdon, G. G. (1981). Universal modeling and coding. IEEE Transactions on Information Theory, IT-27(1), 12-23.
17. Ron, D., Singer, Y., & Tishby, N. (1996). The power of amnesia: Learning probabilistic automata with variable memory length. Machine Learning, 25, 117-149.
18. Singer, Y. (1997). Adaptive mixtures of probabilistic transducers. Neural Computation, 9(8), 1711-1733.
19. Vovk, V. G. (1990). Aggregating strategies. Proceedings of the Third Annual Workshop on Computational Learning Theory (pp. 371-383). San Francisco, California: Morgan Kaufmann.
20. Weinberger, M., Lempel, A., & Ziv, J. (1992). Universal coding of finite-memory sources. IEEE Transactions on Information Theory, 38(3), 1002-1014.
21. Weinberger, M., Merhav, N., & Feder, M. (1994). Optimal sequential probability assignment for individual sequence. IEEE Transactions on Information Theory, 40(2), 384-396.
22. Weinberger, M., Rissanen, J., & Feder, M. (1995). A universal finite memory source. IEEE Transactions on Information Theory, 41(3), 643-652.
23. Willems, F. M. J., Shtarkov, Y. M., & Tjalkens, T. J. (1995). The context tree weighting method: Basic properties. IEEE Transactions on Information Theory, 41(3), 653-664.
24. Witten, I. H., & Bell, T. C. (1991). The zero-frequency problem: estimating the probabilities of novel events in adaptive text compression. IEEE Transactions on Information Theory, 37(4), 1085-1094.