Abstract
In this chapter, we consider theoretical and experimental results on partial decision reducts and partial decision rules. These investigations are based on the study of partial covers.
Based on the technique created by Ślȩzak in [50, 52], we generalize well known results of Feige [7], and Raz and Safra [43] on the precision of approximate polynomial algorithms for exact cover minimization (construction of an exact cover with minimal cardinality) to the case of partial covers. From obtained results and results of Slavík [47, 48] on the precision of greedy algorithm for partial cover construction it follows that, under some natural assumptions on the class NP, the greedy algorithm for partial cover construction is close (from the point of view of precision ) to the best polynomial approximate algorithms for partial cover minimization.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Moshkov, M.J., Piliszczuk, M., Zielosko, B. (2008). Partial Covers, Reducts and Decision Rules. In: Partial Covers, Reducts and Decision Rules in Rough Sets. Studies in Computational Intelligence, vol 145. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69029-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-69029-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69027-6
Online ISBN: 978-3-540-69029-0
eBook Packages: EngineeringEngineering (R0)