An observation-weighting method for mining actionable behavioral rules

One of the critical challenges faced by the mainstream data mining community is to make the mined patterns or knowledge actionable. Knowledge is considered actionable if users can take direct actions based on such knowledge to their advantage. Among the most important and distinctive actionable knowledge are actionable behavioral rules that can directly and explicitly suggest specific actions to take to influence (restrain or encourage) the behavior in the users' best interest. The problem of mining such rules is a search problem in a framework of support and expected utility. The previous definition of a rule's support assumes that each instance which supports a rule has the uniform contribution to the support. However, this assumption is usually violated in practice to some extent, and thus will hinder the performance of algorithms for mining such rules. In this paper, to handle this problem, an observation-weighting model for support and corresponding mining algorithm are proposed. The experimental results strongly suggest the validity and the superiority of our approach.

[1]  Elena Baralis,et al.  A lazy approach to pruning classification rules , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[2]  Gregory Piatetsky-Shapiro,et al.  Advances in Knowledge Discovery and Data Mining , 2004, Lecture Notes in Computer Science.

[3]  Angelina A. Tzacheva,et al.  Action rules mining , 2005, Int. J. Intell. Syst..

[4]  Zbigniew W. Ras,et al.  Mining for interesting action rules , 2005, IEEE/WIC/ACM International Conference on Intelligent Agent Technology.

[5]  Zbigniew W. Ras,et al.  Association Action Rules , 2008, 2008 IEEE International Conference on Data Mining Workshops.

[6]  Chengqi Zhang,et al.  Flexible Frameworks for Actionable Knowledge Discovery , 2010, IEEE Transactions on Knowledge and Data Engineering.

[7]  Wenji Mao,et al.  Mining actionable behavioral rules , 2012, Decis. Support Syst..

[8]  Rakesh Agarwal,et al.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[9]  Angelina A. Tzacheva,et al.  Tree-based Construction of Low-cost Action Rules , 2008 .

[10]  Doug Schuler,et al.  Social computing , 1994, CACM.

[11]  Abraham Silberschatz,et al.  What Makes Patterns Interesting in Knowledge Discovery Systems , 1996, IEEE Trans. Knowl. Data Eng..

[12]  Yoav Freund,et al.  Experiments with a New Boosting Algorithm , 1996, ICML.

[13]  Zbigniew W. Ras,et al.  In Search for Action Rules of the Lowest Cost , 2004, MSRAS.

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

[15]  Zbigniew W. Ras,et al.  Action Rules Discovery without Pre-existing Classification Rules , 2008, RSCTC.

[16]  Carla E. Brodley,et al.  Class Noise Mitigation Through Instance Weighting , 2007, ECML.

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

[18]  Daniel Zeng,et al.  A New Approach for Resolving Conflicts in Actionable Behavioral Rules , 2014, TheScientificWorldJournal.

[19]  Kai Ming Ting,et al.  An Instance-weighting Method to Induce Cost-sensitive Trees , 2001 .