Mining action rules from scratch

Action rules provide hints to a business user what actions (i.e. changes within some values of flexible attributes) should be taken to improve the profitability of customers. That is, taking some actions to re-classify some customers from less desired decision class to the more desired one. However, in previous work, each action rule was constructed from two rules, extracted earlier, defining different profitability classes. In this paper, we make a first step towards formally introducing the problem of mining action rules from scratch and present formal definitions. In contrast to previous work, our formulation provides guarantee on verifying completeness and correctness of discovered action rules. In addition to formulating the problem from an inductive learning viewpoint, we provide theoretical analysis on the complexities of the problem and its variations. Furthermore, we present efficient algorithms for mining action rules from scratch. In an experimental study we demonstrate the usefulness of our techniques.

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

[2]  Aiko M. Hormann,et al.  Programs for Machine Learning. Part I , 1962, Inf. Control..

[3]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[4]  Qiang Yang,et al.  Postprocessing decision trees to extract actionable knowledge , 2003, Third IEEE International Conference on Data Mining.

[5]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .

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

[7]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[8]  Qiang Yang,et al.  Mining case bases for action recommendation , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[9]  Jian Pei,et al.  CMAR: accurate and efficient classification based on multiple class-association rules , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[10]  Qiang Yang,et al.  Mining optimal actions for profitable CRM , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[11]  Wynne Hsu,et al.  Integrating Classification and Association Rule Mining , 1998, KDD.

[12]  Geert Wets,et al.  A data mining framework for optimal product selection in retail supermarket data: the generalized PROFSET model , 2000, KDD '00.

[13]  Jiawei Han,et al.  Profit Mining: From Patterns to Actions , 2002, EDBT.

[14]  Yuval Elovici,et al.  A decision-theoretic approach to data mining , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[15]  Tsau Young Lin,et al.  Mining value added association rules , 2002 .

[16]  Wynne Hsu,et al.  Identifying non-actionable association rules , 2001, KDD '01.

[17]  Balaji Padmanabhan,et al.  A Belief-Driven Method for Discovering Unexpected Patterns , 1998, KDD.

[18]  Ke Wang,et al.  Item selection by "hub-authority" profit ranking , 2002, KDD.

[19]  Jon M. Kleinberg,et al.  A Microeconomic View of Data Mining , 1998, Data Mining and Knowledge Discovery.

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