Nothing Special   »   [go: up one dir, main page]

Computer Science and Information Systems 2006 Volume 3, Issue 2, Pages: 57-72
https://doi.org/10.2298/CSIS0602057M
Full text ( 206 KB)
Cited by


A comparison of the bagging and the boosting methods using the decision trees classifiers

Machova Kristina (Department of Cybernetics and Artificial Intelligence, Technical University, Košice, Slovakia)
Puszta Miroslav (Department of Cybernetics and Artificial Intelligence, Technical University, Košice, Slovakia)
Barčak František (Department of Cybernetics and Artificial Intelligence, Technical University, Košice, Slovakia)
Bednar Peter (Department of Cybernetics and Artificial Intelligence, Technical University, Košice, Slovakia)

In this paper we present an improvement of the precision of classification algorithm results. Two various approaches are known: bagging and boosting. This paper describes a set of experiments with bagging and boosting methods. Our use of these methods aims at classification algorithms generating decision trees. Results of performance tests focused on the use of the bagging and boosting methods in connection with binary decision trees are presented. The minimum number of decision trees, which enables an improvement of the classification performed by the bagging and boosting methods, was found. The tests were carried out using the Reuter’s 21578 collection of documents as well as documents from an Internet portal of TV broadcasting company Markíza. The comparison of our results on testing the bagging and boosting algorithms is presented.