| 基于项集分解的快速挖掘最大频繁项集算法 |
| |
| 引用本文： | 余平,汪继文.基于项集分解的快速挖掘最大频繁项集算法[J].佳木斯大学学报,2009,27(4):511-513. |
| |
| 作者姓名： | 余平 汪继文 |
| |
| 作者单位： | 余平(淮南联合大学计算机系,安徽,淮南,232038);汪继文(安徽大学计算机科学与技术学院,安徽,合肥,230039) |
| |
| 摘 要： | 对Apriori算法的分析,提出采用分解事务数据库中最长的项集,使用前缀划分的表示方法,从而快速地归纳出事务数据库中的最大频繁项集.
|
| 关 键 词： | 关联规则 Apriori算法 项集分解 |
Fast Mining of Maximum Frequent Item-set Based on Item-set Dismantling |
| |
| YU Ping,WANG Ji-wen.Fast Mining of Maximum Frequent Item-set Based on Item-set Dismantling[J].Journal of Jiamusi University(Natural Science Edition),2009,27(4):511-513. |
| |
| Authors: | YU Ping WANG Ji-wen |
| |
| Institution: | 1.Dept.of Computer;Huainan Union University;Huainan 232038;China;2.School of Computer Science and Technology;Anhui University;Hefei 232039;China |
| |
| Abstract: | In this paper,by analyzing Apriori algorithm,the longest item-set was dismantled using a method of a prefix partition,so the max frequent item-set of traction database can be inducted quickly. |
| |
| Keywords: | association rule Apriori algorithm item-set dismantling |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
