{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:53:12Z","timestamp":1752231192921},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"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":5350,"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":[[1998,12]]},"DOI":"10.1016\/s0004-3702(98)00098-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:46:00Z","timestamp":1027608360000},"page":"335-352","source":"Crossref","is-referenced-by-count":5,"title":["Worst-case analysis of the perception and exponentiated update algorithms"],"prefix":"10.1016","volume":"106","author":[{"given":"Tom","family":"Bylander","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(98)00098-8_BIB1","doi-asserted-by":"crossref","unstructured":"P. Auer, M. Warmuth, Tracking the best disjunction, Machine Learning, to appear.","DOI":"10.1109\/SFCS.1995.492487"},{"issue":"1","key":"10.1016\/S0004-3702(98)00098-8_BIB2","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1103\/RevModPhys.34.123","article-title":"The Perceptron: a model for brain functioning","volume":"34","author":"Block","year":"1962","journal-title":"Reviews of Modern Physics"},{"key":"10.1016\/S0004-3702(98)00098-8_BIB3","series-title":"Proceedings 37th IEEE Annual Symposium on Foundations of Computer Science","article-title":"A polynomial-time algorithm for learning noisy linear threshold functions","author":"Blum","year":"1996"},{"key":"10.1016\/S0004-3702(98)00098-8_BIB4","series-title":"Proceedings 7th Annual ACM Conference on Computational Learning Theory","first-page":"340","article-title":"Learning linear-threshold functions in the presence of classification noise","author":"Bylander","year":"1994"},{"key":"10.1016\/S0004-3702(98)00098-8_BIB5","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1162\/neco.1995.7.2.370","article-title":"Learning linear threshold approximations using Perceptrons","volume":"7","author":"Bylander","year":"1995","journal-title":"Neural Computation"},{"key":"10.1016\/S0004-3702(98)00098-8_BIB6","series-title":"Proceedings 10th Annual Conference on Computational Learning Theory","first-page":"485","article-title":"Learning probabilistically consistent linear threshold functions","author":"Bylander","year":"1997"},{"key":"10.1016\/S0004-3702(98)00098-8_BIB7","series-title":"Proceedings AAAI-97","first-page":"485","article-title":"Worst-case absolute loss bounds for linear learning algorithms","author":"Bylander","year":"1997"},{"key":"10.1016\/S0004-3702(98)00098-8_BIB8","series-title":"Proceedings 10th Annual Conference on Computational Learning Theory","first-page":"163","article-title":"Analysis of two gradient-based algorithms for on-line regression","author":"Cesa-Bianchi","year":"1997"},{"key":"10.1016\/S0004-3702(98)00098-8_BIB9","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/72.501719","article-title":"Worst-case quadratic loss bounds for a generalization of the Widrow-Hoff rule","volume":"7","author":"Cesa-Bianchi","year":"1996","journal-title":"IEEE Trans. Neural Networks"},{"key":"10.1016\/S0004-3702(98)00098-8_BIB10","series-title":"Proceedings 38th IEEE Annual Symposium on Foundations of Computer Science","article-title":"Learning noisy Perceptrons by a Perceptron in polynomial time","author":"Cohen","year":"1997"},{"key":"10.1016\/S0004-3702(98)00098-8_BIB11","series-title":"Pattern Classification and Scene Analysis","author":"Duda","year":"1973"},{"key":"10.1016\/S0004-3702(98)00098-8_BIB12","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1109\/72.80230","article-title":"Perceptron-based learning algorithms","volume":"1","author":"Gallant","year":"1990","journal-title":"IEEE Trans. Neural Networks"},{"key":"10.1016\/S0004-3702(98)00098-8_BIB13","unstructured":"M. Herbster, M. Warmuth, Tracking the best expert, Machine Learning, to appear."},{"key":"10.1016\/S0004-3702(98)00098-8_BIB14","series-title":"Proceedings 11th Annual Conference on Computational Learning Theory","article-title":"Tracking the best regressor","author":"Herbster","year":"1998"},{"key":"10.1016\/S0004-3702(98)00098-8_BIB15","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","article-title":"Probability inequalities for sums of bounded variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/S0004-3702(98)00098-8_BIB16","series-title":"Adaptive, Learning and Pattern Recognition Systems: Theory and Applications","first-page":"81","article-title":"Algorithms for pattern classification","author":"Kashyap","year":"1970"},{"key":"10.1016\/S0004-3702(98)00098-8_BIB17","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":"Information and Computation"},{"key":"10.1016\/S0004-3702(98)00098-8_BIB18","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(98)00098-8_BIB19","article-title":"Mistake bounds and logarithmic linear-threshold learning algorithms","author":"Littlestone","year":"1989"},{"key":"10.1016\/S0004-3702(98)00098-8_BIB20","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(98)00098-8_BIB21","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1006\/inco.1994.1009","article-title":"The weighted majority algorithm","volume":"108","author":"Littlestone","year":"1994","journal-title":"Information and Computation"},{"key":"10.1016\/S0004-3702(98)00098-8_BIB22","series-title":"Perceptrons","author":"Minsky","year":"1969"},{"key":"10.1016\/S0004-3702(98)00098-8_BIB23","first-page":"615","article-title":"On convergence proofs for Perceptrons","volume":"Vol. XII","author":"Novikoff","year":"1962"},{"key":"10.1016\/S0004-3702(98)00098-8_BIB24","series-title":"Proceedings 4th London Symposium on Information Theory","article-title":"Some mathematical models of learning","author":"Papert","year":"1961"},{"key":"10.1016\/S0004-3702(98)00098-8_BIB25","series-title":"Principles of Neurodynamics","author":"Rosenblatt","year":"1962"},{"key":"10.1016\/S0004-3702(98)00098-8_BIB26","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF00114160","article-title":"Symbolic and neural learning programs: an experimental comparison","volume":"6","author":"Shavlik","year":"1991","journal-title":"Machine Learning"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370298000988?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370298000988?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T00:30:05Z","timestamp":1556411405000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370298000988"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0004370298000988"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(98)00098-8","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}