QQ客服 官方微博 反馈留言

	An efficient approach for interactive mining of frequent itemsets
	Deng, ZH ; Li, X ; Tang, SW
	2005
英文摘要	There have been many studies on efficient discovery of frequent itemsets in large databases. However, it is nontrivial to mine frequent itemsets under interactive circumstances where users often change minimum support threshold (minsup) because the change of minsup may invalidate existing frequent itemsets or introduce new frequent itemsets. In this paper, we propose an efficient interactive mining technique based on a novel vertical itemset tree (VI-tree) structure. An important feature of our algorithm is that it does not have to re-examine the existing frequent itemsets when minsup becomes small. Such feature makes it very efficient for interactive mining. The algorithm we proposed has been implemented and its performance is compared with re-running Eclat, a vertical mining algorithm, under different minsup. Experimental results show that our algorithm is over two orders of magnitude faster than the latter in average.; Computer Science, Information Systems; Computer Science, Theory & Methods; SCI(E); CPCI-S(ISTP); 0
语种	英语
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/292257]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Deng, ZH,Li, X,Tang, SW. An efficient approach for interactive mining of frequent itemsets. 2005-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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