Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
535603 | Pattern Recognition Letters | 2005 | 12 Pages |
Abstract
This paper is concerned with transductive learning. We study a recent transductive learning approach based on clustering. In this approach one constructs a diversity of unsupervised models of the unlabeled data using clustering algorithms. These models are then exploited to construct a number of hypotheses using the labeled data and the learner selects an hypothesis that minimizes a transductive error bound, which holds with high probability. Empirical examination of this approach, implemented with ‘spectral clustering’, on a suite of benchmark datasets from the UCI repository, indicates that the new approach is effective and comparable with one of the best known transductive learning algorithms to-date.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Vision and Pattern Recognition
Authors
Ran El-Yaniv, Leonid Gerzon,