A new algorithm for fast mining frequent itemsets using N-lists

@article{Deng2012ANA,
  title={A new algorithm for fast mining frequent itemsets using N-lists},
  author={Zhi-Hong Deng and Zhonghui Wang and Jia-Jian Jiang},
  journal={Science China Information Sciences},
  year={2012},
  volume={55},
  pages={2008-2030}
}
Mining frequent itemsets has emerged as a fundamental problem in data mining and plays an essential role in many important data mining tasks. In this paper, we propose a novel vertical data representation called N-list, which originates from an FP-tree-like coding prefix tree called PPC-tree that stores crucial information about frequent itemsets. Based on the N-list data structure, we develop an efficient mining algorithm, PrePost, for mining all frequent itemsets. Efficiency of PrePost is… CONTINUE READING
26 Citations
24 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 26 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 24 references

A new fast vertical method for mining frequent itemsets

  • H DengZ, H WangZ
  • Int J Comput Intell Syst
  • 2010

An efficient algorithm for mining closed inter-transaction itemsets

  • J TLeeA, C SWang, W YWeng
  • Data Knowle Eng,
  • 2008

Mining impact - targeted activity itemsets in imbalanced data

  • X Li, H DengZ
  • IEEE TKDE
  • 2008

Frequent itemset mining : current status and future directions

  • J Han, H Cheng, D Xin
  • Data Min Knowl Discov
  • 2007

On compressing frequent itemsets

  • Z HDeng
  • Sci China Inf Sci September 2012 Vol
  • 2007

Similar Papers

Loading similar papers…