{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:31:42Z","timestamp":1752229902000},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438366"},{"type":"electronic","value":"9783540454359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45435-7_9","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T01:44:50Z","timestamp":1179279890000},"page":"121-137","source":"Crossref","is-referenced-by-count":5,"title":["A Second-Order Perceptron Algorithm"],"prefix":"10.1007","author":[{"given":"Nicol\u00f2","family":"Cesa-Bianchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Conconi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio","family":"Gentile","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,25]]},"reference":[{"issue":"4","key":"9_CR1","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D. (1988). Queries and concept learning. Machine Learning, 2(4), 319\u2013342.","journal-title":"Machine Learning"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1007472513967","volume":"32","author":"P. Auer","year":"1998","unstructured":"Auer, P., & Warmuth, M. K. (1998). Tracking the best disjunction. Machine Learning, 32(2), 127\u2013150.","journal-title":"Machine Learning"},{"key":"9_CR3","unstructured":"Auer, P., Cesa Bianchi, N., & Gentile, C. (2001). Adaptive and self-confident online learning algorithms. Journal of Computer and System Sciences, to appear."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Auer, P. (2000). Using Upper Confidence Bounds for Online Learning. In 41st FOCS, IEEE, pp. 270\u2013279.","DOI":"10.1109\/SFCS.2000.892116"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1010896012157","volume":"43","author":"K. S. Azoury","year":"2001","unstructured":"Azoury K. S., & Warmuth, M. K. (2001). Relative loss bounds for on-line density estimation with the exponential familiy of distributions. Machine Learning, 43(3), 211\u2013246.","journal-title":"Machine Learning"},{"key":"9_CR6","unstructured":"Ben-Israel, A. & Greville, T. N. E. (1974). Generalized Inverses: Theory and Applications. John Wiley and Sons."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1103\/RevModPhys.34.123","volume":"34","author":"H. D. Block","year":"1962","unstructured":"Block, H. D. (1962). The perceptron: A model for brain functioning. Reviews of Modern Physics, 34, 123\u2013135.","journal-title":"Reviews of Modern Physics"},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","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. (1997). How to use expert advice. J. ACM, 44(3), 427\u2013485.","journal-title":"J. ACM"},{"key":"9_CR9","unstructured":"Cesa-Bianchi, N., Conconi, A., & Gentile, C. (2001). On the generalization ability of on-line learning algorithms. In NIPS 13, MIT Press, to appear."},{"key":"9_CR10","unstructured":"Cristianini, N. & Shawe-Taylor, J. (2001). An Introduction to Support Vector Machines. Cambridge University Press."},{"issue":"6","key":"9_CR11","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9","volume":"41","author":"S. Deerwester","year":"1990","unstructured":"Deerwester, S., Dumais, S. T., Furnas, G. W., Laundauer, T. K., & Harshman, R. A. (1990). Indexing by latent semantic analysis. Journal of the American Society for Information Science, 41(6), 391\u2013407.","journal-title":"Journal of the American Society for Information Science"},{"key":"9_CR12","unstructured":"Duda, R. O., Hart, P. E., & Stork, D. G. (2000). Pattern Classification. John Wiley and Sons."},{"key":"9_CR13","unstructured":"Gentile, C. & Warmuth, M. (1998). Linear hinge loss and average margin. In NIPS 10, MIT Press, pp. 225\u2013231."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1162\/15324430260185600","volume":"2","author":"C. Gentile","year":"2001","unstructured":"Gentile, C. (2001). A new approximate maximal margin classification algorithm. Journal of Machine Learning Research, 2, 213\u2013242.","journal-title":"Journal of Machine Learning Research"},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1023\/A:1010844028087","volume":"43","author":"A. J. Grove","year":"2001","unstructured":"Grove, A. J., Littlestone, N., & Schuurmans, D. (2001). General convergence results for linear discriminant updates. Machine Learning Journal, 43(3), 173\u2013210.","journal-title":"Machine Learning Journal"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/A:1007424614876","volume":"32","author":"M. Herbster","year":"1998","unstructured":"Herbster, M., & Warmuth, M. K. (1998). Tracking the best expert. Machine Learning Journal, 32(2), 151\u2013178.","journal-title":"Machine Learning Journal"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"55","DOI":"10.2307\/1267351","volume":"12","author":"A. Hoerl","year":"1970","unstructured":"Hoerl, A., & Kennard, R. (1970). Ridge regression: biased estimation for nonorthogonal problems. Technometrics, 12, 55\u201367.","journal-title":"Technometrics"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Horn, R. A., & Johnson, C. R. (1985). Matrix Analysis. Cambridge University Press.","DOI":"10.1017\/CBO9780511810817"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0004-3702(97)00039-8","volume":"97","author":"J. Kivinen","year":"1997","unstructured":"Kivinen, J., Warmuth, M. K., & Auer, P. (1997). The perceptron algorithm vs. winnow: linear vs. logarithmic mistake bounds when few input variables are relevant. Artificial Intelligence, 97, 325\u2013343.","journal-title":"Artificial Intelligence"},{"issue":"1\/3","key":"9_CR20","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1023\/A:1012435301888","volume":"46","author":"Y. Li","year":"2002","unstructured":"Li, Y., & Long, P. (2002). The relaxed online maximum margin algorithm. Machine Learning Journal, 46(1\/3), 361\u2013387.","journal-title":"Machine Learning Journal"},{"issue":"4","key":"9_CR21","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N. (1988). Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm. Machine Learning, 2(4), 285\u2013318.","journal-title":"Machine Learning"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"Littlestone, N., & Warmuth, M. K. (1994). The weighted majority algorithm. Information and Computation, 108:2, 212\u2013261.","journal-title":"Information and Computation"},{"key":"9_CR23","unstructured":"Marcus, M., & Minc, H. (1965). Introduction to Linear Algebra. Dover."},{"key":"9_CR24","first-page":"615","volume":"XII","author":"A. B. J. Novikov","year":"1962","unstructured":"Novikov, A. B. J. (1962). On convergence proofs on perceptrons. Proc. of the Symposium on the Mathematical Theory of Automata, vol. XII, pp. 615\u2013622.","journal-title":"Proc. of the Symposium on the Mathematical Theory of Automata"},{"key":"9_CR25","unstructured":"Press, W. H., Flannery, B. P., Teukolsky, S. A., & Wetterling. W. T. (1989). Numerical Recipes in Pascal. Cambridge University Press."},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1037\/h0042519","volume":"65","author":"F. Rosenblatt","year":"1958","unstructured":"Rosenblatt, F. (1958). The perceptron: A probabilistic model for information storage and organization in the brain. Psychological Review, 65, 386\u2013408.","journal-title":"Psychological Review"},{"key":"9_CR27","volume-title":"Statistical learning theory","author":"V. Vapnik","year":"1998","unstructured":"Vapnik, V. (1998). Statistical learning theory. New York: J. Wiley & Sons."},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Vovk, V. (1990). Aggregating strategies. In 3rd COLT, Morgan Kaufmann, pp. 371\u2013383.","DOI":"10.1016\/B978-1-55860-146-8.50032-1"},{"key":"9_CR29","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1111\/j.1751-5823.2001.tb00457.x","volume":"69","author":"V. Vovk","year":"2001","unstructured":"Vovk, V. (2001). Competitive on-line statistics. International Statistical Review, 69, 213\u2013248.","journal-title":"International Statistical Review"},{"key":"9_CR30","unstructured":"Williamson, R. C., Shawe-Taylor, J., Sch\u00f6lkopf, B., & Smola, A. (1999). Sample based generalization bounds. Technical Report NC-TR-99-055, NeuroCOLT."}],"container-title":["Lecture Notes in Computer Science","Computational Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45435-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T18:04:09Z","timestamp":1550340249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45435-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438366","9783540454359"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-45435-7_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}