On partial covers, reducts and decision rules

Mikhail Moshkov; Marcin Piliszczuk; Beata Zielosko

doi:10.1007/978-3-540-85064-9_12

On partial covers, reducts and decision rules

Mikhail Moshkov, Marcin Piliszczuk, Beata Zielosko

Computer, Electrical and Mathematical Science and Engineering

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

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.

Original language	English (US)
Title of host publication	Transactions on Rough Sets VIII
Editors	James F. Peters, Andrzej Skowron
Pages	251-288
Number of pages	38
DOIs	https://doi.org/10.1007/978-3-540-85064-9_12
State	Published - Sep 9 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5084 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Keywords

Greedy algorithms
Partial covers
Partial decision rules
Partial reducts
Rough sets

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-85064-9_12

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

Cite this

Moshkov, M., Piliszczuk, M., & Zielosko, B. (2008). On partial covers, reducts and decision rules. In J. F. Peters, & A. Skowron (Eds.), Transactions on Rough Sets VIII (pp. 251-288). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5084 LNCS). https://doi.org/10.1007/978-3-540-85064-9_12

@inproceedings{cb93ea3dd14e422380ba5913e05fb8e5,

title = "On partial covers, reducts and decision rules",

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

keywords = "Greedy algorithms, Partial covers, Partial decision rules, Partial reducts, Rough sets",

author = "Mikhail Moshkov and Marcin Piliszczuk and Beata Zielosko",

year = "2008",

month = sep,

day = "9",

doi = "10.1007/978-3-540-85064-9_12",

language = "English (US)",

isbn = "3540850635",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "251--288",

editor = "Peters, {James F.} and Andrzej Skowron",

booktitle = "Transactions on Rough Sets VIII",

}

On partial covers, reducts and decision rules. / Moshkov, Mikhail; Piliszczuk, Marcin; Zielosko, Beata.

Transactions on Rough Sets VIII. ed. / James F. Peters; Andrzej Skowron. 2008. p. 251-288 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5084 LNCS).

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

TY - GEN

T1 - On partial covers, reducts and decision rules

AU - Moshkov, Mikhail

AU - Piliszczuk, Marcin

AU - Zielosko, Beata

PY - 2008/9/9

Y1 - 2008/9/9

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

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

KW - Greedy algorithms

KW - Partial covers

KW - Partial decision rules

KW - Partial reducts

KW - Rough sets

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

U2 - 10.1007/978-3-540-85064-9_12

DO - 10.1007/978-3-540-85064-9_12

M3 - Conference contribution

AN - SCOPUS:50949097413

SN - 3540850635

SN - 9783540850632

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 251

EP - 288

BT - Transactions on Rough Sets VIII

A2 - Peters, James F.

A2 - Skowron, Andrzej

ER -

On partial covers, reducts and decision rules

Abstract

Publication series

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this