Action rules mining

被引:33
作者
Tzacheva, AA
Ras, ZW [1 ]
机构
[1] Univ N Carolina, Dept Comp Sci, Charlotte, NC 28223 USA
[2] Polish Acad Sci, Inst Comp Sci, PL-01237 Warsaw, Poland
关键词
D O I
10.1002/int.20092
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Action rules assume that attributes in a database are divided into two groups: stable and flexible. In general, an action rule can be constructed from two rules extracted earlier from the same database. Furthermore, we assume that these two rules describe two different decision classes and our goal is to reclassify objects from one of these classes into the other one. Flexible attributes are essential in achieving that goal because they provide a tool for making hints to a user about what changes within some values of flexible attributes are needed for a given group of objects to reclassify them into a new decision class. Anew subclass of attributes called semi-stable attributes is introduced. Semi-stable attributes are typically a function of time and undergo deterministic changes (e.g., attribute age or height). So, the set of conditional attributes is partitioned into stable, semi-stable, and flexible. Depending on the semantics of attributes, some semi-stable attributes can be treated as flexible and the same new action rules can be constructed. These new action rules are usually built to replace some existing action rules whose confidence is too low to be of any interest to a user. The confidence of new action rules is always higher than the confidence of rules they replace. Additionally, the notion of the cost and feasibility of an action rule is introduced in this article. A heuristic strategy for constructing feasible action rules that have high confidence and possibly the lowest cost is proposed. (c) 2005 Wiley Periodicals, Inc.
引用
收藏
页码:719 / 736
页数:18
相关论文
共 50 条
[41]   Mining rules are under fire [J].
不详 .
ENVIRONMENTAL SCIENCE & TECHNOLOGY, 2002, 36 (01) :13A-+
[42]   Mining Graph Evolution Rules [J].
Berlingerio, Michele ;
Bonchi, Francesco ;
Bringmann, Bjorn ;
Gionis, Aristides .
MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, PT I, 2009, 5781 :115-+
[43]   Mining weighted association rules [J].
Lu, Songfeng ;
Hu, Heping ;
Li, Fan .
Intelligent Data Analysis, 2001, 5 (03) :211-225
[44]   Mining spatial association rules [J].
Bembenik, R ;
Protaziuk, G .
INTELLIGENT INFORMATION PROCESSING AND WEB MINING, 2004, :3-12
[45]   Association Rules Mining In Manufacturing [J].
Tan, Jun ;
Bu, Ying-yong .
MECHANICAL ENGINEERING AND GREEN MANUFACTURING, PTS 1 AND 2, 2010, :651-654
[46]   A method for association rules mining [J].
Ma, J ;
Chen, G ;
Kerre, EE ;
Ruan, D .
APPLIED COMPUTATIONAL INTELLIGENCE, 2004, :173-178
[47]   Efficient mining of dissociation rules [J].
Morzy, Mikolaj .
DATA WAREHOUSING AND KNOWLEDGE DISCOVERY, PROCEEDINGS, 2006, 4081 :228-237
[48]   Private mining of association rules [J].
Zhan, J ;
Matwin, S ;
Chang, LW .
INTELLIGENCE AND SECURITY INFORMATICS, PROCEEDINGS, 2005, 3495 :72-80
[49]   Quantitative and ordinal association rules mining (QAR mining) [J].
Karel, Filip .
KNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT 1, PROCEEDINGS, 2006, 4251 :195-202
[50]   Prediction mining - An approach to mining association rules for prediction [J].
Deogun, J ;
Jiang, LY .
ROUGH SETS, FUZZY SETS, DATA MINING, AND GRANULAR COMPUTING, PT 2, PROCEEDINGS, 2005, 3642 :98-108