| 基于FIUT结构增量式频繁项集挖掘 |
| |
| 引用本文： | 寇香霞,任永功,宋奎勇.基于FIUT结构增量式频繁项集挖掘[J].计算机应用与软件,2012,29(7):105-108. |
| |
| 作者姓名： | 寇香霞 任永功 宋奎勇 |
| |
| 作者单位： | 辽宁师范大学计算机与信息技术学院 辽宁大连116029 |
| |
| 基金项目： | 教育部留学回国人员科研启动基金，辽宁省科技计划项目，辽宁省教育厅高等学校科研基金，大连市优秀青年科技人才基金 |
| |
| 摘 要： | 增量式频繁项集挖掘是当前研究的热点,基于FP-Growth的Pre-FUFP算法有效处理了频繁模式的更新,但需递归遍历FP-tree,导致效率较低。提出Pre-FIUT算法,引入频繁超度量树结构,提高了获得频繁项集挖掘效率;基于FIUT的Pre-FIUT可通过查看频繁超度量树叶子结点的支持度确定频繁项集,并与次频繁项集概念相结合进行增量式频繁项集挖掘。实验表明,Pre-FIUT算法能快速扫描和更新数据,合理利用内存,精确获得频繁项集。
|
| 关 键 词： | FIUT 数据挖掘 频繁项集 次频繁项集 Pre-FIUT算法 |
INCREMENTAL MINING OF FREQUENT ITEMSETS USING FIUT STRUCTURE |
| |
| Kou Xiangxia
,
Ren Yonggong
,
Song Kuiyong.INCREMENTAL MINING OF FREQUENT ITEMSETS USING FIUT STRUCTURE[J].Computer Applications and Software,2012,29(7):105-108. |
| |
| Authors: | Kou Xiangxia Ren Yonggong Song Kuiyong |
| |
| Affiliation: | Kou Xiangxia Ren Yonggong Song Kuiyong(School of Computer and Information Technology,Liaoning Normal University,Dalian 116029,Liaoning,China) |
| |
| Abstract: | Incremental mining of frequent itemsets is a focus in current researches.Pre-FUFP algorithm,which is based on FP-Growth,effectively deals with the updates of frequent pattern,but the mining process needs to recursively traverse the FP-tree,which results in low efficiency.In this paper we propose the Pre-FIUT algorithm,introduce the frequent items ultrametric tree structure,have improved the frequent itemsets efficiency;Pre-FIUT is based on FIUT method,it can determine the frequent itemsets by checking the support of leave nodes of frequent ultrametric tree,as well as combines the pre-large itemset concept to conduct incremental mining of frequent itemsets.Experimental results show that the proposed approach can scan and update data quickly,use memory much more reasonable,and get the frequent itemsets precisely. |
| |
| Keywords: | FIUT Data mining Frequent itemset Prelarge item Pre-FIUT algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
