Abstract
This paper presents a framework of rule generation in Non-deterministic Information Systems (NISs), which follows rough sets based rule generation in Deterministic Information Systems (DISs). Our previous work about NISs coped with certain rules, minimal certain rules and possible rules. These rules are characterized by the concept of consistency. This paper relates possible rules to rules by the criteria support and accuracy in NISs. On the basis of the information incompleteness in NISs, it is possible to define new criteria, i.e., minimum support, maximum support, minimum accuracy and maximum accuracy. Then, two strategies of rule generation are proposed based on these criteria. The first strategy is Lower Approximation strategy, which defines rule generation under the worst condition. The second strategy is Upper Approximation strategy, which defines rule generation under the best condition. To implement these strategies, we extend Apriori algorithm in DISs to Apriori algorithm in NISs. A prototype system is implemented, and this system is applied to some data sets with incomplete information.
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)
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.: Fast Discovery of Association Rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307–328. AAAI/MIT Press (1996)
Demri, S., Orłowska, E.: Incomplete Information: Structure, Inference, Complexity. Monographs in Theoretical Computer Science. Springer, Heidelberg (2002)
Grzymala-Busse, J.: On the Unknown Attribute Values in Learning from Examples. In: Raś, Z.W., Zemankova, M. (eds.) ISMIS 1991. LNCS (LNAI), vol. 542, pp. 368–377. Springer, Heidelberg (1991)
Grzymala-Busse, J.: A New Version of the Rule Induction System LERS. Fundamenta Informaticae 31, 27–39 (1997)
Grzymala-Busse, J., Werbrouck, P.: On the Best Search Method in the LEM1 and LEM2 Algorithms. Incomplete Information: Rough Set Analysis 13, 75–91 (1998)
Grzymala-Busse, J.: Data with Missing Attribute Values: Generalization of Indiscernibility Relation and Rule Induction. Transactions on Rough Sets 1, 78–95 (2004)
Grzymala-Busse, J.: Incomplete data and generalization of indiscernibility relation, definability, and approximations. In: Ślęzak, D., Wang, G., Szczuka, M.S., Düntsch, I., Yao, Y. (eds.) RSFDGrC 2005. LNCS (LNAI), vol. 3641, pp. 244–253. Springer, Heidelberg (2005)
Komorowski, J., Pawlak, Z., Polkowski, L., Skowron, A.: Rough Sets: a tutorial. In: Pal, S., Skowron, A. (eds.) Rough Fuzzy Hybridization, pp. 3–98. Springer, Heidelberg (1999)
Kryszkiewicz, M.: Rules in Incomplete Information Systems. Information Sciences 113, 271–292 (1999)
Kryszkiewicz, M., Rybinski, H.: Computation of Reducts of Composed Information Systems. Fundamenta Informaticae 27, 183–195 (1996)
Kryszkiewicz, M.: Maintenance of Reducts in the Variable Precision Rough Sets Model. ICS Research Report 31/94, Warsaw University of Technology (1994)
Lipski, W.: On Semantic Issues Connected with Incomplete Information Data Base. ACM Trans. DBS 4, 269–296 (1979)
Lipski, W.: On Databases with Incomplete Information. Journal of the ACM 28, 41–70 (1981)
Nakamura, A., Tsumoto, S., Tanaka, H., Kobayashi, S.: Rough Set Theory and Its Applications. Journal of Japanese Society for AI 11, 209–215 (1996)
Nakamura, A.: A Rough Logic based on Incomplete Information and Its Application. International Journal of Approximate Reasoning 15, 367–378 (1996)
Nakata, M., Sakai, H.: Rough-set-based Approaches to Data Containing Incomplete Information: Possibility-based Cases. In: Nakamatsu, K., Abe, J. (eds.) Advances in Logic Based Intelligent Systems. Frontiers in Artificial Intelligence and Applications, vol. 132, pp. 234–241. IOS Press, Amsterdam (2005)
Nakata, M., Sakai, H.: Lower and Upper Approximations in Data Tables Containing Possibilistic Information. Transactions on Rough Sets 7, 170–189 (2007)
Orłowska, E.: What You Always Wanted to Know about Rough Sets. In: Incomplete Information: Rough Set Analysis, vol. 13, pp. 1–20. Physica-Verlag (1998)
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)
Pawlak, Z.: Some Issues on Rough Sets. Transactions on Rough Sets 1, 1–58 (2004)
Polkowski, L., Skowron, A. (eds.): Rough Sets in Knowledge Discovery 1. Studies in Fuzziness and Soft Computing, vol. 18. Physica-Verlag (1998)
Polkowski, L., Skowron, A. (eds.): Rough Sets in Knowledge Discovery 2. Studies in Fuzziness and Soft Computing, vol. 19. Physica-Verlag (1998)
Rough Set Software. Bulletin of Int’l. Rough Set Society 2, 15–46 (1998)
Sakai, H.: Effective Procedures for Handling Possible Equivalence Relations in Non-deterministic Information Systems. Fundamenta Informaticae 48, 343–362 (2001)
Sakai, H.: Effective Procedures for Data Dependencies in Information Systems. In: Rough Set Theory and Granular Computing. Studies in Fuzziness and Soft Computing, vol. 125, pp. 167–176. Springer, Heidelberg (2003)
Sakai, H., Okuma, A.: Basic Algorithms and Tools for Rough Non-deterministic Information Analysis. In: Peters, J.F., Skowron, A., Grzymała-Busse, J.W., Kostek, B.z., Świniarski, R.W., Szczuka, M.S. (eds.) Transactions on Rough Sets I. LNCS, vol. 3100, pp. 209–231. Springer, Heidelberg (2004)
Sakai, H., Nakata, M.: An Application of Discernibility Functions to Generating Minimal Rules in Non-deterministic Information Systems. Journal of Advanced Computational Intelligence and Intelligent Informatics 10, 695–702 (2006)
Sakai, H.: On a Rough Sets Based Data Mining Tool in Prolog: An Overview. In: Umeda, M., Wolf, A., Bartenstein, O., Geske, U., Seipel, D., Takata, O. (eds.) INAP 2005. LNCS (LNAI), vol. 4369, pp. 48–65. Springer, Heidelberg (2006)
Sakai, H., Nakata, M.: On Possible Rules and Apriori Algorithm in Non-deterministic Information Systems. In: Greco, S., Hata, Y., Hirano, S., Inuiguchi, M., Miyamoto, S., Nguyen, H.S., Słowiński, R. (eds.) RSCTC 2006. LNCS (LNAI), vol. 4259, pp. 264–273. Springer, Heidelberg (2006)
Sakai, H., Ishibashi, R., Koba, K., Nakata, M.: On Possible Rules and Apriori Algorithm in Non-deterministic Information Systems 2. In: An, A., Stefanowski, J., Ramanna, S., Butz, C.J., Pedrycz, W., Wang, G. (eds.) RSFDGrC 2007. LNCS (LNAI), vol. 4482, pp. 280–288. Springer, Heidelberg (2007)
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)
Stefanowski, J., Tsoukias, A.: On the Extension of Rough Sets under Incomplete Information. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS (LNAI), vol. 1711, pp. 73–81. Springer, Heidelberg (1999)
Stefanowski, J., Tsoukias, A.: Incomplete Information Tables and Rough Classification. Computational Intelligence 7, 212–219 (2001)
Tsumoto, S.: Knowledge Discovery in Clinical Databases and Evaluation of Discovered Knowledge in Outpatient Clinic. Information Sciences 124, 125–137 (2000)
UCI Machine Learning Repository, http://mlearn.ics.uci.edu/MLRepository.html
Ziarko, W.: Variable Precision Rough Set Model. Journal of Computer and System Sciences 46, 39–59 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sakai, H., Ishibashi, R., Koba, K., Nakata, M. (2008). Rules and Apriori Algorithm in Non-deterministic Information Systems. In: Peters, J.F., Skowron, A., Rybiński, H. (eds) Transactions on Rough Sets IX. Lecture Notes in Computer Science, vol 5390. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89876-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-89876-4_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89875-7
Online ISBN: 978-3-540-89876-4
eBook Packages: Computer ScienceComputer Science (R0)