Active + Semi-supervised Learning = Robust Multi-View Learning

In a multi-view problem, the features of the domain can be partitioned into disjoint subsets (views) that are sufficient to learn the target concept. Semi-supervised, multi-view algorithms, which reduce the amount of labeled data required for learning, rely on the assumptions that the views are compatible and uncorrelated (i.e., every example is identically labeled by the target concepts in each view; and, given the label of any example, its descriptions in each view are independent). As these assumptions are unlikely to hold in practice, it is crucial to understand the behavior of multi-view algorithms on problems with incompatible, correlated views. We address this issue by studying several algorithms on a parameterized family of text classification problems in which we control both view correlation and incompatibility. We first show that existing semi-supervised algorithms are not robust over the whole spectrum of parameterized problems. Then we introduce a new multi-view algorithm...

• Type: Conference
• Year: 2002
• Where: ICML
• Authors: Ion Muslea, Steven Minton, Craig A. Knoblock
• Keywords: ICML 2002, Machine Learning, Multi-view Algorithms, Parameterized Problems, Semi-supervised Algorithms