{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:36:57Z","timestamp":1752230217251,"version":"3.41.2"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[1999,9]]},"DOI":"10.1023\/a:1007670818503","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T05:54:50Z","timestamp":1040536490000},"page":"183-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["An Efficient Extension to Mixture Techniques for Prediction and Decision Trees"],"prefix":"10.1007","volume":"36","author":[{"given":"Fernando C.","family":"Pereira","sequence":"first","affiliation":[]},{"given":"Yoram","family":"Singer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"236583_CR1","volume-title":"Text Compression","author":"T. C. Bell","year":"1990","unstructured":"Bell, T. C., Cleary, J. G., & Witten, I. H. (1990). Text Compression. Englewood Cliffs, New Jersey: Prentice Hall."},{"unstructured":"Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984). Classification and Regression trees. Wadsworth International Group.","key":"236583_CR2"},{"key":"236583_CR3","volume-title":"A theory of learning classification rules","author":"W. L. Buntine","year":"1990","unstructured":"Buntine, W. L. (1990). A theory of learning classification rules. Unpublished doctoral dissertation, University of Technology, Sydney."},{"issue":"3","key":"236583_CR4","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/258128.258179","volume":"44","author":"N. Cesa-Bianchi","year":"1997","unstructured":"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\u2013485.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"236583_CR5","first-page":"312","volume-title":"Proceedings of the 1988 Workshop on Computational Learning Theory","author":"A. DeSantis","year":"1988","unstructured":"DeSantis, A., Markowsky, G., & Wegman, M. N. (1988). Learning probabilistic prediction functions. Proceedings of the 1988 Workshop on Computational Learning Theory (pp. 312\u2013328). San Francisco, California: Morgan Kaufmann."},{"issue":"1","key":"236583_CR6","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"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\u2013139.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"236583_CR7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1093\/biomet\/40.3-4.237","volume":"40","author":"I. J. Good","year":"1953","unstructured":"Good, I. J. (1953). The population frequencies of species and the estimation of population parameters. Biometrika, 40(3), 237\u2013264.","journal-title":"Biometrika"},{"issue":"1","key":"236583_CR8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1023\/A:1007396710653","volume":"27","author":"D. P. Helmbold","year":"1997","unstructured":"Helmbold, D. P., & Schapire, R. E. (1997). Predicting nearly as well as the best pruning of a decision tree. Machine Learning, 27(1), 51\u201368.","journal-title":"Machine Learning"},{"key":"236583_CR9","volume-title":"Statistical methods for speech recognition","author":"F. Jelinek","year":"1998","unstructured":"Jelinek, F. (1998). Statistical methods for speech recognition. Cambridge, Massachusetts: MIT Press."},{"issue":"3","key":"236583_CR10","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1109\/TASSP.1987.1165125","volume":"35","author":"S. M. Katz","year":"1987","unstructured":"Katz, S. M. (1987). Estimation of probabilities from sparse data for the language model component of a speech recognizer. IEEE Transactions on Acoustics Specch and Signal Processing, 35(3), 400\u2013401.","journal-title":"IEEE Transactions on Acoustics Specch and Signal Processing"},{"key":"236583_CR11","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1109\/TIT.1981.1056331","volume":"27","author":"R. E. Krichevsky","year":"1981","unstructured":"Krichevsky, R. E., & Trofimov, V. K. (1981). The performance of universal coding. IEEE Transactions on Information Theory, 27, 199\u2013207.","journal-title":"IEEE Transactions on Information Theory"},{"key":"236583_CR12","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"Littlestone, N., & Warmuth, M. K. (1994). The weighted majority algorithm. Information and Computation, 108, 212\u2013261.","journal-title":"Information and Computation"},{"key":"236583_CR13","first-page":"95","volume-title":"Proceedings of the Third Workshop on Very Large Corpora","author":"F. C. N. Pereira","year":"1995","unstructured":"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\u2013106). Somerset, New Jersey: Association for Computational Linguistics."},{"key":"236583_CR14","volume-title":"C4.5: Programs for machine learning","author":"J. R. Quinlan","year":"1993","unstructured":"Quinlan, J. R. (1993). C4.5: Programs for machine learning. San Francisco, California: Morgan Kaufmann."},{"issue":"4","key":"236583_CR15","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1109\/TIT.1986.1057210","volume":"32","author":"J. Rissanen","year":"1986","unstructured":"Rissanen, J. (1986). Complexity of strings in the class of Markov sources. IEEE Transactions on Information Theory, 32(4), 526\u2013532.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"236583_CR16","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/TIT.1981.1056282","volume":"IT-27","author":"J. Rissanen","year":"1981","unstructured":"Rissanen, J., & Langdon, G. G. (1981). Universal modeling and coding. IEEE Transactions on Information Theory, IT-27(1), 12\u201323.","journal-title":"IEEE Transactions on Information Theory"},{"key":"236583_CR17","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1023\/A:1026490906255","volume":"25","author":"D. Ron","year":"1996","unstructured":"Ron, D., Singer, Y., & Tishby, N. (1996). The power of amnesia: Learning probabilistic automata with variable memory length. Machine Learning, 25, 117\u2013149.","journal-title":"Machine Learning"},{"issue":"8","key":"236583_CR18","doi-asserted-by":"crossref","first-page":"1711","DOI":"10.1162\/neco.1997.9.8.1711","volume":"9","author":"Y. Singer","year":"1997","unstructured":"Singer, Y. (1997). Adaptive mixtures of probabilistic transducers. Neural Computation, 9(8), 1711\u20131733.","journal-title":"Neural Computation"},{"key":"236583_CR19","first-page":"371","volume-title":"Proceedings of the Third AnnualWorkshop on Computational Learning Theory","author":"V. G. Vovk","year":"1990","unstructured":"Vovk,V. G. (1990). Aggregating strategies. Proceedings of the Third AnnualWorkshop on Computational Learning Theory (pp. 371\u2013383). San Francisco, California: Morgan Kaufmann."},{"issue":"3","key":"236583_CR20","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1109\/18.135641","volume":"38","author":"M. Weinberger","year":"1992","unstructured":"Weinberger, M., Lempel, A., & Ziv, J. (1992). Universal coding of finite-memory sources. IEEE Transactions on Information Theory, 38(3), 1002\u20131014.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"236583_CR21","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/18.312161","volume":"40","author":"M. Weinberger","year":"1994","unstructured":"Weinberger, M., Merhav, N., & Feder, M. (1994). Optimal sequential probability assignment for individual sequence. IEEE Transactions on Information Theory, 40(2), 384\u2013396.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"236583_CR22","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/18.382011","volume":"41","author":"M. Weinberger","year":"1995","unstructured":"Weinberger, M., Rissanen, J., & Feder, M. (1995). A universal finite memory source. IEEE Transactions on Information Theory, 41(3), 643\u2013652.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"236583_CR23","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1109\/18.382012","volume":"41","author":"F. M. J. Willems","year":"1995","unstructured":"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\u2013664.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"236583_CR24","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.1109\/18.87000","volume":"37","author":"I. H. Witten","year":"1991","unstructured":"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\u20131094.","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007670818503.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007670818503\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007670818503.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:32:01Z","timestamp":1752147121000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007670818503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["236583"],"URL":"https:\/\/doi.org\/10.1023\/a:1007670818503","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[1999,9]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}