DiffNodesets: An efficient structure for fast mining frequent itemsets

doi:10.1016/j.asoc.2015.01.010

CORC > 北京大学 > 信息科学技术学院

	DiffNodesets: An efficient structure for fast mining frequent itemsets
	Deng, Zhi-Hong
刊名	APPLIED SOFT COMPUTING
	2016
关键词	Data mining Frequent itemset mining DiffNodesets Algorithm Performance ERASABLE ITEMSETS ALGORITHM PATTERNS LISTS TREE
DOI	10.1016/j.asoc.2015.01.010
英文摘要	Mining frequent itemsets is an essential problem in data mining and plays an important role in many data mining applications. In recent years, some itemset representations based on node sets have been proposed, which have shown to be very efficient for mining frequent itemsets. In this paper, we propose DiffNodeset, a novel and more efficient itemset representation, for mining frequent itemsets. Based on the DiffNodeset structure, we present an efficient algorithm, named dFIN, to mining frequent itemsets. To achieve high efficiency, dFIN finds frequent itemsets using a set-enumeration tree with a hybrid search strategy and directly enumerates frequent itemsets without candidate generation under some case. For evaluating the performance of dFIN, we have conduct extensive experiments to compare it against with existing leading algorithms on a variety of real and synthetic datasets. The experimental results show that dFIN is significantly faster than these leading algorithms. (C) 2016 Elsevier B.V. All rights reserved.; SCI(E); EI; ARTICLE; zhdeng@cis.pku.edu.cn; 214-223; 41
语种	英语
内容类型	期刊论文
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/437477]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Deng, Zhi-Hong. DiffNodesets: An efficient structure for fast mining frequent itemsets[J]. APPLIED SOFT COMPUTING,2016.
APA	Deng, Zhi-Hong.(2016).DiffNodesets: An efficient structure for fast mining frequent itemsets.APPLIED SOFT COMPUTING.
MLA	Deng, Zhi-Hong."DiffNodesets: An efficient structure for fast mining frequent itemsets".APPLIED SOFT COMPUTING (2016).