{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:20:58Z","timestamp":1725488458552},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423430"},{"type":"electronic","value":"9783540445814"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44581-1_8","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:13:49Z","timestamp":1186740829000},"page":"116-127","source":"Crossref","is-referenced-by-count":1,"title":["Estimating a Boolean Perceptron from Its Average Satisfying Assignment: A Bound on the Precision Required"],"prefix":"10.1007","author":[{"given":"Paul W.","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,13]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624216","volume-title":"Neural Network Learning: Theoretical Foundations","author":"M. Anthony","year":"1999","unstructured":"M. Anthony and P.L. Bartlett (1999). Neural Network Learning: Theoretical Foundations, Cambridge University Press, Cambridge."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(94)00007-Z","volume":"61","author":"M. Anthony","year":"1995","unstructured":"M. Anthony, G. Brightwell and J. Shawe-Taylor (1995). On Specifying Boolean Functions by Labelled Examples. Discrete Applied Mathematics\n                        61, pp. 1\u201325.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1006\/jcss.1998.1569","volume":"56","author":"S. Ben-David","year":"1998","unstructured":"S. Ben-David and E. Dichterman (1998). Learning with Restricted Focus of Attention, J. of Computer and System Sciences, 56(3), pp. 277\u2013298. (earlier version in COLT\u201993)","journal-title":"J. of Computer and System Sciences"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"S. Ben-David and E. Dichterman (1994). Learnability with restricted focus of attention guarantees noise-tolerance, 5th International Workshop on Algorithmic Learning Theory, pp. 248\u2013259.","DOI":"10.1007\/3-540-58520-6_68"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/A:1007458528570","volume":"30","author":"A. Birkendorf","year":"1998","unstructured":"A. Birkendorf, E. Dichterman, J. Jackson, N. Klasner and H.U. Simon (1998). On restricted-focus-of-attention learnability of Boolean functions, Machine Learning, 30, 89\u2013123. (earlier version in COLT\u201996)","journal-title":"Machine Learning"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/PL00013833","volume":"22","author":"A. Blum","year":"1998","unstructured":"A. Blum, A. Frieze, R. Kannan and S. Vempala (1998). A Polynomial-time Algorithm for Learning Noisy Linear Threshold Functions. Algorithmica\n                        22: pp. 35\u201352.","journal-title":"Algorithmica"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"A. Blumer, A. Ehrenfeucht, D. Haussler and M.K. Warmuth (1989). Learnability and the Vapnik-Chervonenkis Dimension, J.ACM 36, 929\u2013965.","journal-title":"J.ACM"},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1137\/0403015","volume":"3","author":"J. Bruck","year":"1990","unstructured":"J. Bruck (1990). Harmonic analysis of polynomial threshold functions. SIAM Journal of Discrete Mathematics, 3(2), 168\u2013177.","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"C.K. Chow (1961). On the characterization of threshold functions. Proc. Symp. on Switching Circuit Theory and Logical Design, 34\u201338.","DOI":"10.1109\/FOCS.1961.24"},{"key":"8_CR10","unstructured":"E. Dichterman (1998). Learning with Limited Visibility. CDAM Research Reports Series, LSE-CDAM-98-01 44pp."},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1017\/S0963548300000675","volume":"2","author":"M.E. Dyer","year":"1993","unstructured":"M.E. Dyer, A.M. Frieze, R. Kannan, A. Kapoor, L. Perkovic and U. Vazirani (1993). A mildly exponential time algorithm for approximating the number of solutions to a multidimensional knapsack problem. Combinatorics, Probability and Computing\n                        2, 271\u2013284.","journal-title":"Combinatorics, Probability and Computing"},{"key":"8_CR12","unstructured":"T. Eiter, T. Ibaraki and K. Makino (1998). Decision Lists and Related Boolean Functions. Institut F\u00fcr Informatik JLU Giessen (IFIG) Research Reports 9804."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"P.W. Goldberg (1999). Learning Fixed-dimension Linear Thresholds from Fragmented Data. Warwick CSdept. tech. report RR362, Sept. 99, accepted for publication in Information and Computation as of Dec. 2000. A preliminary version is in Procs of the 1999 Conference on ComputationalLearning Theory, pp. 88\u201399 July 1999.","DOI":"10.1145\/307400.307416"},{"issue":"4","key":"8_CR14","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/S0019-9958(63)80014-5","volume":"6","author":"P. Kaszerman","year":"1963","unstructured":"P. Kaszerman (1963). A geometric test-synthesis procedure for a threshold device. Information and Control\n                        6(4), 381\u2013398.","journal-title":"Information and Control"},{"key":"8_CR15","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"N. Littlestone (1988). Learning Quickly When Irrelevant Attributes Abound: A New Linear-threshold Algorithm. Machine Learning\n                        2, pp. 285\u2013318.","journal-title":"Machine Learning"},{"key":"8_CR16","first-page":"229","volume":"2","author":"R.L. Rivest","year":"1996","unstructured":"R.L. Rivest (1996). Learning Decision Lists. Machine Learning\n                        2 pp. 229\u2013246.","journal-title":"Machine Learning"},{"key":"8_CR17","volume-title":"Principles of Neurodynamics","author":"F. Rosenblatt","year":"1962","unstructured":"F. Rosenblatt (1962). Principles of Neurodynamics. Spartan Books, New York, 1962."},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/T-C.1969.222665","volume":"18","author":"R.O. Winder","year":"1969","unstructured":"R.O. Winder (1969). Threshold Gate Approximations Based on Chow Parameters. IEEE Transactions on Computers\n                        18, pp. 372\u20135.","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"8_CR19","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/321637.321647","volume":"18","author":"R.O. Winder","year":"1971","unstructured":"R.O. Winder (1971). Chow Parameters in Threshold Logic. Journal of the ACM\n                        18(2), pp. 265\u201389.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Computational Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44581-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T21:55:06Z","timestamp":1548366906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44581-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423430","9783540445814"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-44581-1_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}