ManifoldBoost: Stagewise Function Approximation for Fully-, Semi- and Un-Supervised Learning
Abstract
We describe a manifold learning framework that naturally accommodates supervised learning manifold learning, partially supervised learning and unsupervised clustering as particular cases. Our method chooses a function by minimizing loss subject to a manifold regularization penalty. This augmented cost is minimized using a greedy stagewise functional minimization procedure, as in Gradientboost. Each stage of boosting is fast and efficient. We demonstrate our approach using both radial basis function approximations and classification trees. The performance of our method is at the state of the art on standard problems.
Cite
Text
Loeff et al. "ManifoldBoost: Stagewise Function Approximation for Fully-, Semi- and Un-Supervised Learning." International Conference on Machine Learning, 2008. doi:10.1145/1390156.1390232Markdown
[Loeff et al. "ManifoldBoost: Stagewise Function Approximation for Fully-, Semi- and Un-Supervised Learning." International Conference on Machine Learning, 2008.](https://mlanthology.org/icml/2008/loeff2008icml-manifoldboost/) doi:10.1145/1390156.1390232BibTeX
@inproceedings{loeff2008icml-manifoldboost,
title = {{ManifoldBoost: Stagewise Function Approximation for Fully-, Semi- and Un-Supervised Learning}},
author = {Loeff, Nicolas and Forsyth, David A. and Ramachandran, Deepak},
booktitle = {International Conference on Machine Learning},
year = {2008},
pages = {600-607},
doi = {10.1145/1390156.1390232},
url = {https://mlanthology.org/icml/2008/loeff2008icml-manifoldboost/}
}