{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:44:36Z","timestamp":1742798676880},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,10,1]],"date-time":"1996-10-01T00:00:00Z","timestamp":844128000000},"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":[[1996,10]]},"DOI":"10.1007\/bf00115301","type":"journal-article","created":{"date-parts":[[2004,11,1]],"date-time":"2004-11-01T02:11:46Z","timestamp":1099275106000},"page":"71-110","source":"Crossref","is-referenced-by-count":17,"title":["On-line prediction and conversion strategies"],"prefix":"10.1007","volume":"25","author":[{"given":"Nicol\ufffd","family":"Cesa-Bianchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoav","family":"Freund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David P.","family":"Helmbold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manfred K.","family":"Warmuth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Aarts, E. & Korst, J. (1989).Simulated Annealing and Boltzmann Machines. John Wiley and Sons."},{"key":"CR2","unstructured":"Alon, N., Spencer, J.H. & Erd?s, P. (1992).The Probabilistic Method. John Wiley and Sons."},{"key":"CR3","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"AngluinD. (1988). Queries and concept learning.Machine Learning, 2:319?342.","journal-title":"Machine Learning"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Aslam, J.A. & Dhagat, A. (1991). Searching in the presence of linearly bounded errors. InProceedings of the 23rd ACM Symposium on the Theory of Computation, pages 486?493 ACM Press.","DOI":"10.1145\/103418.103469"},{"key":"CR5","unstructured":"Auer, P. & Long, P.M. (to appear). Structural results about on-line learing models with and without queries.Machine Learning."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Auer, P. & Long, P.M. (1994). Simulating access to hidden information while learning. InProceedings of the 26th ACM Symposium on the Theory of Computation, pages 263?272. ACM Press.","DOI":"10.1145\/195058.195152"},{"key":"CR7","first-page":"1224","volume":"13","author":"J.M. Bardzin","year":"1972","unstructured":"BardzinJ.M. & FreivaldsR.V. (1972). On the prediction of general recursive functions.Soviet Math. Dokl., 13:1224?1228.","journal-title":"Soviet Math. Dokl."},{"key":"CR8","unstructured":"Berlekamp, E.R. (1968).Error-Correcting Codes. John Wiley and Sons."},{"key":"CR9","unstructured":"Cesa-Bianchi, N., Freund, Y., Helmbold, D.P., Haussler, D., Schapire, R. & Warmuth, M.K. (1995). How to use expert advice. To appear inJournal of the ACM."},{"issue":"2","key":"CR10","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/72.501719","volume":"7","author":"N. Cesa-Bianchi","year":"1996","unstructured":"Cesa-BianchiN., LongP.M. & WarmuthM.K. (1996). Worst-case quadratic loss bounds for a generalization of the Widrow-Hoff rule.IEEE Transactions on Neural Networks, 7(2): 604?619.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"ChernoffH. (1952). A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations.Annals of Mathematical Statistics, 23: 493?507.","journal-title":"Annals of Mathematical Statistics"},{"key":"CR12","unstructured":"Graham, R.L., Knuth, D.E. & Patashnik, O. (1989).Concrete Mathematics. Addison Wesley."},{"key":"CR13","first-page":"109","volume-title":"Computational Learning Theory: Eurocolt '93. The Institute of Mathematics and its Applications Conference Series","author":"J. Kivinen","year":"1994","unstructured":"KivinenJ. & WarmuthM.K. (1994). Using experts for predicting continuous outcomes. InComputational Learning Theory: Eurocolt '93. The Institute of Mathematics and its Applications Conference Series, number 53, pages 109?120, Oxford: Oxford University Press."},{"issue":"4","key":"CR14","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"LittlestoneN. (1988). Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm.Machine Learning, 2(4):285?318.","journal-title":"Machine Learning"},{"key":"CR15","unstructured":"Littlestone, N. (1989).Mistake Bounds and Logarithmic Linear-threshold Learning Algorithms. PhD thesis, University of California at Santa Cruz."},{"issue":"1","key":"CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01277953","volume":"5","author":"N. Littlestone","year":"1995","unstructured":"LittlestoneN., LongP.M. & WarmuthM.K. (1995). On-line learning of linear functions.Computational Complexity, 5(1):1?23.","journal-title":"Computational Complexity"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"LittlestoneN. & WarmuthM.K. (1994). The weighted majority algorithm.Information and Computation, 108:212?261.","journal-title":"Information and Computation"},{"key":"CR18","unstructured":"Mitchell, T.M. (1977). Version spaces: A candidate elimination approach to rule learning. InProceedings International Joint Conference on Artificial Intelligence, pages 305?310, Cambridge, Mass."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0304-3975(92)90270-P","volume":"95","author":"J. Spencer","year":"1992","unstructured":"SpencerJ. (1992). Ulam's searching game with a fixed number of lies.Theoretical Computer Science, 95:307?321.","journal-title":"Theoretical Computer Science"},{"key":"CR20","unstructured":"Ulam, S. (1977).Adventures of a Mathematician. Scribners."},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"Vovk, V.G. (1990). Aggregating strategies. InProceedings of the 3rd Annual Workshop on Computational Learning Theory, pages 372?383.","DOI":"10.1016\/B978-1-55860-146-8.50032-1"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00115301.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00115301\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00115301","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T14:09:22Z","timestamp":1554732562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00115301"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["BF00115301"],"URL":"https:\/\/doi.org\/10.1007\/bf00115301","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}