Back to Search Start Over

On Partial Covers, Reducts and Decision Rules

Authors :
Marcin Piliszczuk
Beata Zielosko
Mikhail Moshkov
Source :
Transactions on Rough Sets VIII ISBN: 9783540850632
Publication Year :
2008
Publisher :
Springer Berlin Heidelberg, 2008.

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.

Subjects

Subjects :
Theoretical computer science
Computer science
business.industry
Decision rule
Artificial intelligence
Rough set
Greedy algorithm
Machine learning
computer.software_genre
business
computer

Details

ISBN :
978-3-540-85063-2
ISBNs :
9783540850632
Database :
OpenAIRE
Journal :
Transactions on Rough Sets VIII ISBN: 9783540850632
Accession number :
edsair.doi...........eacac885add5755218712b8b05083f59
Full Text :
https://doi.org/10.1007/978-3-540-85064-9_12
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details