Feature Reduction in Superset Learning Using Rough Sets and Evidence Theory

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Supervised learning is an important branch of machine learning (ML), which requires a complete annotation (labeling) of the involved training data. This assumption, which may constitute a severe bottleneck in the practical use of ML, is relaxed in weakly supervised learning. In this ML paradigm, training instances are not necessarily precisely labeled. Instead, annotations are allowed to be imprecise or partial. In the setting of superset learning, instances are assumed to be labeled with a set of possible annotations, which is assumed to contain the correct one. In this article, we study the application of rough set theory in the setting of superset learning. In particular, we consider the problem of feature reduction as a mean for data disambiguation, i.e., for the purpose of figuring out the most plausible precise instantiation of the imprecise training data. To this end, we define appropriate generalizations of decision tables and reducts, using information-theoretic techniques based on evidence theory. Moreover, we analyze the complexity of the associated computational problems.

Cite

CITATION STYLE

APA

Campagner, A., Ciucci, D., & Hüllermeier, E. (2020). Feature Reduction in Superset Learning Using Rough Sets and Evidence Theory. In Communications in Computer and Information Science (Vol. 1237 CCIS, pp. 471–484). Springer. https://doi.org/10.1007/978-3-030-50146-4_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free