Relationship Between Loss Functions and Confirmation Measures

Authors:
Krzysztof Dembczyński;Salvatore Greco;Wojciech Kotłowski;Roman Słowiński
Affiliations:
Institute of Computing Science, Poznań University of Technology, 60-965 Poznań, Poland;Faculty of Economics, University of Catania, 95129 Catania, Italy;Institute of Computing Science, Poznań University of Technology, 60-965 Poznań, Poland;Institute of Computing Science, Poznań University of Technology, 60-965 Poznań, Poland and Institute for Systems Research, Polish Academy of Sciences, 01-447 Warsaw, Poland
Venue:
RSFDGrC '07 Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
Year:
2009

Citing 2
Cited 0

A decision-theoretic generalization of on-line learning and an application to boosting

Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Ensembles of decision rules for solving binary classification problems in the presence of missing values

RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper, we present the relationship between loss functions and confirmation measures. We show that population minimizers for weighted loss functions correspond to confirmation measures. This result can be used in construction of machine learning methods, particularly, ensemble methods.