Mining action rules from scratch

被引:48
作者
He, ZY
Xu, XF
Deng, SC
Ma, RH
机构
[1] Harbin Inst Technol, Dept Comp Sci & Engn, Harbin 150001, Peoples R China
[2] Chinese Acad Sci, Nanjing Inst Geog & Limnol, Nanjing 210008, Peoples R China
关键词
action rule; positive example; negative example; association rules; flexible attributes; stable attributes; data mining; CRM;
D O I
10.1016/j.eswa.2005.04.031
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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. (c) 2005 Elsevier Ltd. All rights reserved.
引用
收藏
页码:691 / 699
页数:9
相关论文
共 16 条
[1]  
Agrawal R., 1994, P 20 INT C VER LARG, P478
[2]  
Brijs T., 2000, Proceedings. KDD-2000. Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P300, DOI 10.1145/347090.347156
[3]  
CLEINBERG J, 1998, DATA MIN KNOWL DISC, V2, P311
[4]   A decision-theoretic approach to data mining [J].
Elovici, Y ;
Braha, D .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2003, 33 (01) :42-51
[5]   CMAR: Accurate and efficient classification based on Multiple Class-Association Rules [J].
Li, WM ;
Han, JW ;
Pei, J .
2001 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2001, :369-376
[6]  
LIN CX, 2002, P ICDM 02, P767
[7]  
Liu B, 1998, P 4 INT C KNOWL DISC, P80
[8]  
LIU B, 2001, P 7 ACM SIGKDD INT C, P329
[9]  
Padmanabhan B., 1998, Proceedings Fourth International Conference on Knowledge Discovery and Data Mining, P94
[10]  
Quinlan J. R., 2014, C4 5 PROGRAMS MACHIN