Construction of all irreducible partial covers, all partial reducts and all irreducible partial decision rules

Mikhail Ju Moshkov*, Marcin Piliszczuk, Beata Zielosko

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

In this chapter, we study problems of construction of all irreducible partial covers, all partial reducts and all irreducible partial decision rules. We describe briefly the results obtained for irreducible partial covers. Let A be a set with n elements, S be a family of m subsets of A, and t be a natural number. We consider so-called t -covers for the set cover problem (A, S). A t -cover is a subfamily of S, subsets from which cover at least n - t elements from A. A t -cover is called irreducible if each proper subfamily of this t -cover is not a t -cover. We study the problem of construction of all irreducible t -covers for a given set cover problem.

Original languageEnglish (US)
Title of host publicationPartial Covers, Reducts and Decision Rules in Rough Sets
Subtitle of host publicationTheory and Applications
Pages97-116
Number of pages20
Volume145
DOIs
StatePublished - 2008
Externally publishedYes

Publication series

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

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this