Universal attribute reduction problem

Mikhail Ju Moshkov, Marcin Piliszczuk, Beata Zielosko

Research output: Contribution to journalArticlepeer-review


The attribute reduction problem (it is required to find a reduct with minimal or close to minimal cardinality) is one of the main problems of rough set theory and related theories such as test theory and LAD. There are different variants of the notion of reduct: reducts for information systems, usual decision and local reducts for decision tables, decision and local reducts which are based on the generalized decision, etc. Interesting discussion of various kinds of reducts can be found in [38]. © 2008 Springer-Verlag Berlin Heidelberg.
Original languageEnglish (US)
JournalStudies in Computational Intelligence
StatePublished - Sep 18 2008
Externally publishedYes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2023-09-21

ASJC Scopus subject areas

  • Artificial Intelligence


Dive into the research topics of 'Universal attribute reduction problem'. Together they form a unique fingerprint.

Cite this