Ensemble Manifold Regularization
- Publisher:
- IEEE
- Publication Type:
- Conference Proceeding
- Citation:
- IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2009, pp. 2396 - 2402
- Issue Date:
- 2009-01
Closed Access
Filename | Description | Size | |||
---|---|---|---|---|---|
![]() | 2011001872OK.pdf | 628.17 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
We propose an automatic approximation of the intrinsic manifold for general semi-supervised learning problems. Unfortunately, it is not trivial to define an optimization function to obtain optimal hyperparameters. Usually, pure cross-validation is considered but it does not necessarily scale up. A second problem derives from the suboptimality incurred by discrete grid search and overfitting problems. As a consequence, we developed an ensemble manifold regularization (EMR) framework to approximate the intrinsic manifold by combining several initial guesses. Algorithmically, we designed EMR very carefully so that it (a) learns both the composite manifold and the semi-supervised classifier jointly; (b) is fully automatic for learning the intrinsic manifold hyperparameters implicitly; (c) is conditionally optimal for intrinsic manifold approximation under a mild and reasonable assumption; and (d) is scalable for a large number of candidate manifold hyperparameters, from both time and space perspectives. Extensive experiments over both synthetic and real datasets show the effectiveness of the proposed framework.
Please use this identifier to cite or link to this item: