Semi-supervised random forests

Proceedings of the IEEE International Conference on Computer Vision

Volumn , Issue , 2009, Pages 506-513

  Leistner, Christian ^a   Saffari, Amir ^a   Santner, Jakob ^a   Bischof, Horst ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CALTECH; COMPUTER VISION APPLICATIONS; CONSTANT IMPROVEMENT; CONTROL MECHANISM; DETERMINISTIC ANNEALING; LOSS FUNCTIONS; MACHINE LEARNING PROBLEM; MULTI-CLASS; OBJECT CATEGORIZATION; OPTIMIZATION VARIABLES; RANDOM FORESTS; SEMI-SUPERVISED; SEMI-SUPERVISED LEARNING; TRAINING ALGORITHMS; UNLABELED DATA; UNLABELED SAMPLES;

COMPUTATIONAL EFFICIENCY; COMPUTER APPLICATIONS; COMPUTER VISION; LEARNING ALGORITHMS; OPTIMIZATION; SUPERVISED LEARNING;

DECISION TREES;

EID: 77953196183     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2009.5459198     Document Type: Conference Paper

References (21)

1. M. Belkin, P. Niyogi, and V. Sindhwani. Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. JMLR, 7:2399-2434, 2006.
2. A. Bosch, A. Zisserman, and X. Munoz. Image classification using random forests and ferns. In ICCV, 2007.
3. L. Breiman. Out-of-bag estimates. Technical report, 1996.
4. L. Breiman. Random forests. Machine Learning, 2001.
5. C.-C. Chang and C.-J. Lin. Libsvm: a library for support vector machines. Software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm, 2001.
6. O. Chapelle, B. Schölkopf, and A. Zien, editors. Semi-Supervised Learning. Cambridge, MA, 2006.
7. O. Chapelle, J. Weston, and B. Schölkopf. Cluster kernels for semi-supervised learning. In NIPS, volume 15 of NIPS, pages 585-592, 2003.
8. T. Joachims. Transductive inference for text classification using support vector machines. In ICML, pages 200-209, 1999.
9. C. C. Kemp, T. L. Griffiths, S. Stromsten, and J. B. Tenenbaum. Semi-supervised learning with trees. In NIPS, 2004.
10. Y. Lin. A note on margin-based loss functions in classification. Statistics & Probability Letters, 68(1):73-82, June 2004.
11. G. S. Mann and A. Mccallum. Simple, robust, scalable semi-supervised learning via expectation regularization. In ICML, pages 593-600, 2007.
12. F. Moosmann, B. Triggs, and F. Jurie. Fast discriminative visual codebooks using randomized clustering forests. In NIPS, pages 985-992, 2006.
13. K. Rose. Deterministic annealing, constrained clustering, and optimization. In IJCNN, 1998.
14. A. Saffari, H. Grabner, and H. Bischof. Serboost: Semi-supervised boosting with expectation regularization. In ECCV, pages 588-601, October 2008.
15. A. Saffari, C. Leistner, and H. Bischof. Regularized multi-class semi-supervised boosting. In CVPR, 2009.
16. T. Sharp. Implementing decision trees and forests on a gpu. In ECCV, 2008.
17. V. Sindhwani, S. S. Keerthi, and O. Chapelle. Deterministic annealing for semi-supervised kernel machines. In ICML, 2006.
18. A. Singh, R. D. Nowak, and X. Zhu. Unlabeled data: Now it helps, now it doesn't. In NIPS, 2008.
19. X. Zhu. Semi-supervised learning literature survey. Technical Report 1530, Computer Sciences, University of Wisconsin-Madison, 2005.
20. X. Zhu and Z. Ghahramani. Learning from labeled and unlabeled data with label propagation. Technical report, 2002.
21. H. Zou, J. Zhu, and T. Hastie. New multi-category boosting algorithms based on multi-category fisher-consistent losses. Annals of Applied Statistics, 2008.