{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:18:18Z","timestamp":1768029498075,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1007\/bf00114803","type":"journal-article","created":{"date-parts":[[2004,10,31]],"date-time":"2004-10-31T18:47:23Z","timestamp":1099248443000},"page":"41-65","source":"Crossref","is-referenced-by-count":6,"title":["Semi-supervised learning"],"prefix":"10.1007","volume":"4","author":[{"given":"Raymond","family":"Board","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonard","family":"Pitt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Cluster analysis for applications","author":"M. Anderberg","year":"1973","unstructured":"Anderberg, M. (1973). Cluster analysis for applications. New York: Academic Press."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D. (1987). Learning regular sets from queries and counterexamples. Information and Computation, 75, 87?106.","journal-title":"Information and Computation"},{"key":"CR3","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D. (1988a). Queries and concept learning. Machine Learning, 2, 319?342.","journal-title":"Machine Learning"},{"key":"CR4","first-page":"167","volume-title":"Proceedings of the 1988 Workshop on Computational Learning Theory","author":"D. Angluin","year":"1988","unstructured":"Angluin, D. (1988b). Learning with hints. Proceedings of the 1988 Workshop on Computational Learning Theory (pp. 167?181). Cambridge, CA: Morgan Kaufmann."},{"key":"CR5","series-title":"Technical Report YALEU\/DCS\/RR-648","volume-title":"Negative results for equivalence queries","author":"D. Angluin","year":"1988","unstructured":"Angluin, D. (1988c). Negative results for equivalence queries. (Technical Report YALEU\/DCS\/RR-648). New Haven, Connecticut: Yale University, Department of Computer Science."},{"key":"CR6","series-title":"Technical Report YALEU\/DCS\/RR-659","volume-title":"Equivalence queries and DNF formulas","author":"D. Angluin","year":"1988","unstructured":"Angluin, D. (1988d). Equivalence queries and DNF formulas. (Technical Report YALEU\/DCS\/RR-659). New Haven, Connecticut: Yale University, Department of Computer Science."},{"key":"CR7","first-page":"61","volume-title":"Proceedings of the 28th IEEE Symposium on Foundations of Computer Science","author":"P. Berman","year":"1987","unstructured":"Berman, P., & Roos, R. (1987). Learning one-counter languages in polynomial time. Proceedings of the 28th IEEE Symposium on Foundations of Computer Science (pp. 61?67). Los Angeles: IEEE Computer Society Press."},{"key":"CR8","first-page":"273","volume-title":"Proceedings of the 18th Annual ACM Symposium on Theory of Computation","author":"A. Blumer","year":"1986","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. (1986). Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension. Proceedings of the 18th Annual ACM Symposium on Theory of Computation (pp. 273?282). Berkeley, CA: Association for Computing Machinery."},{"key":"CR9","series-title":"Technical Report UCSC-CRL-87-20","volume-title":"Learnability and the Vapnik-Chervonenkis dimension","author":"A. Blumer","year":"1987","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. (1987). Learnability and the Vapnik-Chervonenkis dimension. (Technical Report UCSC-CRL-87?20). Santa Cruz, CA: University of California, Santa Cruz."},{"key":"CR10","volume-title":"Machine learning: An artificial intelligence approach","author":"J.G. Carbonell","year":"1983","unstructured":"Carbonell, J.G., Michalski, R.S. & Mitchell, T. M. (1983). An overview of machine learning. In R. S. Michalski, J. G. Carbonell & T. M. Mitchell (Eds.), Machine learning: An artificial intelligence approach. Palo Alto, CA: Tioga Press."},{"key":"CR11","volume-title":"Pattern classification and scene analysis","author":"R. Duda","year":"1973","unstructured":"Duda, R., & Hart, P. (1973). Pattern classification and scene analysis. New York: John Wiley & Sons."},{"key":"CR12","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., & Johnson, D. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: W. H. Freeman."},{"key":"CR13","volume-title":"Cluster algorithms","author":"J. Hartigan","year":"1975","unstructured":"Hartigan, J. (1975). Cluster algorithms. New York: John Wiley & Sons."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0004-3702(88)90002-1","volume":"36","author":"D. Haussler","year":"1988","unstructured":"Haussler, D. (1988). Quantifying inductive bias: AI learning algorithms and Valiant's learning frame-work. Artificial Intelligence, 36, 177?221.","journal-title":"Artificial Intelligence"},{"key":"CR15","first-page":"42","volume-title":"Proceedings of the 1988 Workshop on Computational Learning Theory","author":"D. Haussler","year":"1988","unstructured":"Haussler, D., Kearns, M., Littlestone, N., & Warmuth, M. (1988). Equivalence of models for polynomial learnability. Proceedings of the 1988 Workshop on Computational Learning Theory (pp. 42?55). Cambridge, MA: Morgan Kaufmann."},{"key":"CR16","first-page":"100","volume-title":"Proceedings of the 29th Annual Symposium on Foundations of Computer Science","author":"D. Haussler","year":"1988","unstructured":"Haussler, D., Littlestone, N., & Warmuth, M. (1988). Predicting {0, 1} functions on randomly drawn points. Proceedings of the 29th Annual Symposium on Foundations of Computer Science (pp. 100?109). White Plains, NY: IEEE Computer Society Press."},{"key":"CR17","first-page":"285","volume-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing","author":"M. Kearns","year":"1987","unstructured":"Kearns, M., Li, M., Pitt, L., & Valiant, L. G. (1987a). On the learnability of Boolean formulae. Proceedings of the 19th Annual ACM Symposium on Theory of Computing (pp. 285?295). New York: Assoc. Comp. Mach."},{"key":"CR18","volume-title":"Proceedings of the Fourth International Workshop on Machine Learning","author":"M. Kearns","year":"1987","unstructured":"Kearns, M., Li, M., Pitt, L., & Valiant, L. G. (1987b). Recent results on Boolean concept learning. Proceedings of the Fourth International Workshop on Machine Learning. Irvine, CA: Morgan Kaufmann."},{"key":"CR19","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N. (1988). Learning quickly when irrelevant attributes abound: a new linear threshold algorithm. Machine Learning, 2, 285?319.","journal-title":"Machine Learning"},{"key":"CR20","first-page":"296","volume-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing","author":"B. K. Natarajan","year":"1987","unstructured":"Natarajan, B. K. (1987). On learning Boolean functions. Proceedings of the 19th Annual ACM Symposium on Theory of Computing (pp. 296?304). New York: Assoc. Comput. Mach."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/48014.63140","volume":"35","author":"L. Pitt","year":"1988","unstructured":"Pitt, L., & Valiant, L. G. (1988). Computational limitations on learning from examples. Journal of the ACM, 35, 965?984.","journal-title":"Journal of the ACM"},{"key":"CR22","first-page":"60","volume-title":"Proceedings of the Third Annual Conference on Structure in Complexity Theory","author":"L. Pitt","year":"1988","unstructured":"Pitt, L., & Warmuth, M. K. (1988). Reductions among prediction problems: on the difficulty of predicting automata. Proceedings of the Third Annual Conference on Structure in Complexity Theory (pp. 60?69). Washington, D.C.: IEEE Computer Society Press."},{"key":"CR23","first-page":"229","volume":"2","author":"R. Rivest","year":"1987","unstructured":"Rivest, R. (1987). Learning decision-lists. Machine Learning, 2, 229?246.","journal-title":"Machine Learning"},{"key":"CR24","volume-title":"Cluster analysis for researchers","author":"H. Romesburg","year":"1984","unstructured":"Romesburg, H. (1984). Cluster analysis for researchers. Belmont, CA: Lifetime Learning."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"Valiant, L. G. (1984). A theory of the learnable. CACM, 27, 1134?1142.","journal-title":"CACM"},{"key":"CR26","first-page":"560","volume-title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","author":"L. G. Valiant","year":"1985","unstructured":"Valiant, L. G. (1985). Learning disjunctions of conjunctions. Proceedings of the Ninth International Joint Conference on Artificial Intelligence (pp. 560?566). Los Angeles, CA: Morgan Kaufmann."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00114803.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00114803\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00114803","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T14:09:14Z","timestamp":1554732554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00114803"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["BF00114803"],"URL":"https:\/\/doi.org\/10.1007\/bf00114803","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}