{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T06:03:49Z","timestamp":1768802629450,"version":"3.49.0"},"reference-count":77,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-0312814CCR-0105488"],"award-info":[{"award-number":["IIS-0312814CCR-0105488"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-0312814CCR-0105488"],"award-info":[{"award-number":["IIS-0312814CCR-0105488"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2010,3]]},"abstract":"<jats:p>\n            Supervised learning\u2014that is, learning from labeled examples\u2014is an area of Machine Learning that has reached substantial maturity. It has generated general-purpose and practically successful algorithms and the foundations are quite well understood and captured by theoretical frameworks such as the PAC-learning model and the Statistical Learning theory framework. However, for many contemporary practical problems such as classifying web pages or detecting spam, there is often additional information available in the form of\n            <jats:italic>unlabeled<\/jats:italic>\n            data, which is often much cheaper and more plentiful than labeled data. As a consequence, there has recently been substantial interest in\n            <jats:italic>semi-supervised<\/jats:italic>\n            learning\u2014using unlabeled data together with labeled data\u2014since any useful information that reduces the amount of labeled data needed can be a significant benefit. Several techniques have been developed for doing this, along with experimental results on a variety of different learning problems. Unfortunately, the standard learning frameworks for reasoning about supervised learning do not capture the key aspects and the assumptions underlying these\n            <jats:italic>semi<\/jats:italic>\n            -supervised learning methods.\n          <\/jats:p>\n          <jats:p>\n            In this article, we describe an augmented version of the PAC model designed for semi-supervised learning, that can be used to reason about many of the different approaches taken over the past decade in the Machine Learning community. This model provides a unified framework for analyzing when and why unlabeled data can help, in which one can analyze both sample-complexity and algorithmic issues. The model can be viewed as an extension of the standard PAC model where, in addition to a concept class\n            <jats:italic>C<\/jats:italic>\n            , one also proposes a compatibility notion: a type of compatibility that one believes the target concept should have with the underlying distribution of data. Unlabeled data is then potentially helpful in this setting because it allows one to estimate compatibility over the space of hypotheses, and to reduce the size of the search space from the whole set of hypotheses\n            <jats:italic>C<\/jats:italic>\n            down to those that, according to one's assumptions, are a-priori reasonable with respect to the distribution. As we show, many of the assumptions underlying existing semi-supervised learning algorithms can be formulated in this framework.\n          <\/jats:p>\n          <jats:p>After proposing the model, we then analyze sample-complexity issues in this setting: that is, how much of each type of data one should expect to need in order to learn well, and what the key quantities are that these numbers depend on. We also consider the algorithmic question of how to efficiently optimize for natural classes and compatibility notions, and provide several algorithmic results including an improved bound for Co-Training with linear separators when the distribution satisfies independence given the label.<\/jats:p>","DOI":"10.1145\/1706591.1706599","type":"journal-article","created":{"date-parts":[[2010,3,25]],"date-time":"2010-03-25T12:17:18Z","timestamp":1269519438000},"page":"1-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":49,"title":["A discriminative model for semi-supervised learning"],"prefix":"10.1145","volume":"57","author":[{"given":"Maria-Florina","family":"Balcan","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, Georgia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avrim","family":"Blum","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, Pennsylvania"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,3,29]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Learning with Partially Classified Training Data. Workshop. In 22nd International Conference on Machine Learning Workshop (ICML'05)","author":"Amini M.-R.","unstructured":"Amini , M.-R. , Chapelle , O. , and Ghani , R. , Eds . 2005 . Learning with Partially Classified Training Data. Workshop. In 22nd International Conference on Machine Learning Workshop (ICML'05) . ACM, New York. http:\/\/www-connex.lip6.fr\/~amini\/lpctd_icml05.html. Amini, M.-R., Chapelle, O., and Ghani, R., Eds. 2005. Learning with Partially Classified Training Data. Workshop. In 22nd International Conference on Machine Learning Workshop (ICML'05). ACM, New York. http:\/\/www-connex.lip6.fr\/~amini\/lpctd_icml05.html."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.07.003"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the 18th Annual Conference on Neural Information Processing Systems. MIT Press","author":"Balcan M.-F.","unstructured":"Balcan , M.-F. , Blum , A. , and Yang , K . 2004. Co-training and expansion: Towards bridging theory and practice . In Proceedings of the 18th Annual Conference on Neural Information Processing Systems. MIT Press , Cambridge, MA. Balcan, M.-F., Blum, A., and Yang, K. 2004. Co-training and expansion: Towards bridging theory and practice. In Proceedings of the 18th Annual Conference on Neural Information Processing Systems. MIT Press, Cambridge, MA."},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 20th Annual Conference on Computational Learning Theory (COLT). Lecture Notes in Computer Science","volume":"4539","author":"Balcan M.-F.","unstructured":"Balcan , M.-F. , Broder , A. , and Zhang , T . 2007. Margin based active learning . In Proceedings of the 20th Annual Conference on Computational Learning Theory (COLT). Lecture Notes in Computer Science , vol. 4539 . Springer-Verlag, Berlin, Germany, 35--50. Balcan, M.-F., Broder, A., and Zhang, T. 2007. Margin based active learning. In Proceedings of the 20th Annual Conference on Computational Learning Theory (COLT). Lecture Notes in Computer Science, vol. 4539. Springer-Verlag, Berlin, Germany, 35--50."},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 21st Annual Conference on Computational Learning Theory (COLT). http:\/\/colt2008","author":"Balcan M.-F.","year":"2008","unstructured":"Balcan , M.-F. , Hanneke , S. , and Wortman , J . 2008. The true sample complexity of active learning . In Proceedings of the 21st Annual Conference on Computational Learning Theory (COLT). http:\/\/colt2008 .cs.helsinki.fi\/papers\/COLT 2008 .pdf. Balcan, M.-F., Hanneke, S., and Wortman, J. 2008. The true sample complexity of active learning. In Proceedings of the 21st Annual Conference on Computational Learning Theory (COLT). http:\/\/colt2008.cs.helsinki.fi\/papers\/COLT2008.pdf."},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 13th Annual Conference on Computational Learning Theory. Morgan-Kaufmann","author":"Bartlett P.","unstructured":"Bartlett , P. , Boucheron , S. , and Lugosi , G . 2000. Model selection and error estimation . In Proceedings of the 13th Annual Conference on Computational Learning Theory. Morgan-Kaufmann , San Francisco, CA, 286--297. Bartlett, P., Boucheron, S., and Lugosi, G. 2000. Model selection and error estimation. In Proceedings of the 13th Annual Conference on Computational Learning Theory. Morgan-Kaufmann, San Francisco, CA, 286--297."},{"key":"e_1_2_1_7_1","unstructured":"Bartlett P. and Mendelson S. 2002. Rademacher and gaussian complexities risk bounds and structural results. J. Mach. Learn. Res. 463--482.   Bartlett P. and Mendelson S. 2002. Rademacher and gaussian complexities risk bounds and structural results. J. Mach. Learn. Res. 463--482."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/92571.92652"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90026-X"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 17th Annual Conference on Neural Information Processing Systems. MIT Press","author":"Bie T. D.","unstructured":"Bie , T. D. , and Cristianini , N . 2003. Convex methods for transduction . In Proceedings of the 17th Annual Conference on Neural Information Processing Systems. MIT Press , Cambridge, MA, 73--80. Bie, T. D., and Cristianini, N. 2003. Convex methods for transduction. In Proceedings of the 17th Annual Conference on Neural Information Processing Systems. MIT Press, Cambridge, MA, 73--80."},{"key":"e_1_2_1_11_1","volume-title":"Internal Report 04-128, ESAT-SISTA, K.U. Leuven.","author":"Bie T. D.","year":"2004","unstructured":"Bie , T. D. , and Cristianini , N . 2004 . Convex transduction with the normalized cut. Internal Report 04-128, ESAT-SISTA, K.U. Leuven. Bie, T. D., and Cristianini, N. 2004. Convex transduction with the normalized cut. Internal Report 04-128, ESAT-SISTA, K.U. Leuven."},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 18th International Conference on Machine Learning. Morgan-Kaufmann","author":"Blum A.","unstructured":"Blum , A. , and Chawla , S . 2001. Learning from labeled and unlabeled data using graph mincuts . In Proceedings of the 18th International Conference on Machine Learning. Morgan-Kaufmann , San Francisco, CA, 19--26. Blum, A., and Chawla, S. 2001. Learning from labeled and unlabeled data using graph mincuts. In Proceedings of the 18th International Conference on Machine Learning. Morgan-Kaufmann, San Francisco, CA, 19--26."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00013833"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1475"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015429"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/279943.279962"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/76359.76371"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1051\/ps:2005018"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(200005)16:3%3C277::AID-RSA4%3E3.0.CO;2-1"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(94)00074-D"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556600"},{"key":"e_1_2_1_22_1","volume-title":"Eds","author":"Chapelle O.","year":"2006","unstructured":"Chapelle , O. , Sch\u00f6lkopf , B. , and Zien , A. , Eds . 2006 . Semi-Supervised Learning. MIT Press , Cambridge, MA. Chapelle, O., Sch\u00f6lkopf, B., and Zien, A., Eds. 2006. Semi-Supervised Learning. MIT Press, Cambridge, MA."},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the 10 International Workshop on Artificial Intelligence and Statistics, 57--64","author":"Chapelle O.","unstructured":"Chapelle , O. , and Zien , A . 2005. Semi-supervised classification by low density separation . In Proceedings of the 10 International Workshop on Artificial Intelligence and Statistics, 57--64 . Chapelle, O., and Zien, A. 2005. Semi-supervised classification by low density separation. In Proceedings of the 10 International Workshop on Artificial Intelligence and Statistics, 57--64."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022673506211"},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the Joint SIGDAT Conference on Empirical Methods in Natural Language Processing and Very Large Corpora. ACM","author":"Collins M.","unstructured":"Collins , M. , and Singer , Y . 1999. Unsupervised models for named entity classification . In Proceedings of the Joint SIGDAT Conference on Empirical Methods in Natural Language Processing and Very Large Corpora. ACM , New York, 189--196. Collins, M., and Singer, Y. 1999. Unsupervised models for named entity classification. In Proceedings of the Joint SIGDAT Conference on Empirical Methods in Natural Language Processing and Very Large Corpora. ACM, New York, 189--196."},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 19th Annual Conference on Neural Information Processing Systems. MIT Press","author":"Dasgupta S.","year":"2005","unstructured":"Dasgupta , S. 2005 . Coarse sample complexity bounds for active learning . In Proceedings of the 19th Annual Conference on Neural Information Processing Systems. MIT Press , Cambridge, MA, 235--242. Dasgupta, S. 2005. Coarse sample complexity bounds for active learning. In Proceedings of the 19th Annual Conference on Neural Information Processing Systems. MIT Press, Cambridge, MA, 235--242."},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 21st Annual Conference on Neural Information Processing Systems. MIT Press","author":"Dasgupta S.","unstructured":"Dasgupta , S. , Hsu , D. , and Monteleoni , C . 2007. A general agnostic active learning algorithm . In Proceedings of the 21st Annual Conference on Neural Information Processing Systems. MIT Press , Cambridge, MA. Dasgupta, S., Hsu, D., and Monteleoni, C. 2007. A general agnostic active learning algorithm. In Proceedings of the 21st Annual Conference on Neural Information Processing Systems. MIT Press, Cambridge, MA."},{"key":"e_1_2_1_28_1","volume-title":"Proc. Syst. 14","author":"Dasgupta S.","year":"2001","unstructured":"Dasgupta , S. , Littman , M. L. , and McAllester , D. 2001 . Pac generalization bounds for co-training. Adv. Neural Inf . Proc. Syst. 14 . Dasgupta, S., Littman, M. L., and McAllester, D. 2001. Pac generalization bounds for co-training. Adv. Neural Inf. Proc. Syst. 14."},{"key":"e_1_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Devroye L. Gyorfi L. and Lugosi G. 1996. A Probabilistic Theory of Pattern Recognition. Springer-Verlag Berlin Germany.  Devroye L. Gyorfi L. and Lugosi G. 1996. A Probabilistic Theory of Pattern Recognition. Springer-Verlag Berlin Germany.","DOI":"10.1007\/978-1-4612-0711-5"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380860"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90002-3"},{"key":"e_1_2_1_32_1","unstructured":"Freund Y. Seung H. S. Shamir E. and Tishby N. 1993. Information prediction and query by comittee. In Advances in Neural Information Processing Systems. Morgan-Kaufmann San Francisco CA 483--490.   Freund Y. Seung H. S. Shamir E. and Tishby N. 1993. Information prediction and query by comittee. In Advances in Neural Information Processing Systems. Morgan-Kaufmann San Francisco CA 483--490."},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 22nd Annual Conference on Computational Learning Theory (COLT).","author":"Friedman E.","year":"2009","unstructured":"Friedman , E. 2009 . Active learning for smooth problems . In Proceedings of the 22nd Annual Conference on Computational Learning Theory (COLT). Friedman, E. 2009. Active learning for smooth problems. In Proceedings of the 22nd Annual Conference on Computational Learning Theory (COLT)."},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the 19th International Joint Conference on Artificial Intelligence. ACM","author":"Gabrilovich E.","unstructured":"Gabrilovich , E. , and Markovitch , S . 2005. Feature generation for text categorization using world knowledge . In Proceedings of the 19th International Joint Conference on Artificial Intelligence. ACM , New York, 1048--1053. Gabrilovich, E., and Markovitch, S. 2005. Feature generation for text categorization using world knowledge. In Proceedings of the 19th International Joint Conference on Artificial Intelligence. ACM, New York, 1048--1053."},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence. AUAI Press, 204--211","author":"Ganchev K.","unstructured":"Ganchev , K. , Graca , J. , Blitzer , J. , and Taskar , B . 2008. Multi-view learning over structured and non-identical outputs . In Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence. AUAI Press, 204--211 . Ganchev, K., Graca, J., Blitzer, J., and Taskar, B. 2008. Multi-view learning over structured and non-identical outputs. In Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence. AUAI Press, 204--211."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.756509"},{"key":"e_1_2_1_37_1","volume-title":"Eds","author":"Ghani R.","year":"2003","unstructured":"Ghani , R. , Jones , R. , and Rosenberg , C. , Eds . 2003 . The Continuum from Labeled to Unlabeled Data in Machine Learning and Data Mining. (Workshop, ICML '03). Ghani, R., Jones, R., and Rosenberg, C., Eds. 2003. The Continuum from Labeled to Unlabeled Data in Machine Learning and Data Mining. (Workshop, ICML'03)."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273541"},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of the 16th International Conference on Machine Learning. ACM","author":"Joachims T.","year":"1999","unstructured":"Joachims , T. 1999 . Transductive inference for text classification using support vector machines . In Proceedings of the 16th International Conference on Machine Learning. ACM , New York, 200--209. Joachims, T. 1999. Transductive inference for text classification using support vector machines. In Proceedings of the 16th International Conference on Machine Learning. ACM, New York, 200--209."},{"key":"e_1_2_1_40_1","volume-title":"Proceedings of the 20th International Conference on Machine Learning. AAAI Press, 290--297","author":"Joachims T.","year":"2003","unstructured":"Joachims , T. 2003 . Transductive learning via spectral graph partitioning . In Proceedings of the 20th International Conference on Machine Learning. AAAI Press, 290--297 . Joachims, T. 2003. Transductive learning via spectral graph partitioning. In Proceedings of the 20th International Conference on Machine Learning. AAAI Press, 290--297."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_9"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/11894841_9"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293351"},{"key":"e_1_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Kearns M. and Vazirani U. 1994. An Introduction to Computational Learning Theory. MIT Press Cambridge MA.   Kearns M. and Vazirani U. 1994. An Introduction to Computational Learning Theory. MIT Press Cambridge MA.","DOI":"10.7551\/mitpress\/3897.001.0001"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796551"},{"key":"e_1_2_1_46_1","volume-title":"Proceedings of the 41st IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press","author":"Kleinberg J.","unstructured":"Kleinberg , J. , Sandler , M. , and Slivkins , A . 2004. Network failure detection and graph connectivity . In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press , Los Alamitos, CA, 231--239. Kleinberg, J., Sandler, M., and Slivkins, A. 2004. Network failure detection and graph connectivity. In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 231--239."},{"key":"e_1_2_1_47_1","volume-title":"Proceedings of the 43rd Symposium on Foundations of Computer Science. IEEE Computer Society Press","author":"Klivans A. R.","unstructured":"Klivans , A. R. , O'Donnell , R. , and Servedio , R . 2002. Learning intersections and thresholds of halfspaces . In Proceedings of the 43rd Symposium on Foundations of Computer Science. IEEE Computer Society Press , Los Alamitos, CA, 177--186. Klivans, A. R., O'Donnell, R., and Servedio, R. 2002. Learning intersections and thresholds of halfspaces. In Proceedings of the 43rd Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 177--186."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.930926"},{"key":"e_1_2_1_49_1","unstructured":"Koltchinskii V. 2009. Rademacher complexities and bounding the excess risk in active learning. http:\/\/fodava.gatech.edu\/files\/FODAVA-09-15.pdf.  Koltchinskii V. 2009. Rademacher complexities and bounding the excess risk in active learning. http:\/\/fodava.gatech.edu\/files\/FODAVA-09-15.pdf."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_7"},{"key":"e_1_2_1_51_1","volume-title":"Proceedings of the 19th IEEE International Conference on Computer Vision. IEEE Computer Society Press","author":"Levin A.","unstructured":"Levin , A. , Viola , P. , and Freund , Y . 2003. Unsupervised improvement of visual detectors using co-training . In Proceedings of the 19th IEEE International Conference on Computer Vision. IEEE Computer Society Press , Los Alamitos, CA, 626--633. Levin, A., Viola, P., and Freund, Y. 2003. Unsupervised improvement of visual detectors using co-training. In Proceedings of the 19th IEEE International Conference on Computer Vision. IEEE Computer Society Press, Los Alamitos, CA, 626--633."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63537"},{"key":"e_1_2_1_53_1","volume-title":"Proceedings of the 16th Annual Conference on Computational Learning Theory (COLT). Lecture Notes in Artificial Intelligence","volume":"2777","author":"Mendelson S.","unstructured":"Mendelson , S. , and Philips , P . 2003. Random subclass bounds . In Proceedings of the 16th Annual Conference on Computational Learning Theory (COLT). Lecture Notes in Artificial Intelligence , vol. 2777 , Spinger-Verlag, Berlin, Germany, 329--343. Mendelson, S., and Philips, P. 2003. Random subclass bounds. In Proceedings of the 16th Annual Conference on Computational Learning Theory (COLT). Lecture Notes in Artificial Intelligence, vol. 2777, Spinger-Verlag, Berlin, Germany, 329--343."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/354756.354805"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007692713085"},{"key":"e_1_2_1_56_1","volume-title":"Proceedings of the 7th Pacific-Asia Conference (PAKDD'03)","volume":"2637","author":"Park S.","unstructured":"Park , S. , and Zhang , B . 2003. Large scale unstructured document classification using unlabeled data and syntactic information . In Proceedings of the 7th Pacific-Asia Conference (PAKDD'03) . Lecture Notes in Computer Science , vol. 2637 , Spinger-Verlag, Berlin, Germany, 88--99. Park, S., and Zhang, B. 2003. Large scale unstructured document classification using unlabeled data and syntactic information. In Proceedings of the 7th Pacific-Asia Conference (PAKDD'03). Lecture Notes in Computer Science, vol. 2637, Spinger-Verlag, Berlin, Germany, 88--99."},{"key":"e_1_2_1_57_1","volume-title":"Proceedings of the Conference on Empirical Methods in Natural Language Processing. 1--9. (http:\/\/www.cs.cornell.edu\/home\/pierce\/papers\/emnlp2001","author":"Pierce D.","unstructured":"Pierce , D. , and Cardie , C . 2001. Limitations of co-training for natural language learning from large datasets . In Proceedings of the Conference on Empirical Methods in Natural Language Processing. 1--9. (http:\/\/www.cs.cornell.edu\/home\/pierce\/papers\/emnlp2001 .ps.) Pierce, D., and Cardie, C. 2001. Limitations of co-training for natural language learning from large datasets. In Proceedings of the Conference on Empirical Methods in Natural Language Processing. 1--9. (http:\/\/www.cs.cornell.edu\/home\/pierce\/papers\/emnlp2001.ps.)"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/225298.225348"},{"key":"e_1_2_1_59_1","volume-title":"Proceedings of the 11th International Conference on Artificial Intelligence and Statistics. (http:\/\/www.stat.umn.edu\/~aistat\/proceedings\/start.htm)","author":"Rosenberg D.","unstructured":"Rosenberg , D. , and Bartlett , P . 2007. The Rademacher complexity of co-regularized kernel classes . In Proceedings of the 11th International Conference on Artificial Intelligence and Statistics. (http:\/\/www.stat.umn.edu\/~aistat\/proceedings\/start.htm) Rosenberg, D., and Bartlett, P. 2007. The Rademacher complexity of co-regularized kernel classes. In Proceedings of the 11th International Conference on Artificial Intelligence and Statistics. (http:\/\/www.stat.umn.edu\/~aistat\/proceedings\/start.htm)"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013947519741"},{"key":"e_1_2_1_61_1","unstructured":"Shawe-Taylor J. 2006. Rademacher Analysis and Multi-View Classification. http:\/\/www.gla.ac.uk\/external\/RSS\/RSScomp\/shawe-taylor.pdf.  Shawe-Taylor J. 2006. Rademacher Analysis and Multi-View Classification. http:\/\/www.gla.ac.uk\/external\/RSS\/RSScomp\/shawe-taylor.pdf."},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.705570"},{"key":"e_1_2_1_63_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of 20th International Conference on Algorithmic Learning Theory (ALT)","author":"Simon H.-U.","unstructured":"Simon , H.-U. 2009. Smart pac-learners . In Proceedings of 20th International Conference on Algorithmic Learning Theory (ALT) . Lecture Notes in Computer Science , vol. 5809 , Spinger-Verlag , Berlin, Germany . Simon, H.-U. 2009. Smart pac-learners. In Proceedings of 20th International Conference on Algorithmic Learning Theory (ALT). Lecture Notes in Computer Science, vol. 5809, Spinger-Verlag, Berlin, Germany."},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390280"},{"key":"e_1_2_1_65_1","volume-title":"Proceedings of the 21st Annual Conference on Learning Theory. Omni Press, 403--414","author":"Sridharan K.","unstructured":"Sridharan , K. , and Kakade , S. M . 2008. An information theoretic framework for multi-view learning . In Proceedings of the 21st Annual Conference on Learning Theory. Omni Press, 403--414 . Sridharan, K., and Kakade, S. M. 2008. An information theoretic framework for multi-view learning. In Proceedings of the 21st Annual Conference on Learning Theory. Omni Press, 403--414."},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1162\/153244302760185243"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"},{"key":"e_1_2_1_68_1","volume-title":"Estimation of Dependences Based on Empirical Data","author":"Vapnik V. N.","unstructured":"Vapnik , V. N. 1982. Estimation of Dependences Based on Empirical Data . Springer-Verlag , New York . Vapnik, V. N. 1982. Estimation of Dependences Based on Empirical Data. Springer-Verlag, New York."},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3264-1"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796350"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.5555\/92571.92659"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.3115\/981658.981684"},{"key":"e_1_2_1_73_1","volume-title":"Proceedings of the 18th Annual Conference on Neural Information Processing Systems. MIT Press","author":"Zhou D.","unstructured":"Zhou , D. , Bousquet , O. , Lal , T. N. , Weston , J. , and Schlkopf , B . 2004. Learning with local and global consistency . In Proceedings of the 18th Annual Conference on Neural Information Processing Systems. MIT Press , Cambridge, MA. Zhou, D., Bousquet, O., Lal, T. N., Weston, J., and Schlkopf, B. 2004. Learning with local and global consistency. In Proceedings of the 18th Annual Conference on Neural Information Processing Systems. MIT Press, Cambridge, MA."},{"key":"e_1_2_1_74_1","unstructured":"Zhu X. 2006. Semi-Supervised Learning Literature Survey. Computer Sciences TR 1530 University of Wisconsin -- Madison.  Zhu X. 2006. Semi-Supervised Learning Literature Survey. Computer Sciences TR 1530 University of Wisconsin -- Madison."},{"key":"e_1_2_1_75_1","volume-title":"ICML-2003 Workshop on the Continuum from Labeled to Unlabeled Data in Machine Learning. Omni Press, 912--912","author":"Zhu X.","unstructured":"Zhu , X. , Ghahramani , Z. , and Lafferty , J . 2003a. Combinig active learning and semi-supervised learning using gaussian fields and harmonic functions . In ICML-2003 Workshop on the Continuum from Labeled to Unlabeled Data in Machine Learning. Omni Press, 912--912 . Zhu, X., Ghahramani, Z., and Lafferty, J. 2003a. Combinig active learning and semi-supervised learning using gaussian fields and harmonic functions. In ICML-2003 Workshop on the Continuum from Labeled to Unlabeled Data in Machine Learning. Omni Press, 912--912."},{"key":"e_1_2_1_76_1","unstructured":"Zhu X. Ghahramani Z. and Lafferty J. 2003b. Semi-supervised learning: From gaussian fields to gaussian processes. Tech. rep. Carnegie Mellon University Pittsburg PA.  Zhu X. Ghahramani Z. and Lafferty J. 2003b. Semi-supervised learning: From gaussian fields to gaussian processes. Tech. rep. Carnegie Mellon University Pittsburg PA."},{"key":"e_1_2_1_77_1","volume-title":"Proceedings of the 20th International Conference on Machine Learning. AAAI Press, 912--919","author":"Zhu X.","unstructured":"Zhu , X. , Ghahramani , Z. , and Lafferty , J . 2003c. Semi-supervised learning using gaussian fields and harmonic functions . In Proceedings of the 20th International Conference on Machine Learning. AAAI Press, 912--919 . Zhu, X., Ghahramani, Z., and Lafferty, J. 2003c. Semi-supervised learning using gaussian fields and harmonic functions. In Proceedings of the 20th International Conference on Machine Learning. AAAI Press, 912--919."}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1706591.1706599","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1706591.1706599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:26:20Z","timestamp":1750278380000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1706591.1706599"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":77,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["10.1145\/1706591.1706599"],"URL":"https:\/\/doi.org\/10.1145\/1706591.1706599","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3]]},"assertion":[{"value":"2008-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-03-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}