Interpreting low and high order rules: A granular computing approach

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

Volumn 4585 LNAI, Issue , 2007, Pages 371-380

  Yao, Yiyu ^a   Zhou, Bing ^a   Chen, Yaohua ^a  

^a UNIVERSITY OF REGINA   (Canada)

Author keywords

Dominance based rough set analysis; Granular computing; High order rules; Low order rules

Indexed keywords

DECISION TABLES; FORMAL LOGIC; KNOWLEDGE REPRESENTATION; MODEL PREDICTIVE CONTROL; PROGRAM INTERPRETERS;

DOMINANCE-BASED ROUGH SET ANALYSIS; GRANULAR COMPUTING; HIGH ORDER RULES; LOW ORDER RULES;

ROUGH SET THEORY;

EID: 38049045672     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73451-2_39     Document Type: Conference Paper

References (16)

1. Demri, S., Orlowska, E.: Logical Analysis of Indiscernibility. In: Orlowska, E. (ed.) Incomplete Information: Rough Set Analysis, pp. 347-380. Physica Verlag, Heidelberg (1997)
2. Greco, S., Matarazzo, B., Slowinski, R.: Rough Approximation of a Preference Relation by Dominance Relations. European Journal of Operational Research 117, 63-83 (1999)
3. Greco, S., Matarazzo, B., Slowinski, R.: Rough Approximation by Dominance Relations. International Journal of Intelligent Systems 17, 153-171 (2002)
4. Greco, S., Slowinski, R., Stefanowski, J.: Mining Association Rules in Preference-ordered Data. In: Proceedings of the 13th International Symposium on Foundations of Intelligent Systems (ISMIS'02), pp. 442-450 (2002)
5. Grzymala-Busse, J.W.: Incomplete Data and Generalization of Indiscernibility Relation, Definability, and Approximations. Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. In: Proceedings of 10th International Conference, LNAI, vol. 3641, pp. 244-253, Springer, Heidelberg (2005)
6. Nguyen, H.S., Skowron, A., Stepaniuk, J.: Granular Computing: a Rough Set Approach. Computational Intelligence 17, 514-544 (2001)
7. Pawlak, Z.: Rough Sets - Theoretical Aspects of Reasoning about Data. Kluwer Publishers, Boston (1991)
8. Pawlak, Z., Skowron, A.: Rough Sets: Some Extensions. Information Science 177, 28-40 (2007)
9. Quinlan, J.R.: Learning Efficient Classification Procedures and Their Application to Chess End-games. In: Michalski, J.S., Carbonell, J.G., Mirchell, T.M. (eds.) Machine Learning: An Artificial Intelligence Approach, vol. 1, pp. 463-482. Morgan Kaufmann, San Francisco (1983)
10. Quinlan, J.R.: Learning Logical Definitions from Relations. Machine Learning 5, 239-266 (1990)
11. Sai, Y., Yao, Y.Y., Zhong, N.: Data Analysis and Mining in Ordered Information Tables. In: Proceedings of the 2001 IEEE International Conference on Data Mining, pp. 497-504 (2001)
12. Tsumoto, S.: Antomated Discovery of Plausible Rules Based on Rough Sets and Rough Inclusion. In: Zhong, N., Zhou, L. (eds.) Proceedings of PAKDD'99. LNCS (LNAI), vol. 1574, pp. 210-219. Springer, Heidelberg (1999)
13. Wille, R.: Concept Lattices and Conceptual Knowledge Systems. Computers Mathematics with Applications 23, 493-515 (1992)
14. Yao, Y.Y., Zhong, N.: An Analysis of Quantitative Measures Associated with Rules. In: Zhong, N., Zhou, L. (eds.) Proceedings of PAKDD'99. LNCS (LNAI), vol. 1574, pp. 479-488. Springer, Heidelberg (1999)
15. Yao, Y.Y., Sai, Y.: On Mining Ordering Rules. In: Terano, T., Nishida, T., Namatame, A., Tsumoto, S., Ohsawa, Y., Washio, T. (eds.) New Frontiers in Artificial Intelligence. LNCS (LNAI), vol. 2253, pp. 316-321. Springer, Heidelberg (2001)
16. Yao, Y.Y.: Mining High Order Decision Rules. In: Inuiguchi, M., Hirano, S., Tsumoto, S. (eds.) Rough Set Theory and Granular Computing, pp. 125-135. Springer, Berlin (2003)