Abstract
A rule in a Deterministic Information System (DIS) is often defined by an implication τ such that both support(τ) ≥ α and accuracy(τ) ≥ β hold for the threshold values α and β. In a Non-deterministic Information System (NIS), there are derived DISs due to the information incompleteness. A rule in a DIS was extended to either a rule in the lower system or a rule in the upper system in a NIS. This paper newly introduces a criterion, i.e., stability factor, into rules in a NIS. Rules in the upper system are classified according to the stability factor.
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.
References
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proceedings of the 20th Very Large Data Base, pp. 487–499 (1994)
Ceglar, A., Roddick, J.F.: Association mining. ACM Comput. Surv. 38(2) (2006)
Grzymala-Busse, J.: Data with Missing Attribute Values: Generalization of Indiscernibility Relation and Rule Induction. Transactions on Rough Sets 1, 78–95 (2004)
Infobright.org Forums: http://www.infobright.org/Forums/viewthread/288/ , http://www.infobright.org/Forums/viewthread/621/
Kryszkiewicz, M.: Rules in Incomplete Information Systems. Information Sciences 113, 271–292 (1999)
Lipski, W.: On Semantic Issues Connected with Incomplete Information Data Base. ACM Trans. DBS. 4, 269–296 (1979)
Orłowska, E., Pawlak, Z.: Representation of Nondeterministic Information. Theoretical Computer Science 29, 27–39 (1984)
Pawlak, Z.: Rough Sets. Kluwer Academic Publisher, Dordrecht (1991)
Sakai, H., Okuma, A.: Basic Algorithms and Tools for Rough Non-deterministic Information Analysis. Transactions on Rough Sets 1, 209–231 (2004)
Sakai, H., Ishibashi, R., Nakata, M.: On Rules and Apriori Algorithm in Non-deterministic Information Systems. Transactions on Rough Sets 9, 328–350 (2008)
Sakai, H., Ishibashi, R., Nakata, M.: Lower and Upper Approximations of Rules in Non-deterministic Information Systems. In: Chan, C.C., Grzymala-Busse, J., Ziarko, W. (eds.) RSCTC 2008. LNCS (LNAI), vol. 5306, pp. 299–309. Springer, Heidelberg (2008)
Skowron, A., Rauszer, C.: The Discernibility Matrices and Functions in Information Systems. In: Intelligent Decision Support - Handbook of Advances and Applications of the Rough Set Theory, pp. 331–362. Kluwer Academic Publishers, Dordrecht (1992)
Ślȩzak, D., Sakai, H.: Automatic extraction of decision rules from non-deterministic data systems: Theoretical foundations and SQL-based implementation. In: Proc. of DTA 2009, Jeju, Korea, December 10-12 (in print, 2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sakai, H., Hayashi, K., Nakata, M., Ślęzak, D. (2009). The Lower System, the Upper System and Rules with Stability Factor in Non-deterministic Information Systems. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., Ślęzak, D., Zhu, W. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2009. Lecture Notes in Computer Science(), vol 5908. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10646-0_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-10646-0_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10645-3
Online ISBN: 978-3-642-10646-0
eBook Packages: Computer ScienceComputer Science (R0)