Interpretations of association rules by granular computing

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2003, Pages 593-596

  Li, Yuefeng ^a   Zhong, Ning ^b  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

^b MAEBASHI INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 15544390493     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. E. Cohen, et al., Finding interesting associations without support pruning, IEEE Transactions on Knowledge and Data Engineering, 2001, 13(1): 64-78.
2. R. Kruse, E. Schwecke and J. Heinsoln, Uncertainty and vagueness in knowledge based systems (Numerical Methods), Springer-Verlag, New York, 1991.
3. th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, China, 2003, 524-532.
4. T. Y. Lin, The lattice structure of database and mining multiple level rules, Bulletin of International Rough Set Society, 2002, 6(1/2): 11-16.
5. D. Liu and Y. Li, The interpretation of generalized evidence theory, Chinese Journal of Computers, 1997, 20(2): 158-164.
6. thInternational Conference on Rough Sets and Current Trends in Computing, USA, 2002, 1-9.
7. R. Rastogi and K. Shim, Mining optimized association rules with categorical and numeric attributes, IEEE Transactions on Knowledge and Data Engineering, 2002, 14(1): 29-50.