{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:44:34Z","timestamp":1725529474192},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540879862"},{"type":"electronic","value":"9783540879879"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87987-9_22","type":"book-chapter","created":{"date-parts":[[2009,3,17]],"date-time":"2009-03-17T11:20:06Z","timestamp":1237288806000},"page":"240-255","source":"Crossref","is-referenced-by-count":0,"title":["Learning with Continuous Experts Using Drifting Games"],"prefix":"10.1007","author":[{"given":"Indraneel","family":"Mukherjee","sequence":"first","affiliation":[]},{"given":"Robert E.","family":"Schapire","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/11776420_40","volume-title":"Learning Theory","author":"J. Abernethy","year":"2006","unstructured":"Abernethy, J., Langford, J., Warmuth, M.K.: Continuous experts and the binning algorithm. In: Lugosi, G., Simon, H.U. (eds.) COLT 2006. LNCS (LNAI), vol.\u00a04005, pp. 544\u2013558. Springer, Heidelberg (2006)"},{"issue":"3","key":"22_CR2","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., Haussler, D., Helmbold, D.P., Schapire, R.E., Warmuth, M.K.: How to use expert advice. Journal of the Association for Computing Machinery\u00a044(3), 427\u2013485 (1997)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"22_CR3","first-page":"71","volume":"25","author":"N. Cesa-Bianchi","year":"1996","unstructured":"Cesa-Bianchi, N., Freund, Y., Helmbold, D.P., Warmuth, M.K.: On-line prediction and conversion strategies. Machine Learning\u00a025, 71\u2013110 (1996)","journal-title":"Machine Learning"},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1006\/inco.1995.1136","volume":"121","author":"Y. Freund","year":"1995","unstructured":"Freund, Y.: Boosting a weak learning algorithm by majority. Information and Computation\u00a0121(2), 256\u2013285 (1995)","journal-title":"Information and Computation"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Freund, Y., Opper, M.: Continuous drifting games. Journal of Computer and System Sciences, 113\u2013132 (2002)","DOI":"10.1006\/jcss.2001.1802"},{"issue":"1","key":"22_CR6","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences\u00a055(1), 119\u2013139 (1997)","journal-title":"Journal of Computer and System Sciences"},{"key":"22_CR7","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.: The weighted majority algorithm. Information and Computation\u00a0108, 212\u2013261 (1994)","journal-title":"Information and Computation"},{"key":"22_CR8","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"issue":"3","key":"22_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1023\/A:1010800213066","volume":"43","author":"R.E. Schapire","year":"2001","unstructured":"Schapire, R.E.: Drifting games. Machine Learning\u00a043(3), 265\u2013291 (2001)","journal-title":"Machine Learning"},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0304-3975(92)90270-P","volume":"95","author":"J. Spencer","year":"1992","unstructured":"Spencer, J.: Ulam\u2019s searching game with a fixed number of lies. Theoret. Comput. Sci.\u00a095(2), 307\u2013321 (1992)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87987-9_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:53:29Z","timestamp":1619524409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87987-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540879862","9783540879879"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87987-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}