Strongest association rules mining for efficient applications

被引:0
作者
Li, Jie [1 ]
Xu, Yong [1 ,2 ]
Wang, Yunfeng [1 ]
Chu, Chao-Hsien [3 ]
机构
[1] Hebei Univ Technol, Sch Management, Tianjin 300401, Peoples R China
[2] Tianjin Univ, Inst Syst Engn, Tianjin 300072, Peoples R China
[3] Penn State Univ, Sch Informat Sci & Tech, University Pk, PA 16802 USA
来源
2007 INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1-3 | 2007年
关键词
data mining; association rules; strongest association rules;
D O I
暂无
中图分类号
F [经济];
学科分类号
02 ;
摘要
Rule explosion has become an important problem of association rules mining, as conventional mining algorithms often produce too many rules for decision makers to digest. In this paper, the notion of strongest association rules (SAR) is proposed for representing all association information with fewer rules, and a matrix-based algorithm is developed for mining SAR set. Our experiments show that the number of SAR is about 26% of the number of all rules in average, and the number does not monotonously increase with a smaller minimal confidence.
引用
收藏
页码:502 / +
页数:2
相关论文
共 22 条