{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:21:09Z","timestamp":1725488469240},"publisher-location":"Berlin, Heidelberg","reference-count":21,"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_20","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:13:49Z","timestamp":1186740829000},"page":"303-319","source":"Crossref","is-referenced-by-count":3,"title":["When Can Two Unsupervised Learners Achieve PAC Separation?"],"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":"20_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1162\/15324430152733133","volume":"1","author":"E.L. Allwein","year":"2000","unstructured":"E.L. Allwein, R.E. Schapire and Y. Singer (2000). Reducing Multiclass to Binary: A Unifying Approachfor Margin Classifiers. Journal of Machine Learning Research 1, 113\u2013141.","journal-title":"Journal of Machine Learning Research"},{"key":"20_CR2","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Computational Learning Theory","author":"M. Anthony","year":"1992","unstructured":"M. Anthony and N. Biggs (1992). Computational Learning Theory, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, Cambridge."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"C.M. Bishop (1995). Neural Networks for Pattern Recognition, Oxford University Press.","DOI":"10.1201\/9781420050646.ptb6"},{"key":"20_CR4","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":"5","key":"20_CR5","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1145\/290179.290184","volume":"45","author":"N.H. Bshouty","year":"1998","unstructured":"N.H. Bshouty, S.A. Goldman, H.D. Mathias, S. Suri and H. Tamaki (1998). Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. Journal of the ACM 45(5), pp. 863\u2013890.","journal-title":"Journal of the ACM"},{"issue":"2","key":"20_CR6","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1137\/S0097539794274246","volume":"28","author":"N.H. Bshouty","year":"1999","unstructured":"N.H. Bshouty, P.W. Goldberg, S.A. Goldman and H.D. Mathias (1999). Exact learning of discretized geometric concepts. SIAM J. Comput. 28(2) pp. 674\u2013699.","journal-title":"SIAM J. Comput"},{"key":"20_CR7","unstructured":"N. Cristianini and J. Shawe-Taylor (2000). An Introduction to Support Vector Machines. Cambridge University Press."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"M. Cryan, L. Goldberg and P. Goldberg (1998). Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model. Procs. of 39th FOCS symposium, pp. 436\u2013445.","DOI":"10.1109\/SFCS.1998.743494"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"S. Dasgupta (1999). Learning mixtures of Gaussians. 40th IEEE Symposium on Foundations of Computer Science.","DOI":"10.1109\/SFFCS.1999.814639"},{"key":"20_CR10","volume-title":"Pattern Classification and Scene Analysis","author":"R.O. Duda","year":"1973","unstructured":"R.O. Duda and P.E. Hart. Pattern Classification and Scene Analysis. Wiley, New York (1973)."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Y. Freund and Y. Mansour (1999). Estimating a mixture of two product distributions. Procs. of 12th COLT conference, pp. 53\u201362.","DOI":"10.1145\/307400.307412"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"A. Frieze, M. Jerrum and R. Kannan (1996). Learning Linear Transformations. 37th IEEE Symposium on Foundations of Computer Science, pp. 359\u2013368.","DOI":"10.1109\/SFCS.1996.548495"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"V. Guruswami and A. Sahai (1999). Multiclass Learning, Boosting, and Error-Correcting Codes. Procs. of 12th COLT conference, pp. 145\u2013155.","DOI":"10.1145\/307400.307429"},{"issue":"2","key":"20_CR14","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0890-5401(91)90042-Z","volume":"95","author":"D. Haussler","year":"1991","unstructured":"D. Haussler, M. Kearns, N. Littlestone and M.K. Warmuth (1991). Equivalence of Models for Polynomial Learnability. Information and Computation, 95(2), pp. 129\u2013161.","journal-title":"Information and Computation"},{"issue":"2","key":"20_CR15","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1137\/0221019","volume":"21","author":"D. Helmbold","year":"1992","unstructured":"D. Helmbold, R. Sloan and M.K. Warmuth (1992). Learning Integer Lattices. SIAM Journal on Computing, 21(2), pp. 240\u2013266.","journal-title":"SIAM Journal on Computing"},{"key":"20_CR16","unstructured":"M.J. Kearns (1993). Efficient Noise-Tolerant Learning From Statistical Queries, Procs. of the 25th Annual Symposium on the Theory of Computing, pp. 392\u2013401."},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R.E. Schapire and L. Sellie (1994). On the Learnability of Discrete Distributions, Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, pp. 273\u2013282.","DOI":"10.1145\/195058.195155"},{"issue":"3","key":"20_CR18","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/S0022-0000(05)80062-5","volume":"48","author":"M.J. Kearns","year":"1994","unstructured":"M.J. Kearns and R.E. Schapire (1994). Efficient Distribution-free Learning of Probabilistic Concepts, Journal of Computer and System Sciences, 48(3) 464\u2013497. (see also FOCS\u2019 90)","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR19","unstructured":"J.C. Platt, N. Cristianini and J. Shawe-Taylor (2000). Large Margin DAGs for Multiclass Classification, Procs. of 12th NIPS conference."},{"issue":"11","key":"20_CR20","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"L.G. Valiant (1984). A Theory of the Learnable. Commun. ACM 27(11), pp. 1134\u20131142.","journal-title":"Commun. ACM"},{"key":"20_CR21","unstructured":"L.G. Valiant (1985). Learning disjunctions of conjunctions. Procs. of 9th International Joint Conference on Artificial Intelligence."}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T22:11:16Z","timestamp":1556748676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44581-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423430","9783540445814"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-44581-1_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}