Action Rules Discovery System DEAR_3

E-action rules, introduced in [8], represent actionability knowledge hidden in a decision system. They enhance action rules [3] and extended action rules [4], [6], [7] by assuming that data can be either symbolic or nominal. Several efficient strategies for mining e-action rules have been developed [6], [7], [5], and [8]. All of them assume that data are complete. Clearly, this constraint has to be relaxed since information about attribute values for some objects can be missing or represented as multi-values. To solve this problem, we present DEAR_3 which is an e-action rule generating algorithm. It has three major improvements in comparison to DEAR_2: handling data with missing attribute values and uncertain attribute values, and pruning outliers at its earlier stage.

[1]  Zbigniew W. Ras,et al.  Action-Rules: How to Increase Profit of a Company , 2000, PKDD.

[2]  Zbigniew W. Ras,et al.  Tree-based Algorithm for Discovering Extended Action-Rules (System DEAR2) , 2004, Intelligent Information Systems.

[3]  Zbigniew W. Ras,et al.  Discovering e-action rules from incomplete information systems , 2006, 2006 IEEE International Conference on Granular Computing.

[4]  Zdzislaw Pawlak,et al.  Information systems theoretical foundations , 1981, Inf. Syst..

[5]  Zbigniew W. Ras,et al.  Discovering Extended Action-Rules (System DEAR) , 2003, IIS.

[6]  Zbigniew W. Ras,et al.  Action rules discovery: system DEAR2, method and experiments , 2005, J. Exp. Theor. Artif. Intell..

[7]  Zdzislaw Pawlak,et al.  Rough sets and decision tables , 1984, Symposium on Computation Theory.