{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T11:11:36Z","timestamp":1648984296460},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4034,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s0304-3975(01)00081-0","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T12:10:37Z","timestamp":1034338237000},"page":"109-142","source":"Crossref","is-referenced-by-count":4,"title":["Direct and indirect algorithms for on-line learning of disjunctions"],"prefix":"10.1016","volume":"284","author":[{"given":"D.P","family":"Helmbold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S","family":"Panizza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.K","family":"Warmuth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00081-0_BIB1","unstructured":"P. Auer, M.K. Warmuth, Tracking the best disjunction, J. Mach. Learning, Special issue on concept drift 32(2) (1998)."},{"key":"10.1016\/S0304-3975(01)00081-0_BIB2","doi-asserted-by":"crossref","unstructured":"T. Bylander, The binary exponentiated gradient algorithm for learning linear functions. Unpublished manuscript, private communication, 1997.","DOI":"10.1145\/267460.267495"},{"key":"10.1016\/S0304-3975(01)00081-0_BIB3","unstructured":"P. Domingo, M. Pazzani, Beyond independence: conditions for the optimality of the simple Bayesian classifier, Proc. 13th International Conference on Machine Learning, 1996, pp. 105\u2013112."},{"key":"10.1016\/S0304-3975(01)00081-0_BIB4","series-title":"Pattern Classification and Scene Analysis","author":"Duda","year":"1973"},{"key":"10.1016\/S0304-3975(01)00081-0_BIB5","unstructured":"C. Gentile, M.K. Warmuth, Hinge Loss and Average Margin. Advances in Neural Information Processing Systems, Morgan Kaufmann, Los Altos, CA, 1999, pp. 225\u2013231."},{"key":"10.1016\/S0304-3975(01)00081-0_BIB6","doi-asserted-by":"crossref","unstructured":"A. Grove, N. Littlestone, D. Schuurmans, General Convergence results for linear discriminant updates, Mach. Learning, to appear (earlier version in Proceedings of COLT 1997).","DOI":"10.1145\/267460.267493"},{"key":"10.1016\/S0304-3975(01)00081-0_BIB7","unstructured":"N. Littlestone, Learning when irrelevant attributes abound: a new linear-threshold algorithm, Mach. Learning 2 (1988) 285\u2013318 (earlier version in FOCS87)."},{"key":"10.1016\/S0304-3975(01)00081-0_BIB8","unstructured":"N Littlestone, Mistake bounds and logarithmic linear-threshold learning algorithms, Ph.D. Thesis, Technical Report UCSC-CRL-89-11, University of California Santa Cruz, 1989."},{"key":"10.1016\/S0304-3975(01)00081-0_BIB9","doi-asserted-by":"crossref","unstructured":"N. Littlestone, Comparing several linear-threshold learning algorithms on tasks involving superfluous attributes, Proc. 12th International Conference on Machine Learning, Morgan Kaufmann, Los Altos, CA, 1995, pp. 353\u2013361.","DOI":"10.1016\/B978-1-55860-377-6.50051-7"},{"key":"10.1016\/S0304-3975(01)00081-0_BIB10","unstructured":"N. Littlestone, Private Communication."},{"key":"10.1016\/S0304-3975(01)00081-0_BIB11","unstructured":"N. Littlestone, Mistake-driven Bayes sports: bounds for symmetric apobayesian learning algorithms, Technical report, NEC Research Institute, Princeton, NJ, 1996."},{"key":"10.1016\/S0304-3975(01)00081-0_BIB12","unstructured":"N. Littlestone, C. Mesterharm, An Apobayesian Relative of Winnow, in: Advances in Neural Information Processing Systems, Morgan Kaufmann, Los Altos, CA, 1997, pp. 204\u2013210."},{"key":"10.1016\/S0304-3975(01)00081-0_BIB13","unstructured":"N. Littlestone, C. Mesterharm, A simulation study of winnow and related learning algorithms. Unpublished manuscript, 1999."},{"key":"10.1016\/S0304-3975(01)00081-0_BIB14","doi-asserted-by":"crossref","unstructured":"N. Littlestone, M.K. Warmuth, The weighted majority algorithm, Inform. Comput. 108 (1994) 212\u2013261 (earlier version in FOCS89).","DOI":"10.1006\/inco.1994.1009"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000810?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000810?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T07:55:29Z","timestamp":1554969329000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000810"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S0304397501000810"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00081-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}