On partial covers, reducts and decision rules

Mikhail Ju Moshkov, Marcin Piliszczuk, Beata Zielosko

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

7 Scopus citations

Abstract

In the paper, the accuracy of greedy algorithms for construction of partial covers, reducts and decision rules is considered. Bounds on the minimal complexity of partial covers, reducts and decision rules based on an information about greedy algorithm work are studied. The results of experiments with greedy algorithms are described. © 2008 Springer-Verlag Berlin Heidelberg.
Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages251-288
Number of pages38
DOIs
StatePublished - Sep 9 2008
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'On partial covers, reducts and decision rules'. Together they form a unique fingerprint.

Cite this