Multi-View Learning over Structured and Non-Identical Outputs

Loading...
Thumbnail Image
Penn collection
Lab Papers (GRASP)
Degree type
Discipline
Subject
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Graca, Joao V
Blitzer, John
Contributor
Abstract

In many machine learning problems, labeled training data is limited but unlabeled data is ample. Some of these problems have instances that can be factored into multiple views, each of which is nearly sufficient in determining the correct labels. In this paper we present a new algorithm for probabilistic multi-view learning which uses the idea of stochastic agreement between views as regularization. Our algorithm works on structured and unstructured problems and easily generalizes to partial agreement scenarios. For the full agreement case, our algorithm minimizes the Bhattacharyya distance between the models of each view, and performs better than CoBoosting and two-view Perceptron on several at and structured classification problems.

Advisor
Date of presentation
2008-07-09
Conference name
Lab Papers (GRASP)
Conference dates
2023-05-17T03:10:39.000
Conference location
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Reprinted from: Kuzman Ganchev, João Graça, John Blitzer, Benjamin Taskar. Multi-View Learning over Structured and Non-Identical Outputs. In UAI 2008, Proceedings of the 24th Conference in Uncertainty in Artificial Intelligence, July 9-12, 2008, Helsinki, Finland 2008
Recommended citation
Collection