A Fast Ensemble Pruning Algorithm Based on Pattern Mining Process
Abstract
Ensemble pruning deals with the reduction of base classifiers prior to combination in order to improve generalization and prediction efficiency. Existing ensemble pruning algorithms require much pruning time. This paper presents a fast pruning approach: PMEP (Pattern Mining based Ensemble Pruning). In this algorithm, the prediction results of all base classifiers are organized as a transaction database, and FP-Tree structure is used to compact the prediction results. Then a greedy pattern mining method is explored to find the ensemble of size k . After obtaining the ensembles of all possible sizes, the one with the best accuracy is outputted. Compared with Bagging, GASEN, and Forward Selection, experimental results show that PMEP achieves the best prediction accuracy and keeps the size of the final ensemble small, more importantly, its pruning time is much less than other ensemble pruning algorithms.
Cite
Text
Zhao et al. "A Fast Ensemble Pruning Algorithm Based on Pattern Mining Process." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2009. doi:10.1007/978-3-642-04180-8_19Markdown
[Zhao et al. "A Fast Ensemble Pruning Algorithm Based on Pattern Mining Process." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2009.](https://mlanthology.org/ecmlpkdd/2009/zhao2009ecmlpkdd-fast/) doi:10.1007/978-3-642-04180-8_19BibTeX
@inproceedings{zhao2009ecmlpkdd-fast,
title = {{A Fast Ensemble Pruning Algorithm Based on Pattern Mining Process}},
author = {Zhao, Qiang-Li and Jiang, Yan-Huang and Xu, Ming},
booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
year = {2009},
pages = {34},
doi = {10.1007/978-3-642-04180-8_19},
url = {https://mlanthology.org/ecmlpkdd/2009/zhao2009ecmlpkdd-fast/}
}