DocumentCode :
3138915
Title :
New Boosting Approach Using Probabilistic Results Expression
Author :
Kolesnikova, Anastasiya ; Seo, Dong-Hun ; Won Don Lee
Author_Institution :
Dept. of Comput. Sci., Chungnam Nat. Univ., Daejeon
fYear :
2008
fDate :
13-15 Oct. 2008
Firstpage :
228
Lastpage :
232
Abstract :
Classification, which is the task of assigning object (event) to one of several predefined classes, is an important problem in the field of machine learning and data mining. Boosting based technique use deterministic results of weak classifiers to compound them to a strong classifier while classifier can give class distribution as result. It involves losses of information. This problem can be solved by using probabilistic idea. In this case class distribution is used to compound classifiers. Probabilistic results compounding is presented in this paper applying to incremental learning. Probabilistic results expression is easily realized using extended data expression. Results of experiments show power when compare to Learn++, an incremental ensemble-based algorithm.
Keywords :
pattern classification; probability; boosting approach; data mining; incremental learning; machine learning; predefined classes; probabilistic results compounding; probabilistic results expression; Application software; Boosting; Classification algorithms; Classification tree analysis; Computer errors; Computer science; Decision trees; Rain; Training data; Voting; Data Mining; decision tree;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science and its Applications, 2008. CSA '08. International Symposium on
Conference_Location :
Hobart, ACT
Print_ISBN :
978-0-7695-3428-2
Type :
conf
DOI :
10.1109/CSA.2008.63
Filename :
4654091
Link To Document :
بازگشت