Interpretations of association rules by granular computing

We present interpretations for association rules. We first introduce Pawlak's method, and the corresponding algorithm of finding decision rules (a kind of association rules). We then use extended random sets to present a new algorithm of finding interesting rules. We prove that the new algorithm is faster than Pawlak's algorithm. The extended random sets are easily to include more than one criterion for determining interesting rules. We also provide two measures for dealing with uncertainties in association rules.

[1]  Rudolf Kruse,et al.  Uncertainty and vagueness in knowledge based systems: numerical methods , 1991, Artificial intelligence.

[2]  Rudolf Kruse,et al.  Uncertainty and Vagueness in Knowledge Based Systems , 1991, Artificial Intelligence.

[3]  Liu Dayo.  THE INTERPRETATION OF GENERALIZED EVIDENCE THEORY , 1997 .

[4]  Kyuseok Shim,et al.  Mining optimized association rules with categorical and numeric attributes , 1998, Proceedings 14th International Conference on Data Engineering.

[5]  Edith Cohen,et al.  Finding interesting associations without support pruning , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[6]  Zdzislaw Pawlak,et al.  In Pursuit of Patterns in Data Reasoning from Data - The Rough Set Way , 2002, Rough Sets and Current Trends in Computing.

[7]  Yuefeng Li,et al.  Extended Random Sets for Knowledge Discovery in Information Systems , 2003, RSFDGrC.

[8]  Third IEEE International Conference on Data Mining , 2003, Third IEEE International Conference on Data Mining.