C4.5: programs for machine learning
C4.5: programs for machine learning
Machine Learning
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
Machine Learning
On the Boosting Pruning Problem
ECML '00 Proceedings of the 11th European Conference on Machine Learning
Pruning and dynamic scheduling of cost-sensitive ensembles
Eighteenth national conference on Artificial intelligence
Combining Pattern Classifiers: Methods and Algorithms
Combining Pattern Classifiers: Methods and Algorithms
Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)
Ensemble Pruning Via Semi-definite Programming
The Journal of Machine Learning Research
An Analysis of Ensemble Pruning Techniques Based on Ordered Aggregation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Focused Ensemble Selection: A Diversity-Based Method for Greedy Ensemble Selection
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Predictive Ensemble Pruning by Expectation Propagation
IEEE Transactions on Knowledge and Data Engineering
Constraint projections for ensemble learning
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Ensemble pruning via base-classifier replacement
WAIM'11 Proceedings of the 12th international conference on Web-age information management
Hi-index | 0.00 |
Ensemble selection copes with the reduction of an ensemble of the predictive models to reduce its response time and increase its accuracy. A number of selection methods via greedy search of the space of all possible ensemble subsets have been recently proposed. The major issue of these algorithms is to construct an effective metric to supervise the search process. In this paper, we view the issue of ensemble problem from a new viewpoint: energy-based learning, and then contribute a novel metric called EBM (Energy-based Metric) to guide the search. Also, this metric takes into account the strength of the decision of the current ensemble. Empirical results show that using the proposed metric to select subensemble leads to significantly better accuracy results compared to state-of-the-art metrics.