Journal
NEUROCOMPUTING
Volume 70, Issue 7-9, Pages 1254-1264Publisher
ELSEVIER
DOI: 10.1016/j.neucom.2006.11.012
Keywords
semi-supervised learning; maximum margin; support vector machine; Rademacher complexity; multiview learning
Categories
Ask authors/readers for more resources
In this paper we show that the semi-supervised learning with two input sources can be transformed into a maximum margin problem to be similar to a binary support vector machine. Our formulation exploits the unlabeled data to reduce the complexity of the class of the learning functions. In order to measure how the complexity is decreased we use the Rademacher complexity theory. The corresponding optimization problem is convex and it is efficiently solvable for large-scale applications as well. (c) 2007 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available