DiffNodesets: An Efficient Structure for Fast Mining Frequent Itemsets

@article{Deng2016DiffNodesetsAE,
  title={DiffNodesets: An Efficient Structure for Fast Mining Frequent Itemsets},
  author={Zhi-Hong Deng},
  journal={Appl. Soft Comput.},
  year={2016},
  volume={41},
  pages={214-223}
}
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… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
10 Extracted Citations
28 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Similar Papers

Loading similar papers…