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

Mikhail Ju Moshkov; Marcin Piliszczuk; Beata Zielosko

doi:10.1007/978-3-540-69029-0_4

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 proceeding › Conference contribution › peer-review

2 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 language	English (US)
Title of host publication	Partial Covers, Reducts and Decision Rules in Rough Sets
Subtitle of host publication	Theory and Applications
Pages	97-116
Number of pages	20
Volume	145
DOIs	https://doi.org/10.1007/978-3-540-69029-0_4
State	Published - 2008
Externally published	Yes

Publication series

Name	Studies in Computational Intelligence
Volume	145
ISSN (Print)	1860-949X

ASJC Scopus subject areas

Artificial Intelligence

Access to Document

10.1007/978-3-540-69029-0_4

Cite this

Moshkov, M. J., Piliszczuk, M., & Zielosko, B. (2008). Construction of all irreducible partial covers, all partial reducts and all irreducible partial decision rules. In Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications (Vol. 145, pp. 97-116). (Studies in Computational Intelligence; Vol. 145). https://doi.org/10.1007/978-3-540-69029-0_4

@inproceedings{f3e43c2f1cb04876b27d41f8ae796388,

title = "Construction of all irreducible partial covers, all partial reducts and all irreducible partial decision rules",

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.",

author = "Moshkov, {Mikhail Ju} and Marcin Piliszczuk and Beata Zielosko",

year = "2008",

doi = "10.1007/978-3-540-69029-0_4",

language = "English (US)",

isbn = "9783540690276",

volume = "145",

series = "Studies in Computational Intelligence",

pages = "97--116",

booktitle = "Partial Covers, Reducts and Decision Rules in Rough Sets",

}

Construction of all irreducible partial covers, all partial reducts and all irreducible partial decision rules. / Moshkov, Mikhail Ju; Piliszczuk, Marcin; Zielosko, Beata.
Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications. Vol. 145 2008. p. 97-116 (Studies in Computational Intelligence; Vol. 145).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Moshkov, Mikhail Ju

AU - Piliszczuk, Marcin

AU - Zielosko, Beata

PY - 2008

Y1 - 2008

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

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

UR - http://www.scopus.com/inward/record.url?scp=51649121109&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-69029-0_4

DO - 10.1007/978-3-540-69029-0_4

M3 - Conference contribution

AN - SCOPUS:51649121109

SN - 9783540690276

VL - 145

T3 - Studies in Computational Intelligence

SP - 97

EP - 116

BT - Partial Covers, Reducts and Decision Rules in Rough Sets

ER -

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

Abstract

Publication series

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this