Title
DiffNodesets: An efficient structure for fast mining frequent itemsets.
Abstract
•In this paper, we propose an algorithm named dFIN for frequent itemset mining.•dFIN achieves high performance by employing DiffNodesets to represent itemsets.•Experiment results on real datasets show that dFIN is effective and outperforms state-of-the-art algorithms.
Year
DOI
Venue
2015
10.1016/j.asoc.2016.01.010
Applied Soft Computing
Keywords
Field
DocType
Data mining,Frequent itemset mining,DiffNodesets,Algorithm,Performance
Data mining,Artificial intelligence,Machine learning,Mathematics
Journal
Volume
ISSN
Citations 
41
1568-4946
15
PageRank 
References 
Authors
0.55
36
1
Name
Order
Citations
PageRank
Zhi-Hong Deng118523.33