Optimal reverse prediction: A unified perspective on supervised, unsupervised and semi-supervised learning

ACM International Conference Proceeding Series

Volumn 382, Issue , 2009, Pages

  Xu, Linli ^a   White, Martha ^a   Schuurmans, Dale ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

K-MEANS CLUSTERING; LEAST SQUARE; MODEL PARAMETERS; NON-LINEAR; NORMALIZED GRAPH; PRINCIPAL COMPONENTS ANALYSIS; SEMI-SUPERVISED; SEMI-SUPERVISED LEARNING; SEMISUPERVISED LEARNING ALGORITHM; STATE OF THE ART; UNSUPERVISED TRAINING;

EDUCATION; LABELS; OPTIMIZATION; PRINCIPAL COMPONENT ANALYSIS; ROBOT LEARNING; SUPERVISED LEARNING;

LEARNING ALGORITHMS;

EID: 70049097251     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1553374.1553519     Document Type: Conference Paper

References (29)

1. Balcan, M.-F.,&Blum, A. (2005). A PAC-style model for learning from labeled and unlabeled data. Conf. Comput. Learn. Theory (COLT) (pp. 111-126).
2. Belkin, M., Niyogi, P.,&Sindhwani, V. (2006). Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. Journal of Machine Learning Research, 7, 2399-2434.
3. Ben-David, S., Lu, T.,&Pál, D. (2008). Does unlabeled data provably help? Conf. Comput. Learn. Theory (COLT) (pp. 33-44).
4. Bishop, C. (2006). Pattern recognition and machine learning. Springer.
5. Blum, A.,&Mitchell, T. (1998). Combining labeled and unlabeled data with co-training. Conf. Comput. Learn. Theory (COLT) (pp. 92-100).
6. Chapelle, O., Vapnik, V.,&Weston, J. (1999). Transductive inference for estimating values of functions. Adv. Neural Info. Proc. 12 (NIPS) (pp. 421-427).
7. Chen, H.-R.,&Peng, J. (2008). 0-1 semidefinite programming for graph-cut clustering. In CRM Proceedings and Lecture Notes of the Amer. Math. Soc.
8. Corduneanu, A.,&Jaakkola., T. (2006). Data dependent regularization. In O. Chapelle, B. Scholköpf and A. Zien (Eds.), Semi-supervised learning, 163-182. MIT Press.
9. Cortes, C.,&Mohri, M. (2006). On transductive regression. Adv. Neural Info. Proc. Sys. 19 (NIPS) (pp. 305-312).
10. De Bie, T.,&Cristianini, N. (2003). Convex methods for transduction. Adv. Neural Info. Proc. Sys. 16 (NIPS) (pp. 73-80).
11. Dhillon, I. S., Guan, Y.,&Kulis, B. (2004). Kernel k-means: spectral clustering and normalized cuts. Know. Disc. Data Mining (KDD) (pp. 551-556).
12. Ding, C.,&He, X. (2004). K-means clustering via principal component analysis. Inter. Conf. Mach. Learn. (ICML) (pp. 225-232).
13. Joachims, T. (1999). Transductive inference for text classification using support vector machines. Proceed. Inter. Conf. on Machine Learning (ICML).
14. Joachims, T. (2003). Transductive learning via spectral graph partitioning. Inter. Conf. Mach. Learn. (ICML) (pp. 290-297).
15. Jong, J.-C.,&Kotz, S. (1999). On a relation between principal components and regression analysis. The American Statistician, 53, 349-351.
16. Katayama, T. (2005). Subspace methods for system identification. Springer.
17. Klein, D. (2004). The unsupervised learning of natural language structure. Doctoral dissertation, Stanford.
18. Kulis, B., Basu, S.,&Dhillon, I. (2009). Semisupervised graph clustering: A kernel approach. Machine Learning, 74, 1-22.
19. MacQueen, J. (1967). Some methods for classification and analysis of multivariate observations. Berkeley Symp. on Math. Stats. and Prob (pp. 281-297).
20. Mika, S., Schölkopf, B., Smola, A., Müller, K.-R., Scholz, M.,&Rätsch G. (1998). Kernel PCA and de-noising in feature spaces. Adv. Neural Info. Proc. Sys. 11 (NIPS) (pp. 536-542).
21. Peng, J.,&Wei, Y. (2007). Approximating k-meanstype clustering via semidefinite programming. SIAM Journal on Optimization, 186 - 205.
22. Schölkopf, B.,&Smola, A. (2002). Learning with kernels. MIT Press.
23. Shi, J.,&Malik, J. (2000). Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. and Mach. Intell., 22, 888-905.
24. Sindhwani, V., Niyogi, P.,&Belkin, M. (2005). Beyond the point cloud: from transductive to semisupervised learning. Inter. Conf. Mach. Learn. (ICML) (pp. 824-831).
25. Smith, N.,&Eisner, J. (2005). Contrastive estimation: Training log-linear models on unlabeled data. Conf. Assoc. Comput. Ling. (ACL) (pp. 354-362).
26. Xing, E.,&Jordan, M. (2003). On semidefinite relaxation for normalized k-cut and connections to spectral clustering. TR CSD-03-1265, Berkeley.
27. Xu, L., Neufeld, J., Larson, B.,&Schuurmans, D. (2004). Maximum margin clustering. Adv. Neural Info. Proc. Sys. 17 (NIPS) (pp. 1537-1544).
28. Zhou, D.,&Schölkopf, B. (2006). Discrete regularization. In O. Chapelle, B. Scholköpf and A. Zien (Eds.), Semi-supervised learning, 221-232. MIT Press.
29. Zhu, X. (2005). Semi-supervised learning literature survey. TR 1530, U. Wisconsin, CS Dept.