首页 | 官方网站   微博 | 高级检索  
     

基于DSCFCI_tree的带项目约束的数据流频繁闭合模式挖掘算法
引用本文:胡为成,王本年,程转流.基于DSCFCI_tree的带项目约束的数据流频繁闭合模式挖掘算法[J].中国科学技术大学学报,2009,39(11).
作者姓名:胡为成  王本年  程转流
作者单位:1. 铜陵学院信息技术与工程管理研究所,安徽,铜陵,244000
2. 铜陵学院信息技术与工程管理研究所,安徽,铜陵,244000;合肥工业大学计算机与信息学院,安徽,合肥,230009
基金项目:安徽省高等学校青年教师科研资助计划项目,安徽省自然科学基金,安徽省高等学校自然科学研究项目 
摘    要:根据数据流的特点,提出了一种挖掘约束频繁闭合项集的算法,该算法将数据流分段,用DSCFCI_tree动态存储潜在约束频繁闭合项集,对每一批到来的数据流,首先建立局部DSCFCI_tree,进而对全局DSCFCI_tree进行有效更新并剪枝,从而有效地挖掘整个数据流中的约束频繁闭合模式.实验表明,该算法具有很好的时间和空间效率.

关 键 词:数据挖掘  数据流  关联规则  频繁闭合项集

Algorithm for mining frequent closed patterns with item constraint over data streams based on DSCFCI tree
HU Wei-cheng,WANG Ben-nian,CHENG Zhuan-liu.Algorithm for mining frequent closed patterns with item constraint over data streams based on DSCFCI tree[J].Journal of University of Science and Technology of China,2009,39(11).
Authors:HU Wei-cheng  WANG Ben-nian  CHENG Zhuan-liu
Abstract:According to the characteristics of data streams,a new algorithm was proposed for mining constrainted frequent closed patterns.The data stream was divided into a set of segments,and a DSCFCI_tree was used to store the potential constrainted frequent closed patterns dynamically.With the arrival of each batch of data,the algorithm first built a corresponding local DSCFCI_tree,then updated and pruned the global DSCFCI_tree effectively to mine the constrainted frequent closed patterns in the entire data stream.The experiments and analysis show that the algorithm has good performance.
Keywords:data mining  data streams  association rule  frequent closed itemsets
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号