A decision-theoretic generalization of on-line learning and an application to boosting
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
A simple, fast, and effective rule learner
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Improved Boosting Algorithms Using Confidence-rated Predictions
Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Robust Real-Time Face Detection
International Journal of Computer Vision
Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)
Learning trees and rules with set-valued features
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Transparent, online image pattern classification using a learning classifier system
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part I
A robust ranking methodology based on diverse calibration of AdaBoost
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part I
MIRAGE'11 Proceedings of the 5th international conference on Computer vision/computer graphics collaboration techniques
Boosting for transfer learning from multiple data sources
Pattern Recognition Letters
Palmprint classification using wavelets and adaboost
ISNN'10 Proceedings of the 7th international conference on Advances in Neural Networks - Volume Part II
MULTIBOOST: a multi-purpose boosting package
The Journal of Machine Learning Research
Peer-to-peer multi-class boosting
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
Embedding monte carlo search of features in tree-based ensemble methods
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
Hierarchical spatiotemporal feature extraction using recurrent online clustering
Pattern Recognition Letters
| Hi-index | 0.00 |
In this paper we show how to boost products of simple base learners. Similarly to trees, we call the base learner as a subroutine but in an iterative rather than recursive fashion. The main advantage of the proposed method is its simplicity and computational efficiency. On benchmark datasets, our boosted products of decision stumps clearly outperform boosted trees, and on the MNIST dataset the algorithm achieves the second best result among no-domain-knowledge algorithms after deep belief nets. As a second contribution, we present an improved base learner for nominal features and show that boosting the product of two of these new subset indicator base learners solves the maximum margin matrix factorization problem used to formalize the collaborative filtering task. On a small benchmark dataset, we get experimental results comparable to the semi-definite-programming-based solution but at a much lower computational cost.