Upper bounds on minimum cardinality of exact and approximate reducts

Igor Chikalov, Mikhail Moshkov, Beata Marta Zielosko

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

In the paper, we consider the notions of exact and approximate decision reducts for binary decision tables. We present upper bounds on minimum cardinality of exact and approximate reducts depending on the number of rows (objects) in the decision table. We show that the bound for exact reducts is unimprovable in the general case, and the bound for approximate reducts is almost unimprovable in the general case. © 2010 Springer-Verlag Berlin Heidelberg.
Original languageEnglish (US)
Title of host publicationRough Sets and Current Trends in Computing
PublisherSpringer Nature
Pages412-417
Number of pages6
ISBN (Print)3642135285; 9783642135286
DOIs
StatePublished - 2010

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Upper bounds on minimum cardinality of exact and approximate reducts'. Together they form a unique fingerprint.

Cite this