Statistical pruning of discovered association rules

被引:5
作者
Bruzzese, D [1 ]
Davino, C [1 ]
机构
[1] Univ Naples Federico II, Dipartimento Matemat & Stat, I-80126 Naples, Italy
关键词
association rules; support; confidence; significance tests;
D O I
10.1007/s001800100074
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Nowadays mining association rules in a database is a quite simple task; many algorithms have been developed to discover regularities in data. The analysis and the interpretation of the discovered rules are more difficult or almost impossible, given the huge number of generated rules. In this paper we propose a three step strategy to select only interesting association rules after the mining process. The proposed approach is based on the introduction of statistical tests in order to prune logical implications that are not significant.
引用
收藏
页码:387 / 398
页数:12
相关论文
共 9 条
[1]  
Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072
[2]  
Bayardo R.J., 1999, P 5 ACM SIGKDD INT C, P145, DOI [10.1145/312129.312219, DOI 10.1145/312129.312219]
[3]  
KLEMETTINEN M, 1994, P 3 INT C INF KNOWL, P401
[4]  
LIU B, 1999, P PAC AS C KNOWL DIS
[5]  
SHAH D, 1999, WORKSH NOT 1999 ACM
[6]  
SILBERSCHATZ A, 1995, P 1 INT C KNOWL DISC, P275
[7]  
TOIVONEN H, 1995, WORKSH NOT ECML 95 W, P47
[8]  
WEBER I, 1998, P KNOWL DISC DAT MIN
[9]  
[No title captured]