Synonyms
Classification rules; Decision rules; Rough computing; Rough set theory
Definition of the Subject
Mathematically, a relation is a subset of a Cartesian product of sets, called attribute domains. In relational databases (RDB), however, we extend the concept of sets to bags that allow more than one occurrence of their elements [1]. In RDB, the main focus is on time-varying bag relations; in rough set theory (RST), they are interested in the instances of bag relations, called information tables (IT). An information table is called a decision table (DT), if the attributes are divided into two disjoint families, called conditional and decision attributes. A tuple in such a DT is called a decision rule. A sub-relation is called a value reduct, if it consists of a minimal subset of minimal length decision rules that has the same decision power as the original decision table. Value reducts of a DT are not necessary unique. The main theorem of RST is:
Reduct Theorem: Every decision...
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
Recommended Reading
Gracia-Molina H, Ullman J, Windin J. Database systems the complete book. Upper Saddle Rive: Prentice Hall; 2002.
Lee TT. Algebraic theory of relational databases. Bell Syst Tech J. 1983;62(10):3159–204.
Lin TY. Rough set theory in very large databases. In: Proceedings of the Symposium in modelling analysis and Simulation. 1996. p. 936–41.
Lin TY. Granular computing on binary relations I: data mining and neighborhood systems. In: Skoworn A, Polkowski L, editors. Rough sets in knowledge discovery. Heidelberg/New York: Physica-Verlag; 1998. p. 107–21.
Lin TY. Granular computing on binary relations II: rough set representations and belief functions. In: Skoworn A, Polkowski L, editors. Rough sets in knowledge discovery. Heidelberg/New York: Physica-Verlag; 1998. p. 121–40.
Lin TY. Granular computing: fuzzy logic and rough sets. In: Zadeh L, Kacprzyk J, editors. Computing with words in information/intelligent systems. Heidelberg: Physica-Verlag; 1999. p. 183–200.
Lin TY. Granular computing: practices, theories, and future directions. Encyclopedia of complexity and systems science. 2009. p. 4339–55.
Lin TY, Han J. High frequent value reduct in very large databases. In: Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing; 2007. p. 346–54.
Lin TY, Liu Y, Huang W. Unifying rough set theories via large scaled granular computing. Fundam Inform. 2013;127(1–4):413–28.
Pawlak Z. Rough sets. Theoretical aspects of reasoning about data. Dordrecht: Kluwer Academic; 1991. ISBN:0-7923-1472-7.
Tsau-Young Lin: Np-hard problem in rough set theory, Bigdata 2017 (to appear)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Lin, T.Y. (2018). Decision Rule Mining in Rough Set Theory. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_563
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_563
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering