A Comparison of the Bagging and the Boosting Methods Using the Decision Trees Classifiers

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

• Type: Journal
• Year: 2006
• Where: COMSIS
• Authors: Kristína Machova, Miroslav Puszta, Frantisek Barcák, Peter Bednár
• Keywords: Boosting, Classification Algorithms, COMSIS 2006, Decision Trees