{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T01:42:25Z","timestamp":1768786945279,"version":"3.49.0"},"reference-count":24,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":5715,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1997,12]]},"DOI":"10.1016\/s0004-3702(97)00039-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:24:09Z","timestamp":1027643049000},"page":"325-343","source":"Crossref","is-referenced-by-count":44,"title":["The perceptron algorithm versus winnow: linear versus logarithmic mistake bounds when few input variables are relevant"],"prefix":"10.1016","volume":"97","author":[{"given":"J.","family":"Kivinen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.K.","family":"Warmuth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Auer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(97)00039-8_BIB1","series-title":"Proceedings 36th Symposium on the Foundations of Computer Science","first-page":"312","article-title":"Tracking the best disjunction","author":"Auer","year":"1995"},{"key":"10.1016\/S0004-3702(97)00039-8_BIB2","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","article-title":"ability and the Vapnik-Chervonenkis dimension","volume":"36","author":"Blumer","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(97)00039-8_BIB3_1","article-title":"How to use expert advice","author":"Cesa-Bianchi","year":"1994"},{"key":"10.1016\/S0004-3702(97)00039-8_BIB3_2","series-title":"Proceedings 25th Annual ACM Symposium on Theory of Computing","first-page":"382","author":"Cesa-Bianchi","year":"1993"},{"key":"10.1016\/S0004-3702(97)00039-8_BIB4","author":"Duda","year":"1973"},{"key":"10.1016\/S0004-3702(97)00039-8_BIB5","series-title":"Proceedings 8th Annual Conference on Computational Learning Theory","first-page":"61","article-title":"Predicting nearly as well as the best pruning of a decision tree","author":"Helmbold","year":"1995"},{"key":"10.1016\/S0004-3702(97)00039-8_BIB6_1","first-page":"1093","article-title":"A polynomial algorithm in linear programming","volume":"244","author":"Khachiyan","year":"1979","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/S0004-3702(97)00039-8_BIB6_2","first-page":"191","volume":"20","author":"Khachiyan","year":"1979","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0004-3702(97)00039-8_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1996.2612","article-title":"Exponentiated gradient versus gradient descent for linear predictors","volume":"132","author":"Kivinen","year":"1997","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0004-3702(97)00039-8_BIB8","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF00116827","article-title":"Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm","volume":"2","author":"Littlestone","year":"1988","journal-title":"Machine Learning"},{"key":"10.1016\/S0004-3702(97)00039-8_BIB9","series-title":"Report UCSC-CRL-89-11","article-title":"Mistake bounds and logarithmic linear-threshold learning algorithms","author":"Littlestone","year":"1989"},{"key":"10.1016\/S0004-3702(97)00039-8_BIB10","series-title":"Proceedings 4th Annual Workshop on Computational Learning Theory","first-page":"147","article-title":"Redundant noisy attributes, attribute errors and linear threshold learning using Winnow","author":"Littlestone","year":"1991"},{"key":"10.1016\/S0004-3702(97)00039-8_BIB11","series-title":"Proceedings 12th International Conference on Machine Learning","first-page":"353","article-title":"Comparing several linear-threshold learning algorithms on tasks involving superfluous attributes","author":"Littlestone","year":"1995"},{"key":"10.1016\/S0004-3702(97)00039-8_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01277953","article-title":"On-line learning of linear functions","volume":"5","author":"Littlestone","year":"1995","journal-title":"J. Comput. Complexity"},{"key":"10.1016\/S0004-3702(97)00039-8_BIB13","first-page":"381","article-title":"How fast can a threshold gate learn","volume":"Vol. I","author":"Maass","year":"1994"},{"key":"10.1016\/S0004-3702(97)00039-8_BIB14","series-title":"Proceedings 12th International Conference on Machine Learning","first-page":"378","article-title":"Efficient learning with virtual threshold gates","author":"Maass","year":"1995"},{"key":"10.1016\/S0004-3702(97)00039-8_BIB15","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1037\/h0042519","article-title":"The Perceptron: a probabilistic model for information storage and organization in the brain","volume":"65","author":"Rosenblatt","year":"1958","journal-title":"Psych. Rev."},{"key":"10.1016\/S0004-3702(97)00039-8_BIB16","first-page":"381","article-title":"Adaptive mixture of probabilistic transducers","volume":"Vol. 8","author":"Singer","year":"1996"},{"key":"10.1016\/S0004-3702(97)00039-8_BIB17","series-title":"Proceedings 4th Annual Workshop on Computational Learning Theory","first-page":"112","article-title":"Learning curves in large neural networks","author":"Sompolinsky","year":"1991"},{"key":"10.1016\/S0004-3702(97)00039-8_BIB18","series-title":"Proceedings 30th Symposium on Foundations of Computer Science","first-page":"338","article-title":"A new algorithm for minimizing convex functions over convex sets","author":"Vaidya","year":"1989"},{"key":"10.1016\/S0004-3702(97)00039-8_BIB19","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Comm. ACM"},{"key":"10.1016\/S0004-3702(97)00039-8_BIB20","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","article-title":"On the uniform convergence of relative frequencies of events to their probabilities","volume":"16","author":"Vapnik","year":"1971","journal-title":"Theory Probab. Appl."},{"key":"10.1016\/S0004-3702(97)00039-8_BIB21","series-title":"Proceedings 3rd Annual Workshop on Computational Learning Theory","first-page":"371","article-title":"Aggregating strategies","author":"Vovk","year":"1990"},{"key":"10.1016\/S0004-3702(97)00039-8_BIB22","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1103\/RevModPhys.65.499","article-title":"The statistical mechanics of learning a rule","volume":"65","author":"Watkin","year":"1993","journal-title":"Rev. Mod. Phys."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370297000398?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370297000398?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T06:28:55Z","timestamp":1555050535000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370297000398"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["S0004370297000398"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(97)00039-8","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}