Analysis of semi-supervised learning with the Yarowsky algorithm

Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence, UAI 2007

Volumn , Issue , 2007, Pages 159-166

  Haffari, Gholam Reza ^a   Sarkar, Anoop ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BREGMAN DISTANCES; CROSS ENTROPY; GRAPH-BASED; OBJECTIVE FUNCTIONS; RULE BASED; SEMI-SUPERVISED LEARNING;

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL LINGUISTICS; HARMONIC FUNCTIONS; PROBABILITY DISTRIBUTIONS; SUPERVISED LEARNING; UNCERTAINTY ANALYSIS;

LEARNING ALGORITHMS;

EID: 79951928974     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. S. Abney (2002). Bootstrapping, In ACL 2002.
2. S. Abney (2004). Understanding the Yarowsky Algorithm, Computational Linguistics 30(3):365-395.
3. A. Blum and S. Chawla (2001). Learning from Labeled and Unlabeled Data using Graph Mincut, In ICML 2001.
4. A. Blum and T. Mitchell (1998). Combining Labeled and Unlabeled Data with Co-Training, In COLT 1999.
5. A. Corduneanu (2006). The Information Regularization Framework for Semi-Supervised Learning, Ph.D. thesis, MIT.
6. S. Dasgupta, M. Littman and D. McAllester (2001). PAC generalization bounds for co-training. In NIPS 2001.
7. Y. Grandvalet and Y. Bengio (2005). Semi-supervised learning by Entropy Minimization. In NIPS 2005.
8. G. Hinton (1999). Products of experts, In Proc. of the Ninth Int'l Conference on Artificial Neural Networks.
9. J. Lafferty, S. Della Pietra, and V. Della Pietra (1997). Statistical Learning Algorithms based on Bregman Distances, In Proc. of Canadian Workshop on Information Theory.
10. D. Yarowsky (1995). Unsupervised word sense disambiguation rivaling supervised methods. In ACL-1995.
11. X. Zhu, Z. Ghahramani, and J. Lafferty (2003). Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions, In ICML-2003.