{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T04:20:13Z","timestamp":1649218813429},"reference-count":9,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"unspecified","delay-in-days":5399,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[1993,12]]},"abstract":"<jats:p>The perceptron learning algorithm quite naturally yields an algorithm for finding a linearly separable boolean function consistent with a sample of such a function. Using the idea of a specifying sample, we give a simple proof that, in general, this algorithm is not efficient.<\/jats:p>","DOI":"10.1017\/s0963548300000778","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T11:17:09Z","timestamp":1221218229000},"page":"385-387","source":"Crossref","is-referenced-by-count":6,"title":["Using the Perceptron Algorithm to Find Consistent Hypotheses"],"prefix":"10.1017","volume":"2","author":[{"given":"Martin","family":"Anthony","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Shawe-Taylor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"S0963548300000778_ref008","volume-title":"Mechanisation of Thought Processes: Proceedings of a Symposium Held at the National Physical Laboratory","volume":"1","author":"Rosenblatt","year":"1959"},{"key":"S0963548300000778_ref003","doi-asserted-by":"publisher","DOI":"10.1145\/76359.76371"},{"key":"S0963548300000778_ref009","volume-title":"Principles of Neurodynamics","author":"Rosenblatt","year":"1962"},{"key":"S0963548300000778_ref006","volume-title":"Perceptrons","author":"Minsky","year":"1969"},{"key":"S0963548300000778_ref005","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116827"},{"key":"S0963548300000778_ref004","doi-asserted-by":"publisher","DOI":"10.1007\/BF00336991"},{"key":"S0963548300000778_ref001","volume-title":"Computational Learning Theory: An Introduction","author":"Anthony","year":"1992"},{"key":"S0963548300000778_ref002","doi-asserted-by":"crossref","unstructured":"[2] Anthony M. , Brightwell G. , Cohen D. and Shawe-Taylor J. (1992) On exact specification by examples. In: COLT'92, Proceedings of the Fifth Annual Workshop on Computational Learning Theory.","DOI":"10.1145\/130385.130420"},{"key":"S0963548300000778_ref007","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1965.263958"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548300000778","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T20:48:27Z","timestamp":1557953307000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548300000778\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["S0963548300000778"],"URL":"https:\/\/doi.org\/10.1017\/s0963548300000778","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}