QQ客服 官方微博 反馈留言

	CLAIM: An efficient method for relaxed frequent closed itemsets mining over stream data
	Song, Guojie ; Yang, Dongqing ; Cui, Bin ; Zheng, Baihua ; Liu, Yunfeng ; Xie, Kunqing
	2007
英文摘要	Recently, frequent itemsets mining over data streams attracted much attention. However, mining closed itemsets from data stream has not been well addressed. The main difficulty lies in its high complexity of maintenance aroused by the exact model definition of closed itemsets and the dynamic changing of data streams. In data stream scenario, it is sufficient to mining only approximated frequent closed itemsets instead of in full precision. Such a compact but close-enough frequent itemset is called a relaxed frequent closed itemsets. In this paper, we first introduce the concept of RC (Relaxed frequent Closed Itemsets), which is the generalized form of approximation. We also propose a novel mechanism CLAIM, which stands for C Losed approximated Itemset Mining, to support efficiently mining of RC. The CLAIM adopts bipartite graph model to store frequent closed itemsets, use Bloom filter based hash function to speed up the update of drifted itemsets, and build a compact HR-tree structure to efficiently maintain the RCs and support mining process. An experimental study is conducted, and the results demonstrate the effectiveness and efficiency of our approach at handling frequent closed itemsets mining for data stream. ? Springer-Verlag Berlin Heidelberg 2007.; EI; 664-675; 4443 LNCS
语种	英语
出处	12th International Conference on Database Systems for Advanced Applications, DASFAA 2007
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/461635]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Song, Guojie,Yang, Dongqing,Cui, Bin,et al. CLAIM: An efficient method for relaxed frequent closed itemsets mining over stream data. 2007-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。