Lower and upper approximations of rules in non-deterministic information systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5306 LNAI, Issue , 2008, Pages 299-309

  Sakai, Hiroshi ^a   Ishibashi, Ryuji ^a   Nakata, Michinori ^b  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

^b JOSAI INTERNATIONAL UNIVERSITY   (Japan)

Author keywords

Apriori algorithm; Incomplete information; Lower and upper approximations; Non deterministic information; Rough sets; Rule generation

Indexed keywords

INFORMATION SYSTEMS; INFORMATION USE; LEARNING ALGORITHMS; ROUGH SET THEORY; UTILITY PROGRAMS;

APRIORI ALGORITHMS; INCOMPLETE INFORMATION; LOWER AND UPPER APPROXIMATIONS; NON-DETERMINISTIC INFORMATION; RULE GENERATION;

APPROXIMATION ALGORITHMS;

EID: 57049183544     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88425-5_31     Document Type: Conference Paper

References (19)

1. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proceedings of the 20th Very Large Data Base, pp. 487-499 (1994)
2. 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)
3. 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. Physica-Verlag (1998)
4. Grzymala-Busse, J.: Data with Missing Attribute Values: Generalization of Indiscernibility Relation and Rule Induction. Transactions on Rough Sets 1, 78-95 (2004)
5. Kryszkiewicz, M.: Rules in Incomplete Information Systems. Information Sciences 113, 271-292 (1999)
6. Kryszkiewicz, M., Rybinski, H.: Computation of Reducts of Composed Information Systems. Fundamenta Informaticae 27, 183-195 (1996)
7. Lipski, W.: On Semantic Issues Connected with Incomplete Information Data Base. ACM Trans. DBS 4, 269-296 (1979)
8. Lipski, W.: On Databases with Incomplete Information. Journal of the ACM 28, 41-70 (1981)
9. Nakata, M., Sakai, H.: Lower and Upper Approximations in Data Tables Containing Possibilistic Information. Transactions on Rough Sets 7, 170-189 (2007)
10. Orlowska, E.: What You Always Wanted to Know about Rough Sets. In: Incomplete Information: Rough Set Analysis, vol. 13, pp. 1-20. Physica-Verlag (1998)
11. Orłowska, E., Pawlak, Z.: Representation of Nondeterministic Information. Theoretical Computer Science 29, 27-39 (1984)
12. Pawlak, Z.: Rough Sets. Kluwer Academic Publisher, Dordrecht (1991)
13. Pawlak, Z.: Some Issues on Rough Sets. Transactions on Rough Sets 1, 1-58 (2004)
14. Sakai, H., Okuma, A.: Basic Algorithms and Tools for Rough Non-deterministic Information Analysis. Transactions on Rough Sets 1, 209-231 (2004)
15. 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)
16. 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)
17. 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)
18. 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-82. Springer, Heidelberg (1999)
19. UCI Machine Learning Repository, http://mlearn.ics.uci.edu/MLRepository. html