{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:28:54Z","timestamp":1752229734703},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Complexity"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1007\/bf01277953","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T06:00:40Z","timestamp":1111644040000},"page":"1-23","source":"Crossref","is-referenced-by-count":16,"title":["On-line learning of linear functions"],"prefix":"10.1007","volume":"5","author":[{"given":"Nicholas","family":"Littlestone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manfred K.","family":"Warmuth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip M.","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"S. S. Agaian,Hadamard Matrices and Their Applications. Number 1168 in Lecture Notes in Mathematics. Springer-Verlag, 1985.","DOI":"10.1007\/BFb0101073"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"E. J. Bernstein, Absolute error bounds for learning linear functions on line.Proceedings of the 1992 Workshop on Computational Learning Theory, 1992, 160?163.","DOI":"10.1145\/130385.130403"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"A. Blum, L. Hellerstein, and N. Littlestone, Learning in the presence of finitely many or infinitely many irrelevant attributes.The 1991 Workshop on Computational Learning Theory, 1991, 157?166.","DOI":"10.1016\/B978-1-55860-213-7.50018-3"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"N. Cesa-Bianchi, P. M. Long, and M. K. Warmuth, Worst-case quadratic loss bounds for a generalization of the Widrow-Hoff rule.The 1993 Workshop on Computational Learning Theory, 1993, 429?438.","DOI":"10.1145\/168304.168390"},{"key":"CR5","unstructured":"R. O. Duda and P. E. Hart,Pattern Classification and Scene Analysis. Wiley, 1973."},{"issue":"1","key":"CR6","first-page":"7","volume":"4","author":"D. Haussler","year":"1989","unstructured":"D. Haussler, Learning conjunctive concepts in structural domains.Machine Learning 4(1) (1989), 7?40.","journal-title":"Machine Learning"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"M. Kearns, M. Li, L. Pitt, and L. G. Valiant, On the learnability of boolean formulae.Proceedings of the 19th Annual Symposium on the Theory of Computation, 1987, 285?295.","DOI":"10.1145\/28395.28426"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1109\/TIT.1967.1053968","volume":"13","author":"S. Kullback","year":"1967","unstructured":"S. Kullback, A lower bound for discrimination in terms of variation.IEEE transactions on Information Theory 13 (1967), 126?127.","journal-title":"IEEE transactions on Information Theory"},{"key":"CR9","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"N. Littlestone, Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm.Machine Learning 2 (1988), 285?318.","journal-title":"Machine Learning"},{"key":"CR10","unstructured":"N. Littlestone,Mistake Bounds and Logarithmic Linear-threshold Learning Algorithms. PhD thesis, UC Santa Cruz, 1989."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"N. Littlestone and M. Warmuth, The weighted majority algorithm.Information and Computation (1994). To appear.","DOI":"10.1006\/inco.1994.1009"},{"issue":"2","key":"CR12","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1090\/S0002-9939-1988-0943082-5","volume":"103","author":"J. Mycielski","year":"1988","unstructured":"J. Mycielski, A learning algorithm for linear operators.Proceedings of the American Mathematical Society 103(2) (1988), 547?550.","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"3","key":"CR13","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/0022-0000(90)90028-J","volume":"41","author":"L. Pitt","year":"1990","unstructured":"L. Pitt andM. K. Warmuth, Prediction preserving reducibility.Journal of Computer and System Sciences 41(3) (1990), 430?467.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR14","volume-title":"Linear Algebra and its Applications","author":"G. Strang","year":"1988","unstructured":"G. Strang,Linear Algebra and its Applications. Harcourt, Brace, Jovanovich, 1988."},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"B. Widrow and M. E. Hoff, Adaptive switching circuits.1960 IRE WESCON Convention Record (1960), 96?104.","DOI":"10.21236\/AD0241531"}],"container-title":["Computational Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01277953.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01277953\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01277953","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T12:58:28Z","timestamp":1586177908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01277953"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["BF01277953"],"URL":"https:\/\/doi.org\/10.1007\/bf01277953","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}