{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:54:58Z","timestamp":1725897298839},"publisher-location":"Wiesbaden","reference-count":6,"publisher":"Vieweg+Teubner Verlag","isbn-type":[{"type":"print","value":"9783815420331"},{"type":"electronic","value":"9783322952332"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/978-3-322-95233-2_23","type":"book-chapter","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T01:17:04Z","timestamp":1366161424000},"page":"381-385","source":"Crossref","is-referenced-by-count":0,"title":["Bemerkungen zum Sch\u00e4tzen von Bayesschen Diskriminantenfunktionen"],"prefix":"10.1007","author":[{"given":"Hans Ulrich","family":"Simon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Svetlana Annulova, Jorge Cuellar, Klaus Uwe H\u00f6ffgen, and Hans Ulrich Simon. Probably almost optimal neural classifiers. In preparation."},{"key":"23_CR2","volume-title":"Pattern Classification and Scene Analysis","author":"RO Duda","year":"1973","unstructured":"Richard O. Duda and Peter E. Hart. Pattern Classification and Scene Analysis. Wiley-Interscience. John Wiley & Sons, New York, 1973."},{"key":"23_CR3","first-page":"88","volume-title":"Proceedings of the 4th Annual Workshop on Computational Learning Theory","author":"P Fischer","year":"1991","unstructured":"Paul Fischer, Stefan Polt, and Hans Ulrich Simon. Probably almost Bayes decisions. In Proceedings of the 4th Annual Workshop on Computational Learning Theory, pages 88\u201394, 1991."},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/SFCS.1989.63453","volume-title":"Proceedings of the 30\u2019th Annual Symposium on the Foundations of Computer Science","author":"D Haussler","year":"1989","unstructured":"David Haussler. Generalizing the pac model: Sample size bounds from metric-dimension based uniform convergence results. In Proceedings of the 30\u2019th Annual Symposium on the Foundations of Computer Science, pages 40\u201346, 1989."},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1109\/FSCS.1990.89557","volume-title":"Proceedings of the 31 \u2018th Annual Symposium on the Foundations of Computer Science","author":"MJ Kearns","year":"1990","unstructured":"Michael J. Kearns and Robert E. Schapire. Efficient distribution-free learning of probabilistic concepts. In Proceedings of the 31 \u2018th Annual Symposium on the Foundations of Computer Science, pages 382\u2013392, 1990."},{"issue":"11","key":"23_CR6","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"G Leslie","year":"1984","unstructured":"Leslie G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134\u20131142, 1984.","journal-title":"Communications of the ACM"}],"container-title":["TEUBNER-TEXTE zur Informatik","Informatik"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-322-95233-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T06:34:10Z","timestamp":1557642850000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-322-95233-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783815420331","9783322952332"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-322-95233-2_23","relation":{},"ISSN":["1615-4584"],"issn-type":[{"type":"print","value":"1615-4584"}],"subject":[],"published":{"date-parts":[[1992]]}}}