Abstract
A framework of rule generation in Non-deterministicInfor- mationSystems (NISs), which follows rough sets based rule generation in DeterministicInformation Systems (DISs), is presented. We have already coped with certainrules and minimalcertain rules, which are characterized by the concept of consistency, in NISs. We also introduced discernibilityfunctions into NISs. In this paper, possiblerules in NISs are focused on. Because of the information incompleteness, huge number of possiblerules may exist, and we introduce Min-Maxstrategy and Max-Maxstrategy into possible rule generation in NISs. Possible rules based on these strategies are characterized by the criteria minimumsupport, maximumsupport, minimumaccuracy and maximumaccuracy, and Apriori based algorithm is applied.
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.
Similar content being viewed by others
References
Pawlak, Z.: Rough Sets. Kluwer Academic Publishers, Dordrecht (1991)
Pawlak, Z.: Some Issues on Rough Sets, Transactions on Rough Sets. Int’l. Rough Set Society 1, 1–58 (2004)
Komorowski, J., Pawlak, Z., Polkowski, L., Skowron, A.: Rough Sets: a tutorial, Rough Fuzzy Hybridization, pp. 3–98. Springer, Heidelberg (1999)
Rough Set Software, Bulletin of Int’l. Rough Set Society 2, 15–46 (1998)
Orłowska, E. (ed.): Incomplete Information: Rough Set Analysis. Physica-Verlag (1998)
Lipski, W.: On Semantic Issues Connected with Incomplete Information Data Base. ACM Trans. DBS 4, 269–296 (1979)
Grzymala-Busse, J., Werbrouck, P.: On the Best Search Method in the LEM1 and LEM2 Algorithms. In: Incomplete Information: Rough Set Analysis, pp. 75–91. Phisica-Verlag (1998)
Grzymala-Busse, J.: Data with Missing Attribute Values: Generalization of Indiscernibility Relation and Rule Induction. Transactions on Rough Sets, Int’l. Rough Set Society 1, 78–95 (2004)
Kryszkiewicz, M.: Rules in Incomplete Information Systems. Information Sciences 113, 271–292 (1999)
Sakai, H., Okuma, A.: Basic Algorithms and Tools for Rough Non-deterministic Information Analysis. Transactions on Rough Sets, Int’l. Rough Set Society 1, 209–231 (2004)
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)
Sakai, H., Nakata, M.: Discernibility Functions and Minimal Rules in Non-deterministic Information Systems. In: Ślęzak, D., Wang, G., Szczuka, M.S., Düntsch, I., Yao, Y. (eds.) RSFDGrC 2005. LNCS (LNAI), vol. 3641, pp. 254–264. Springer, Heidelberg (2005)
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. 20th Very Large Data Base, pp. 487–499 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sakai, H., Nakata, M. (2006). On Possible Rules and Apriori Algorithm in Non-deterministic Information Systems. In: Greco, S., et al. Rough Sets and Current Trends in Computing. RSCTC 2006. Lecture Notes in Computer Science(), vol 4259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11908029_29
Download citation
DOI: https://doi.org/10.1007/11908029_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47693-1
Online ISBN: 978-3-540-49842-1
eBook Packages: Computer ScienceComputer Science (R0)