首页 | 本学科首页   官方微博 | 高级检索  
     

基于FP-Tree有效挖掘最大频繁项集
引用本文:颜跃进,李舟军,陈火旺.基于FP-Tree有效挖掘最大频繁项集[J].软件学报,2005,16(2):215-222.
作者姓名:颜跃进  李舟军  陈火旺
作者单位:国防科学技术大学,计算机学院,湖南,长沙,410073
基金项目:Supported by the National Natural Science Foundation of China under Grant Nos.90104026, 60073001 (国家自然科学基金); the National High-Tech Research and Development Plan of China under Grant No.2002AA144040 (国家高技术研究发展计划(863))
摘    要:最大频繁项集的挖掘过程中,在最小支持度较小的情况下,超集检测是算法的主要耗时操作.提出了最大频繁项集挖掘算法FPMFI(frequent pattern tree for maximal frequent item set)使用基于投影进行超集检测的机制,有效地缩减了超集检测的时间.另外,算法FPMFI通过删除FP子树(conditional frequent pattern tree)的冗余信息,有效地压缩了FP子树的规模,减少了遍历的开销.分析表明,算法FPMFI具有优越性.实验比较说明,在最小支持度较小时,算法FPMFI的性能优于同类算法1倍以上.

关 键 词:最大频繁项集  频繁模式树  超集检测  最大频繁项集投影
收稿时间:1/6/2004 12:00:00 AM
修稿时间:2004年1月6日

Efficiently Mining of Maximal Frequent Item Sets Based on FP-Tree
YAN Yue-Jin,LI Zhou-Jun and CHEN Huo-Wang.Efficiently Mining of Maximal Frequent Item Sets Based on FP-Tree[J].Journal of Software,2005,16(2):215-222.
Authors:YAN Yue-Jin  LI Zhou-Jun and CHEN Huo-Wang
Abstract:During the process of mining maximal frequent item sets, when minimum support is little, superset checking is a kind of time-consuming and frequent operation in the mining algorithm. In this paper, a new algorithm FPMFI (frequent pattern tree for maximal frequent item sets) for mining maximal frequent item sets is proposed. It adopts a new superset checking method based on projection of the maximal frequent item sets, which efficiently reduces the cost of superset checking. In addition, FPMFI also compresses the conditional FP-Tree (frequent pattern tree) greatly by deleting the redundant information, which can reduce the cost of accessing the tree. It is proved by theoretical analysis that FPMFI has superiority and it is revealed by experimental comparison that the performance of FPMFI is superior to that of the similar algorithm based on FP-Tree more than one time.
Keywords:maximal frequent item set  frequent pattern tree  superset check  maximal frequent item sets projection
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号