Abstract
The attribute reduction problem (it is required to find a reduct with minimal or close to minimal cardinality) is one of the main problems of rough set theory [36, 38, 39, 40, 46] and related theories such as test theory [2, 6, 54, 57, 60, 61] and LAD [1, 5]. There are different variants of the notion of reduct: reducts for information systems [36], usual decision and local reducts for decision tables [36, 45], decision and local reducts which are based on the generalized decision [45], etc. Interesting discussion of various kinds of reducts can be found in [38].
This is a preview of subscription content, log in via an institution to check access.
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). Universal Attribute Reduction Problem. 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_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-69029-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69027-6
Online ISBN: 978-3-540-69029-0
eBook Packages: EngineeringEngineering (R0)