Adaptive Mixtures of Probabilistic Transducers

Neural Computation

Volumn 9, Issue 8, 1997, Pages 1711-1733

  Singer, Yoram ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037753853     PISSN: 08997667     EISSN: None     Source Type: Journal    
DOI: 10.1162/neco.1997.9.8.1711     Document Type: Article

References (17)

1. Bengio, Y., & Fransconi, P. (1994). An input/output HMM architecture. In Advances in neural information processing systems 7, (pp. 427-434). Cambridge, MA: MIT Press.
2. Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984). Classification and regression trees. Belmont, CA: Wadsworth International Group.
3. Cesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D. P., Schapire, R. E., & Warmuth, M. K. (1993). How to use expert advice. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (pp. 382-391).
4. Church, K. W. (1988). A stochastic parts program and noun phrase parser for unrestricted text. In Second Conference on Applied Natural Language Processing (pp. 136-143).
5. Cover, T. M., & Thomas, J. A. (1991). Elements of information theory. New York: Wiley.
6. DeSantis, A., Markowski, C., & Wegman, M. N. (1988). Learning probabilistic prediction functions. In Proceedings of the First Annual Workshop on Computational Learning Theory (pp. 312-328).
7. Giles, C. L., Miller, C. B., Chen, D., Sun, G. Z., Chen, H. H., & Lee, Y. C. (1992). Learning and extracting finite state automata with second-order recurrent neural networks. Neural Computation, 4, 393-405.
8. Haussler, D., & Barron, A. (1993). How well do Bayes methods work for on-line prediction of {+1, -1} values? In The 3rd NEC Symposium on Computation and Cognition.
9. Helmbold, D. P., & Schapire, R. E. (1995). Predicting nearly as well as the best pruning of a decision tree. In Proceedings of the Eighth Annual Conference on Computational Learning Theory (pp. 61-68).
10. Jacobs, R. A., Jordan, M. I., Nowlan, S. J., & Hinton, G. E. (1991). Adaptive mixture of local experts. Neural Computation, 3, 79-87.
11. Jordan, M. I., & Jacobs, R. A. (1994). Hierarchical mixtures of experts and the EM algorithm. Neural Computation, 6, 181-214.
12. Krichevsky, R. E., & Trofimov, V. K. (1981). The performance of universal coding. IEEE Transactions on Information Theory, 27, 199-207.
13. Littlestone, N., & Warmuth, M. K. (1994). The weighted majority algorithm. Information and Computation, 108, 212-261.
14. Quinlan, J. R. (1993). C4.5: Programs for machine learning. San Mateo, CA: Morgan Kaufmann.
15. Riley, M. D. (1991). A statistical model for generating pronunication networks. In Proc. of IEEE Conf. on Acoustics, Speech, and Signal Processing (pp. 737-740).
16. Ron, D., Singer, Y., & Tishby, N. (1996). The power of amnesia: Learning probabilistic automata with variable memory length. Machine Learning, 25, 117-149.
17. 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.