Ordered weighted average based fuzzy rough sets

65Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Traditionally, membership to the fuzzy-rough lower, resp. upper approximation is determined by looking only at the worst, resp. best performing object. Consequently, when applied to data analysis problems, these approximations are sensitive to noisy and/or outlying samples. In this paper, we advocate a mitigated approach, in which membership to the lower and upper approximation is determined by means of an aggregation process using ordered weighted average operators. In comparison to the previously introduced vaguely quantified rough set model, which is based on a similar rationale, our proposal has the advantage that the approximations are monotonous w.r.t. the used fuzzy indiscernibility relation. Initial experiments involving a feature selection application confirm the potential of the OWA-based model. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Cornelis, C., Verbiest, N., & Jensen, R. (2010). Ordered weighted average based fuzzy rough sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6401 LNAI, pp. 78–85). https://doi.org/10.1007/978-3-642-16248-0_16

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