Co-EM support vector learning

Multi-view algorithms, such as co-training and co-EM, utilize unlabeled data when the available attributes can be split into independent and compatible subsets. Co-EM outperforms co-training for many problems, but it requires the underlying learner to estimate class probabilities, and to learn from probabilistically labeled data. Therefore, coEM has so far only been studied with naive Bayesian learners. We cast linear classifiers into a probabilistic framework and develop a co-EM version of the Support Vector Machine. We conduct experiments on text classification problems and compare the family of semi-supervised support vector algorithms under different conditions, including violations of the assumptions underlying multiview learning. For some problems, such as course web page classification, we observe the most accurate results reported so far.

• Type: Conference
• Year: 2004
• Where: ICML
• Authors: Ulf Brefeld, Tobias Scheffer
• Keywords: Co-EM Outperforms Co-training, ICML 2004, Machine Learning, Semi-Supervised Support Vector, Text Classification Problems