Association Rules Mining Based on Minimal Generator of Frequent Closed Itemset

被引:1
作者
Chen, Xiao-mei [1 ]
Wang, Chang-ying [1 ]
Cao, Han [2 ]
机构
[1] Fujian Agr & Forestry Univ, Coll Comp & Informat Sci, Fuzhou 350002, Peoples R China
[2] Shaanxi Normal Univ, Dept Comp Sci, Xian 710062, Peoples R China
来源
ECOSYSTEM ASSESSMENT AND FUZZY SYSTEMS MANAGEMENT | 2014年 / 254卷
关键词
Frequent closed itemset; Adjacent map; Minimal generator;
D O I
10.1007/978-3-319-03449-2_26
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
As there is rules redundancy in mining association rules with traditional methods, an improvement is presented by increasing combinations of itemsets based on minimal generator method; thus, the loss of minimal generator items of frequent closed itemsets is avoided, and the concept and process of rule generation algorithm are further simplified, which makes the algorithm more readable and easier to implement. Experimental results show that the algorithm provide better integrity of minimal generator items and more effective association rules without increasing timing cost.
引用
收藏
页码:275 / 282
页数:8
相关论文
共 6 条
[1]  
Bastide Y., 2000, P 1 INT C COMP LOG, P927
[2]   Interestingness measures for data mining: A survey [J].
Geng, Liqiang ;
Hamilton, Howard J. .
ACM COMPUTING SURVEYS, 2006, 38 (03) :3
[3]  
[李杰 LI Jie], 2007, [计算机工程, Computer Engineering], V33, P46
[4]  
Luo Guang-rui, 2010, Computer Engineering, V36, P36
[5]  
Pasquier N, 1999, LECT NOTES COMPUT SC, V1540, P398
[6]  
Shao F., 2009, DATA MINING PRINCIPL, V9, P90