Universal attribute reduction problem

Mikhail Ju Moshkov*, Marcin Piliszczuk, Beata Zielosko

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

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].

Original languageEnglish (US)
Title of host publicationPartial Covers, Reducts and Decision Rules in Rough Sets
Subtitle of host publicationTheory and Applications
EditorsMikhail Moshkov, Beata Zielosko, Marcin Piliszczuk
Pages135-142+145-148
DOIs
StatePublished - Sep 18 2008

Publication series

NameStudies in Computational Intelligence
Volume145
ISSN (Print)1860-949X

ASJC Scopus subject areas

  • Artificial Intelligence

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

Cite this