4.5 Article

Learning from imprecise and fuzzy observations: Data disambiguation through generalized loss minimization

Journal

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING
Volume 55, Issue 7, Pages 1519-1534

Publisher

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ijar.2013.09.003

Keywords

Imprecise data; Fuzzy sets; Machine learning; Extension principle; Data disambiguation; Loss function

Ask authors/readers for more resources

Methods for analyzing or learning from fuzzy data have attracted increasing attention in recent years. In many cases, however, existing methods (for precise, non-fuzzy data) are extended to the fuzzy case in an ad-hoc manner, and without carefully considering the interpretation of a fuzzy set when being used for modeling data. Distinguishing between an ontic and an epistemic interpretation of fuzzy set-valued data, and focusing on the latter, we argue that a fuzzification of learning algorithms based on an, application of the generic extension principle is not appropriate. In fact, the extension principle fails to properly exploit the inductive bias underlying statistical and machine learning methods, although this bias, at least in principle, offers a means for disambiguating the fuzzy data. Alternatively, we therefore propose a method which is based on the generalization of loss functions in empirical risk minimization, and which performs model identification and data disambiguation simultaneously. Elaborating on the fuzzification of specific types of losses, we establish connections to well-known loss functions in regression and classification. We compare our approach with related methods and illustrate its use in logistic regression for binary classification. (C) 2013 Elsevier Inc. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available