| H-C:基于H-Struct的频繁闭合项集挖掘算法 |
| |
| 引用本文： | 王丹丹,刘同明,张静.H-C:基于H-Struct的频繁闭合项集挖掘算法[J].江苏科技大学学报(社会科学版),2006,20(4):60-63. |
| |
| 作者姓名： | 王丹丹 刘同明 张静 |
| |
| 作者单位： | 南通大学计算机学院 江苏南通226007(王丹丹)，江苏科技大学电子信息学院 江苏镇江212003(刘同明，张静) |
| |
| 摘 要： | 提出了一种基于H-struct结构的频繁闭合项集挖掘算法H-C。该算法利用了H-struct动态链接结构的特点,快速且高效地挖掘闭合的频繁项集,大大减少了冗余关联规则的产生。试验表明该算法对大型数据库的处理效率和扩展性优于传统的频繁项集生成算法。
|
| 关 键 词： | 数据挖掘 频繁闭合项集 关联规则 |
| 文章编号： | 1673-4807（2006）04-0060-04 |
| 收稿时间： | 2005-12-13 |
| 修稿时间： | 2005年12月13 |
H-C: An Algorithm for Mining Frequent Closed Itemsets Based on H-Struct |
| |
| WANG Dandan,LIU Tongming,ZHANG Jing.H-C: An Algorithm for Mining Frequent Closed Itemsets Based on H-Struct[J].Journal of Jiangsu University of Science and Technology:Natural Science Edition,2006,20(4):60-63. |
| |
| Authors: | WANG Dandan LIU Tongming ZHANG Jing |
| |
| Institution: | 1. Dept. of Computer of Science and Technology, Nantong University, Nantong Jiangsu 226007, China; 2. School of Electronics and Information, Jiangsu University of Science and Technology, Zhenjiang Jiangsu 212003, China |
| |
| Abstract: | A new algorithm for mining the frequent closed itemsets based on the H-Struct is put forward.It can take advantages of the characteristic of H-struct in dynamic link and decrease the number of redundant association rules in the process of mining frequent closed itemsets fast and efficiently.Experiments show that the efficiency and extensionality of this algorithm precede the previously developed algorithms in the mining of large databases. |
| |
| Keywords: | data mining frequent closed itemsets association rules |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
