{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:31:00Z","timestamp":1743064260744,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":15,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_287","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:30:15Z","timestamp":1214505015000},"page":"642-644","source":"Crossref","is-referenced-by-count":1,"title":["Perceptron Algorithm"],"prefix":"10.1007","author":[{"given":"Shai","family":"Shalev-Shwartz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"287_CR1_287","doi-asserted-by":"publisher","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","volume":"6","author":"S. Agmon.","year":"1954","unstructured":"Agmon., S.: The relaxation method for linear inequalities. Can. J. Math. 6(3), 382\u2013392 (1954)","journal-title":"Can. J. Math."},{"key":"287_CR2_287","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.: The perceptron: A\u00a0model for brain functioning. Rev. Mod. Phys. 34, 123\u2013135 (1962)","journal-title":"Rev. Mod. Phys."},{"key":"287_CR3_287","unstructured":"Blum, A., Dunagan J. D.: Smoothed analysis of the perceptron algorithm for linear programming. In: SODA, (2002)"},{"key":"287_CR4_287","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N., Gentile, C.: Tracking the best hyperplane with a\u00a0simple budget perceptron. In: Proceedings of the Nineteenth Annual Conference on Computational Learning Theory, (2006)","DOI":"10.1007\/11776420_36"},{"key":"287_CR5_287","doi-asserted-by":"crossref","unstructured":"Collins, M.: Discriminative training methods for hidden markov models: Theory and experiments with perceptron algorithms. In: Conference on Empirical Methods in Natural Language Processing, (2002)","DOI":"10.3115\/1118693.1118694"},{"key":"287_CR6_287","unstructured":"Crammer, K., Dekel, O., Keshet, J., Shalev-Shwartz, S., Singer, Y.: Online passive aggressive algorithms. J.\u00a0Mach. Learn. Res. 7 (2006)"},{"key":"287_CR7_287","doi-asserted-by":"crossref","unstructured":"Crammer, K., Singer, Y.: A\u00a0new family of online algorithms for category ranking. In: Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (2002)","DOI":"10.1145\/564376.564404"},{"key":"287_CR8_287","unstructured":"Dekel, O., Shalev-Shwartz, S., Singer, Y.: The Forgetron: A\u00a0kernel-based perceptron on a\u00a0fixed budget. In: Advances in Neural Information Processing Systems 18 (2005)"},{"key":"287_CR9_287","doi-asserted-by":"crossref","unstructured":"Freund, Y., Schapire, R. E.: Large margin classification using the perceptron algorithm. In: Proceedings of the Eleventh Annual Conference on Computational Learning Theory (1998)","DOI":"10.1145\/279943.279985"},{"key":"287_CR10_287","unstructured":"Gentile, C.: The robustness of the p-norm algorithms. Mach. Learn. 53(3) (2002)"},{"key":"287_CR11_287","unstructured":"Minsky, M., Papert, S.: Perceptrons: An Introduction to Computational Geometry. The MIT Press, (1969)"},{"key":"287_CR12_287","unstructured":"Novikoff, A. B. J.: On convergence proofs on perceptrons. In: Proceedings of the Symposium on the Mathematical Theory of Automata, volume XII, pp. 615\u2013622, (1962)"},{"key":"287_CR13_287","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1037\/h0042519","volume":"65","author":"F. Rosenblatt","year":"1958","unstructured":"Rosenblatt, F.: The perceptron: A\u00a0probabilistic model for information storage and organization in the brain. Psychol. Rev. 65, 386\u2013407 (1958)","journal-title":"Psychol. Rev."},{"key":"287_CR14_287","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz, S., Singer, Y.: A\u00a0new perspective on an old perceptron algorithm. In: Proceedings of the Eighteenth Annual Conference on Computational Learning Theory, (2005)","DOI":"10.1007\/11503415_18"},{"key":"287_CR15_287","unstructured":"Vapnik, V. N.: Statistical Learning Theory. Wiley (1998)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T03:22:21Z","timestamp":1662175341000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_287"}},"subtitle":["1959; Rosenblatt"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_287","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}