On partial covers, reducts and decision rules

Mikhail Ju Moshkov; Marcin Piliszczuk; Beata Zielosko

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

On partial covers, reducts and decision rules

Mikhail Ju Moshkov, Marcin Piliszczuk, Beata Zielosko

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages	251-288
Number of pages	38
DOIs	https://doi.org/10.1007/978-3-540-85064-9_12
State	Published - Sep 9 2008
Externally published	Yes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2023-09-21

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

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

Cite this

@inproceedings{b26870455af445f49cc2d9fc784ce313,

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. {\textcopyright} 2008 Springer-Verlag Berlin Heidelberg.",

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

note = "Generated from Scopus record by KAUST IRTS on 2023-09-21",

year = "2008",

month = sep,

day = "9",

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

language = "English (US)",

isbn = "3540850635",

pages = "251--288",

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

}

TY - GEN

T1 - On partial covers, reducts and decision rules

AU - Moshkov, Mikhail Ju

AU - Piliszczuk, Marcin

AU - Zielosko, Beata

N1 - Generated from Scopus record by KAUST IRTS on 2023-09-21

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. © 2008 Springer-Verlag Berlin Heidelberg.

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. © 2008 Springer-Verlag Berlin Heidelberg.

UR - http://link.springer.com/10.1007/978-3-540-85064-9_12

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

SN - 3540850635

SP - 251

EP - 288

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

ER -

On partial covers, reducts and decision rules

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this