@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",
}