{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T03:07:42Z","timestamp":1768619262902,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"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":[[1998,8]]},"DOI":"10.1023\/a:1007472513967","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T04:48:21Z","timestamp":1040532501000},"page":"127-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":47,"title":["Tracking the Best Disjunction"],"prefix":"10.1007","volume":"32","author":[{"given":"Peter","family":"Auer","sequence":"first","affiliation":[]},{"given":"Manfred K.","family":"Warmuth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"168701_CR1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/168304.168345","volume-title":"Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory","author":"P. Auer","year":"1993","unstructured":"Auer, P. (1993). On-line learning of rectangles in noisy environments. In Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory (pp. 253-261). New York, NYU: ACM Press."},{"key":"168701_CR2","doi-asserted-by":"crossref","unstructured":"Auer, P., & Warmuth, M. K. (1995). Tracking the best disjunction. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science (pp. 312-321). IEEE Computer Society Press.","DOI":"10.1109\/SFCS.1995.492487"},{"key":"168701_CR3","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D. P., Schapire, R. E., & Warmuth, M. K. (1997). How to use expert advice. Journal of the ACM. (To appear)","DOI":"10.1145\/258128.258179"},{"key":"168701_CR4","first-page":"71","volume":"25","author":"N. Cesa-Bianchi","year":"1996","unstructured":"Cesa-Bianchi, N., Freund, Y., Helmbold, D. P., & Warmuth, M. K. (1996). On-line prediction and conversion strategies. Machine Learning, 25, 71-110. (An extended abstract appeared in '93)","journal-title":"Machine Learning"},{"key":"168701_CR5","unstructured":"Cover, T. (1965). Behavior of sequential predictors of binary sequences. In Proceedings of the 4th Prague Conference on Information Theory, Statistical Decision Functions and Random Processes (pp. 263-272). Publishing House of the Czechoslovak Academy of Sciences."},{"key":"168701_CR6","unstructured":"Duda, R. O., & Hart, P. E. (1973). Pattern classification and scene analysis. Wiley."},{"key":"168701_CR7","doi-asserted-by":"crossref","unstructured":"Haussler, D., Kivinen, J., & Warmuth, M. K. (1994). Tight worst-case loss bounds for predicting with expert advice (Tech. Rep. No. UCSC-CRL-94-36). University of California, Santa Cruz, Computer Research Laboratory. (An extended abstract appeared in Eurocolt 1995. To appear in IEEE Transactions on Information Theory.)","DOI":"10.1007\/3-540-59119-2_169"},{"key":"168701_CR8","volume-title":"Neural networks: a comprehensive foundation.","author":"S. Haykin","year":"1994","unstructured":"Haykin, S. (1994). Neural networks: a comprehensive foundation. New York, NY: Macmillan."},{"key":"168701_CR9","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, 51-68.","journal-title":"Machine Learning"},{"key":"168701_CR10","doi-asserted-by":"crossref","unstructured":"Herbster, M., & Warmuth, M. (1998). Tracking the best expert. Machine Learning. (Appears in this special issue.)","DOI":"10.1145\/279943.279949"},{"key":"168701_CR11","doi-asserted-by":"crossref","unstructured":"Jumarie, G. (1990). Relative information. Springer-Verlag.","DOI":"10.1007\/978-3-642-84017-3"},{"key":"168701_CR12","doi-asserted-by":"crossref","unstructured":"Kapur, J. N., & Kesavan, H. K. (1992). Entropy optimization principles with applications. Academic Press, Inc.","DOI":"10.1007\/978-94-011-2430-0_1"},{"issue":"1","key":"168701_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1996.2612","volume":"132","author":"J. Kivinen","year":"1997","unstructured":"Kivinen, J., & Warmuth, M. K. (1997). Additive versus exponentiated gradient updates for linear prediction. Information and Computation, 132(1), 1-64.","journal-title":"Information and Computation"},{"key":"168701_CR14","doi-asserted-by":"crossref","unstructured":"Kivinen, J., Warmuth, M. K., & Auer, P. (1997). The perceptron algorithm vs. Winnow: linear vs. logarithmic mistake bounds when few input variables are relevant. Artificial Intelligence. (To appear)","DOI":"10.1016\/S0004-3702(97)00039-8"},{"key":"168701_CR15","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1023\/A:1022869011914","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N. (1988). Learning when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2, 285-318.","journal-title":"Machine Learning"},{"key":"168701_CR16","unstructured":"Littlestone, N. (1989). Mistake bounds and logarithmic linear-threshold learning algorithms. Unpublished doctoral dissertation, Technical Report UCSC-CRL-89-11, University of California Santa Cruz."},{"key":"168701_CR17","first-page":"147","volume-title":"Proceedings of the 4th Annual Workshop on Computational Learning Theory","author":"N. Littlestone","year":"1991","unstructured":"Littlestone, N. (1991). Redundant noisy attributes, attribute errors, and linear threshold learning using Winnow. In Proceedings of the 4th Annual Workshop on Computational Learning Theory (pp. 147-156). San Mateo, CA: Morgan Kaufmann."},{"issue":"2","key":"168701_CR18","doi-asserted-by":"crossref","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(2), 212-261.","journal-title":"Information and Computation"},{"key":"168701_CR19","doi-asserted-by":"crossref","unstructured":"Maass, W., & Warmuth, M. K. (1998). Efficient learning with virtual threshold gates. Information and Computation. (To appear)","DOI":"10.1006\/inco.1997.2686"},{"key":"168701_CR20","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1037\/h0042519","volume":"65","author":"F. Rosenblatt","year":"1958","unstructured":"Rosenblatt, F. (1958). The perceptron: A probabilistic model for information storage and organization in the brain. Psych. Rev., 65, 386-407. (Reprinted in Neurocomputing (MIT Press, 1988).)","journal-title":"Psych. Rev."},{"key":"168701_CR21","doi-asserted-by":"crossref","unstructured":"Vovk, V. (1990). Aggregating strategies. In Proceedings of the 3rd AnnualWorkshop on Computational Learning Theory (pp. 371-383). Morgan Kaufmann.","DOI":"10.1016\/B978-1-55860-146-8.50032-1"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007472513967.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007472513967\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007472513967.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:36:32Z","timestamp":1752147392000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007472513967"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["168701"],"URL":"https:\/\/doi.org\/10.1023\/a:1007472513967","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,8]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}