{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T10:54:17Z","timestamp":1763808857128,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,14]],"date-time":"2009-06-14T00:00:00Z","timestamp":1244937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,6,14]]},"DOI":"10.1145\/1553374.1553519","type":"proceedings-article","created":{"date-parts":[[2009,6,16]],"date-time":"2009-06-16T13:34:36Z","timestamp":1245159276000},"page":"1137-1144","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Optimal reverse prediction"],"prefix":"10.1145","author":[{"given":"Linli","family":"Xu","sequence":"first","affiliation":[{"name":"University of Alberta, Edmonton, AB, Canada"}]},{"given":"Martha","family":"White","sequence":"additional","affiliation":[{"name":"University of Alberta, Edmonton, AB, Canada"}]},{"given":"Dale","family":"Schuurmans","sequence":"additional","affiliation":[{"name":"University of Alberta, Edmonton, AB, Canada"}]}],"member":"320","published-online":{"date-parts":[[2009,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_8"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248632"},{"key":"e_1_3_2_1_3_1","volume-title":"Conf. Comput. Learn. Theory (COLT) (pp. 33--44)","author":"Ben-David S.","year":"2008","unstructured":"Ben-David , S. , Lu , T. , &amp; P&aacute; \u00e1l , D. ( 2008 ). Does unlabeled data provably help? Conf. Comput. Learn. Theory (COLT) (pp. 33--44) . Ben-David, S., Lu, T., &amp; P&aacute;\u00e1l, D. (2008). Does unlabeled data provably help? Conf. Comput. Learn. Theory (COLT) (pp. 33--44)."},{"key":"e_1_3_2_1_4_1","volume-title":"Pattern recognition and machine learning","author":"Bishop C.","year":"2006","unstructured":"Bishop , C. ( 2006 ). Pattern recognition and machine learning . Springer . Bishop, C. (2006). Pattern recognition and machine learning. Springer."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/279943.279962"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. 12 (NIPS) (pp. 421--427)","author":"Chapelle O.","year":"1999","unstructured":"Chapelle , O. , Vapnik , V. , &amp; Weston , J. ( 1999 ). Transductive inference for estimating values of functions. Adv. Neural Info . Proc. 12 (NIPS) (pp. 421--427) . Chapelle, O., Vapnik, V., &amp; Weston, J. (1999). Transductive inference for estimating values of functions. Adv. Neural Info. Proc. 12 (NIPS) (pp. 421--427)."},{"key":"e_1_3_2_1_7_1","volume-title":"CRM Proceedings and Lecture Notes of the Amer. Math. Soc.","author":"Chen H.-R.","year":"2008","unstructured":"Chen , H.-R. , &amp; Peng , J. ( 2008 ). 0-1 semidefinite programming for graph-cut clustering . In CRM Proceedings and Lecture Notes of the Amer. Math. Soc. Chen, H.-R., &amp; Peng, J. (2008). 0-1 semidefinite programming for graph-cut clustering. In CRM Proceedings and Lecture Notes of the Amer. Math. Soc."},{"key":"e_1_3_2_1_8_1","volume-title":"O. Chapelle, B. Scholk&ouml;\u00f6pf and A","author":"Corduneanu A.","year":"2006","unstructured":"Corduneanu , A. , &amp; Jaakkola ., T. ( 2006 ). Data dependent regularization . In O. Chapelle, B. Scholk&ouml;\u00f6pf and A . Zien (Eds.), Semi-supervised learning, 163--182. MIT Press . Corduneanu, A., &amp; Jaakkola., T. (2006). Data dependent regularization. In O. Chapelle, B. Scholk&ouml;\u00f6pf and A. Zien (Eds.), Semi-supervised learning, 163--182. MIT Press."},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. Sys. 19 (NIPS) (pp. 305--312)","author":"Cortes C.","year":"2006","unstructured":"Cortes , C. , &amp; Mohri , M. ( 2006 ). On transductive regression. Adv. Neural Info . Proc. Sys. 19 (NIPS) (pp. 305--312) . Cortes, C., &amp; Mohri, M. (2006). On transductive regression. Adv. Neural Info. Proc. Sys. 19 (NIPS) (pp. 305--312)."},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. Sys. 16 (NIPS) (pp. 73--80)","author":"De Bie T.","year":"2003","unstructured":"De Bie , T. , &amp; Cristianini , N. ( 2003 ). Convex methods for transduction. Adv. Neural Info . Proc. Sys. 16 (NIPS) (pp. 73--80) . De Bie, T., &amp; Cristianini, N. (2003). Convex methods for transduction. Adv. Neural Info. Proc. Sys. 16 (NIPS) (pp. 73--80)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014118"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015408"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceed. Inter. Conf. on Machine Learning (ICML).","author":"Joachims T.","year":"1999","unstructured":"Joachims , T. ( 1999 ). Transductive inference for text classification using support vector machines . Proceed. Inter. Conf. on Machine Learning (ICML). Joachims, T. (1999). Transductive inference for text classification using support vector machines. Proceed. Inter. Conf. on Machine Learning (ICML)."},{"key":"e_1_3_2_1_14_1","volume-title":"Inter. Conf. Mach. Learn. (ICML) (pp. 290--297)","author":"Joachims T.","year":"2003","unstructured":"Joachims , T. ( 2003 ). Transductive learning via spectral graph partitioning . Inter. Conf. Mach. Learn. (ICML) (pp. 290--297) . Joachims, T. (2003). Transductive learning via spectral graph partitioning. Inter. Conf. Mach. Learn. (ICML) (pp. 290--297)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1080\/00031305.1999.10474488","article-title":"On a relation between principal components and regression analysis","volume":"53","author":"Jong J.-C.","year":"1999","unstructured":"Jong , J.-C. , &amp; Kotz , S. ( 1999 ). On a relation between principal components and regression analysis . The American Statistician , 53 , 349 -- 351 . Jong, J.-C., &amp; Kotz, S. (1999). On a relation between principal components and regression analysis. The American Statistician, 53, 349--351.","journal-title":"The American Statistician"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","DOI":"10.1007\/1-84628-158-X","volume-title":"Subspace methods for system identification","author":"Katayama T.","year":"2005","unstructured":"Katayama , T. ( 2005 ). Subspace methods for system identification . Springer . Katayama, T. (2005). Subspace methods for system identification. Springer."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-008-5084-4"},{"key":"e_1_3_2_1_19_1","volume-title":"Berkeley Symp. on Math. Stats. and Prob (pp. 281--297)","author":"MacQueen J.","year":"1967","unstructured":"MacQueen , J. ( 1967 ). Some methods for classification and analysis of multivariate observations . Berkeley Symp. on Math. Stats. and Prob (pp. 281--297) . MacQueen, J. (1967). Some methods for classification and analysis of multivariate observations. Berkeley Symp. on Math. Stats. and Prob (pp. 281--297)."},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. Sys. 11 (NIPS) (pp. 536--542)","author":"Mika S.","year":"1998","unstructured":"Mika , S. , Sch\u00f6lkopf , B. , Smola , A. , M\u00fcller , K.-R. , Scholz , M. , &amp; R&auml; \u00e4tsch G. ( 1998 ). Kernel PCA and de-noising in feature spaces. Adv. Neural Info . Proc. Sys. 11 (NIPS) (pp. 536--542) . Mika, S., Sch\u00f6lkopf, B., Smola, A., M\u00fcller, K.-R., Scholz, M., &amp; R&auml;\u00e4tsch G. (1998). Kernel PCA and de-noising in feature spaces. Adv. Neural Info. Proc. Sys. 11 (NIPS) (pp. 536--542)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/050641983"},{"key":"e_1_3_2_1_22_1","volume-title":"Learning with kernels","author":"Sch\u00f6lkopf B.","year":"2002","unstructured":"Sch\u00f6lkopf , B. , &amp; Smola , A. ( 2002 ). Learning with kernels . MIT Press . Sch\u00f6lkopf, B., &amp; Smola, A. (2002). Learning with kernels. MIT Press."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102455"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.3115\/1219840.1219884"},{"key":"e_1_3_2_1_26_1","volume-title":"On semidefinite relaxation for normalized k-cut and connections to spectral clustering. TR CSD-03-1265","author":"Xing E.","year":"2003","unstructured":"Xing , E. , &amp; Jordan , M. ( 2003 ). On semidefinite relaxation for normalized k-cut and connections to spectral clustering. TR CSD-03-1265 , Berkeley . Xing, E., &amp; Jordan, M. (2003). On semidefinite relaxation for normalized k-cut and connections to spectral clustering. TR CSD-03-1265, Berkeley."},{"key":"e_1_3_2_1_27_1","volume-title":"Proc. Sys. 17 (NIPS) (pp. 1537--1544)","author":"Xu L.","year":"2004","unstructured":"Xu , L. , Neufeld , J. , Larson , B. , &amp; Schuurmans , D. ( 2004 ). Maximum margin clustering. Adv. Neural Info . Proc. Sys. 17 (NIPS) (pp. 1537--1544) . Xu, L., Neufeld, J., Larson, B., &amp; Schuurmans, D. (2004). Maximum margin clustering. Adv. Neural Info. Proc. Sys. 17 (NIPS) (pp. 1537--1544)."},{"key":"e_1_3_2_1_28_1","volume-title":"Semi-supervised learning, 221--232","author":"Zhou D.","year":"2006","unstructured":"Zhou , D. , &amp; Sch &ouml;\u00f6lkopf, B. ( 2006 ). Discrete regularization . In O. Chapelle, B. Scholk\u00f6pf and A. Zien (Eds.), Semi-supervised learning, 221--232 . MIT Press . Zhou, D., &amp; Sch&ouml;\u00f6lkopf, B. (2006). Discrete regularization. In O. Chapelle, B. Scholk\u00f6pf and A. Zien (Eds.), Semi-supervised learning, 221--232. MIT Press."},{"key":"e_1_3_2_1_29_1","volume-title":"U. Wisconsin, CS Dept.","author":"Zhu X.","year":"2005","unstructured":"Zhu , X. ( 2005 ). Semi-supervised learning literature survey. TR 1530 , U. Wisconsin, CS Dept. Zhu, X. (2005). Semi-supervised learning literature survey. TR 1530, U. Wisconsin, CS Dept."}],"event":{"name":"ICML '09: The 26th Annual International Conference on Machine Learning held in conjunction with the 2007 International Conference on Inductive Logic Programming","sponsor":["NSF","Microsoft Research Microsoft Research","MITACS"],"location":"Montreal Quebec Canada","acronym":"ICML '09"},"container-title":["Proceedings of the 26th Annual International Conference on Machine Learning"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1553374.1553519","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1553374.1553519","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:39Z","timestamp":1750253379000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1553374.1553519"}},"subtitle":["a unified perspective on supervised, unsupervised and semi-supervised learning"],"short-title":[],"issued":{"date-parts":[[2009,6,14]]},"references-count":28,"alternative-id":["10.1145\/1553374.1553519","10.1145\/1553374"],"URL":"https:\/\/doi.org\/10.1145\/1553374.1553519","relation":{},"subject":[],"published":{"date-parts":[[2009,6,14]]},"assertion":[{"value":"2009-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}