Local methods have significant advantages when the probability measure defined on the space of symbolic objects for each class is very complex, but can still be described by a collection of less complex local approximations. We propose a technique of local bagging of decision stumps. We performed a comparison with other well known combining methods using the same base learner, on standard benchmark datasets and the accuracy of the proposed technique was greater in most cases. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Kotsiantis, S. B., Tsekouras, G. E., & Pintelas, P. E. (2005). Local bagging of decision stumps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3533 LNAI, pp. 406–411). Springer Verlag. https://doi.org/10.1007/11504894_57
Mendeley helps you to discover research relevant for your work.