Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.12188/21234
Title: Probabilistic predictions of ensemble of classifiers combined with dynamically weighted majority vote
Authors: Zdravevski, Eftim 
Kulakov, Andrea 
Kalajdziski, Slobodan 
Davchev, Dancho 
Keywords: machine learning, prediction methods, pattern classification, decision-making
Issue Date: Feb-2011
Publisher: IASTED, Acta Press
Conference: Proceedings of Artificial Intelligence and Applications 2011
Abstract: This paper presents a new method for dynamic calculation of weights that can be used in the process of aggregation of classifications by weighted majority vote. The proposed method can be used for all binary classification problems for classifiers that produce probabilistic classifications. Most aggregation functions produce an output which only represents the aggregated classification of an ensemble of classifiers and sometimes this isn't enough. This paper also proposes a method for estimation of the probability of an aggregated classification. The estimated probability of the aggregated classification is essential if the performance of the ensemble of classifiers needs to be expressed in terms of Area Under the Receiver Operating Curve or some other performance measures that classifications’ probability. The experimental results demonstrate the performance improvements obtained by applying the proposed methods to an ensemble of classifiers compared to individual classifiers.
URI: http://hdl.handle.net/20.500.12188/21234
Appears in Collections:Faculty of Computer Science and Engineering: Conference papers

Files in This Item:
File Description SizeFormat 
Probabilistic_Predictions_of_Ensemble_of20151023-8475-1veyp4h-with-cover-page-v2.pdf996.26 kBAdobe PDFView/Open
Show full item record

Page view(s)

27
checked on Apr 22, 2024

Download(s)

8
checked on Apr 22, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.