Bayesian Co-Training

We propose a Bayesian undirected graphical model for co-training, or more generally for semi-supervised multi-view learning. This makes explicit the previously unstated assumptions of a large class of co-training type algorithms, and also clarifies the circumstances under which these assumptions fail. Building upon new insights from this model, we propose an improved method for co-training, which is a novel co-training kernel for Gaussian process classifiers. The resulting approach is convex and avoids local-maxima problems, unlike some previous multi-view learning methods. Furthermore, it can automatically estimate how much each view should be trusted, and thus accommodate noisy or unreliable views. Experiments on toy data and real world data sets illustrate the benefits of this approach.

• Type: Conference
• Year: 2007
• Where: NIPS
• Authors: Shipeng Yu, Balaji Krishnapuram, Rómer Rosales, Harald Steck, R. Bharat Rao
• Keywords: Co-training, Co-training Type Algorithms, Information Technology, Multi-view Learning, NIPS 2007