Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.


Download BibTeX


Granular representation of OWA-based fuzzy rough sets


[ 1 ] Instytut Informatyki, Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | [ P ] employee

Scientific discipline (Law 2.0)

[2.3] Information and communication technology

Year of publication


Published in

Fuzzy Sets and Systems

Journal year: 2022 | Journal volume: vol. 440

Article type

scientific article

Publication language


  • Fuzzy rough sets
  • Granular computing
  • Ordered weighted average
  • Rule induction

EN Granular representations of crisp and fuzzy sets play an important role in rule induction algorithms based on rough set theory. In particular, arbitrary fuzzy sets can be approximated using unions of simple fuzzy sets called granules. These granules, in turn, have a straightforward interpretation in terms of human-readable fuzzy “if..., then...” rules. In this paper, we are considering a fuzzy rough set model based on ordered weighted average (OWA) aggregation over considered values. We show that this robust extension of the classical fuzzy rough set model, which has been applied successfully in various machine learning tasks, also allows for a granular representation. In particular, we prove that when approximations are defined using a directionally convex t-norm and its residual implicator, the OWA-based lower and upper approximations are definable as unions of fuzzy granules. This result has practical implications for rule induction from such fuzzy rough approximations.

Date of online publication


Pages (from - to)

112 - 130




Ministry points / journal


Impact Factor


This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.