{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T23:08:06Z","timestamp":1770505686372,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[1994,4]]},"DOI":"10.1007\/bf01000408","type":"journal-article","created":{"date-parts":[[2005,1,19]],"date-time":"2005-01-19T06:08:48Z","timestamp":1106114928000},"page":"43-68","source":"Crossref","is-referenced-by-count":21,"title":["Discrete sequence prediction and its applications"],"prefix":"10.1007","volume":"15","author":[{"given":"Philip","family":"Laird","sequence":"first","affiliation":[]},{"given":"Ronald","family":"Saul","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"52","volume-title":"Proceedings of the 3rd Workshop on Computational Learning Theory","author":"N. Abe","year":"1990","unstructured":"Abe, N., & Warmuth, M. (1990). On the computational complexity of approximating distributions by probabilistic automata. InProceedings of the 3rd Workshop on Computational Learning Theory (pp. 52?66). San Mateo, CA: Morgan Kaufmann."},{"key":"CR2","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, NJ: Prentice Hall."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/978-1-4612-3352-7_24","volume-title":"Sequences: Combinatories, compression, security, and transmission","author":"A. Blumer","year":"1990","unstructured":"Blumer, A. (1990). Application of DAWGs to data compression. In A. Capocelli (Ed.),Sequences: Combinatories, compression, security, and transmission (pp. 303?311). New York: Springer Verlag."},{"key":"CR4","volume-title":"Machine learning: An Al approach, Vol. II","author":"T. Dietterich","year":"1986","unstructured":"Dietterich, T., & Michalski, R. (1986). Learning to predict sequences. In R.S. Michalski et al. (Eds.),Machine learning: An Al approach, Vol. II. San Mateo, CA: Morgan Kaufmann."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1109\/69.43422","volume":"1","author":"M. Gooley","year":"1989","unstructured":"Gooley, M., & Wah, B. (1989). Efficient reordering of Prolog programs.IEEE Transactions on Knowledge and Data Engineering, 1 470?482.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Gratch, J. & DeJong, G. (1992). An analysis of learning to plan as a search problem. InProceedings of the Ninth International Machine Learning Conference. Morgan Kaufmann.","DOI":"10.1016\/B978-1-55860-247-2.50028-0"},{"key":"CR7","first-page":"277","volume-title":"Proceedings of the 2nd International Conference, Knowledge Representation and Reasoning","author":"R. Greiner","year":"1991","unstructured":"Greiner, R., & Orponen, P. (1991). Probably approximately optimal derivation strategies. InProceedings of the 2nd International Conference, Knowledge Representation and Reasoning (pp. 277?288). San Mateo, CA: Morgan Kaufmann."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01277519","volume":"1","author":"D. Kotz","year":"1992","unstructured":"Kotz, D., & Ellis, C.S. (1992). Practical Prefetching techniques for multi-processor file systems.Distributed and Parallel Databases, 1 33?51.","journal-title":"Distributed and Parallel Databases"},{"key":"CR9","first-page":"929","volume-title":"Proceedings AAAI-90","author":"P. Laird","year":"1990","unstructured":"Laird, P., & Gamble, E. (1990). Extending EBG to term-rewriting systems. InProceedings AAAI-90 (pp. 929?935). Menlo Park, CA: American Association for Artificial Intelligence."},{"key":"CR10","series-title":"Technical Report","volume-title":"Predictive caching using the TDAG algorithm","author":"P. Laird","year":"1992","unstructured":"Laird, P., & Saul, R. (1992). Predictive caching using the TDAG algorithm (Technical Report FIA-92-30). NASA Ames Research Center, AI Research Branch, Moffett Field, CA."},{"key":"CR11","first-page":"297","volume-title":"Proceedings of the 1st Computer Learning Theory Workshop","author":"P. Laird","year":"1988","unstructured":"Laird, P. (1988). Efficient unsupervised learning. In D. Haussler & L. Pitt (Eds.),Proceedings of the 1st Computer Learning Theory Workshop (pp. 297?311). San Mateo, CA: Morgan Kaufmann."},{"key":"CR12","first-page":"135","volume-title":"Proceedings of the 10th National Conference on Artificial Intelligence","author":"P. Laird","year":"1992","unstructured":"Laird, P. (1992). Discrete sequence prediction and its applications. InProceedings of the 10th National Conference on Artificial Intelligence (pp. 135?146). Menlo Park, CA: American Association for Artificial Intelligence."},{"key":"CR13","first-page":"263","volume-title":"Proceedings of the 9th International Machine Learning Conference","author":"P. Laird","year":"1992","unstructured":"Laird, P. (1992). Dynamic optimization. InProceedings of the 9th International Machine Learning Conference (pp. 263?272). San Mateo, CA: Morgan Kaufmann."},{"issue":"3","key":"CR14","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0166-5316(82)90011-6","volume":"2","author":"E.J. Lau","year":"1982","unstructured":"Lau, E.J. (1982). Improving page prefetching with prior knowledge.Performance Evaluation, 2(3), 195?206.","journal-title":"Performance Evaluation"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/45072.45074","volume":"19","author":"D. Lelewer","year":"1987","unstructured":"Lelewer, D., & Hirschberg, D.S. (1987). Data compression.ACM Computing Surveys, 19 262?296.","journal-title":"ACM Computing Surveys"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1109\/DCC.1991.213349","volume-title":"Proceedings, Data Compression Conference","author":"D. Lelewer","year":"1991","unstructured":"Lelewer, D., & Hirschberg, D.S. (1991). Streamlining context models for data compression. InProceedings, Data Compression Conference (pp. 313?322). Los Alamitos, CA: IEEE Press."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1002\/j.1538-7305.1983.tb03114.x","volume":"62","author":"J. Levinson","year":"1983","unstructured":"Levinson, J., Rabiner, L., & Sondhi, M. (1983). An introduction to the application of the theory of probabilistic functions of Markov processes in automatic speech recognition.Bell Systems Technical Journal, 62 1035?1074.","journal-title":"Bell Systems Technical Journal"},{"key":"CR18","volume-title":"DENDRAL","author":"R. Lindsay","year":"1980","unstructured":"Lindsay, R., Buchanan, B., et al. (1980).DENDRAL. New York: McGraw-Hill."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00262979","volume":"17","author":"M. Martinez","year":"1982","unstructured":"Martinez, M. (1982). Program behavior prediction and prepaging.Acta Informatica, 17 101?120.","journal-title":"Acta Informatica"},{"key":"CR20","volume-title":"Paradigms of A.I. programming: Case studies in common LISP","author":"P. Norvig","year":"1991","unstructured":"Norvig, P. (1991).Paradigms of A.I. programming: Case studies in common LISP. San Mateo, CA: Morgan Kaufmann."},{"key":"CR21","first-page":"255","volume-title":"Proceedings of 17th International Conference on Very Large Data Bases","author":"M. Palmer","year":"1991","unstructured":"Palmer, M., & Zdonik, S.B. (1991). Fido: a cache that learns to fetch. InProceedings of 17th International Conference on Very Large Data Bases (pp. 255?264). San Mateo, CA: Morgan Kaufmann."},{"key":"CR22","first-page":"494","volume-title":"Proceedings of the 6th National Conference on Artificial Intelligence","author":"A. Prieditis","year":"1987","unstructured":"Prieditis, A., & Mostow, J. (1987). Prolearn: Towards a Prolog interpreter that learns. InProceedings of the 6th National Conference on Artificial Intelligence (pp. 494?498). Menlo Park, CA: Morgan Kaufmann."},{"key":"CR23","series-title":"Technical Report","volume-title":"Adaptive prefetching for disk buffers","author":"Kenneth Salem","year":"1991","unstructured":"Salem, Kenneth. (1991). Adaptive prefetching for disk buffers (Technical Report Tr-91-46). University of Maryland and CESDIS, Goddard Space Flight Center, Greenbelt, MD."},{"key":"CR24","first-page":"145","volume":"1","author":"T. Sejnowski","year":"1987","unstructured":"Sejnowski, T., & Rosenberg, C. (1987). Parallel networks that learn to pronounce English text.Complex Systems, 1 145?168.","journal-title":"Complex Systems"},{"issue":"3","key":"CR25","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/320263.320276","volume":"3","author":"A.J. Smith","year":"1978","unstructured":"Smith, A.J. (1978). Sequentiality and prefetching in database systems.Transactions on Database Systems, 3(3), 223?247.","journal-title":"Transactions on Database Systems"},{"key":"CR26","first-page":"942","volume-title":"Proceedings of the 8th National Conference on Artificial Intelligence","author":"D. Subramanian","year":"1990","unstructured":"Subramanian, D., & Feldman, R. (1990). The utility of EBL in recursive domains. InProceedings of the 8th National Conference on Artificial Intelligence (pp. 942?949). Menlo Park, CA: American Association for Artificial Intelligence."},{"key":"CR27","first-page":"71","volume-title":"Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science","author":"J. Vitter","year":"1991","unstructured":"Vitter, J., & Krishnan, P. (1991). Optimal prefetching via data compression. InProceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (pp. 71?78). New York: IEEE Press."},{"issue":"1","key":"CR28","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0306-4379(88)90032-4","volume":"13","author":"R. Williams","year":"1988","unstructured":"Williams, R. (1988). Dynamic history predictive compression.Information Systems, 13(1), 129?140.","journal-title":"Information Systems"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01000408.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01000408\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01000408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T22:35:26Z","timestamp":1556577326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01000408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["BF01000408"],"URL":"https:\/\/doi.org\/10.1007\/bf01000408","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,4]]}}}