四川大学学报：工程科学版2012，Vol.44Issue(3)：112-117,6.
分布式数据库全局最大频繁项集增量更新算法
Incremental Updating Algorithm of Global Maximum Frequent Itemsets in Distributed Database
摘要
Abstract
On the basis of the fast mining algorithm for global maximum frequent itemsets,an incremental updating algorithm,named as IUGMFI algorithm,was proposed.The algorithm made use of the global frequent items and global maximum frequent itemsets in distributed database.Firstly,the global frequent items were mined in incremental distributed database.Secondly,the FP-tree was constructed in incremental distributed database.Thirdly,the global maximum frequent itemsets were mined in incremental distributed database.Finally,the global maximum frequent itemsets were updated by the strategy of top-down.Theoretical analysis and experimental results showed that IUGMFI algorithm is fast and effective.关键词
数据挖掘/频繁模式树/全局最大频繁项集/增量更新算法Key words
data mining/FP-tree/global maximum frequent itemset/increasing updating algorithm分类
信息技术与安全科学引用本文复制引用
何波,闫河..分布式数据库全局最大频繁项集增量更新算法[J].四川大学学报：工程科学版,2012,44(3):112-117,6.基金项目
国家自然科学基金资助项目 （）
深圳市生物、互联网、新能源产业发展专项资金资助项目 （）
深圳市高性能数据挖掘重点实验室资助项目 （）
