Volume 7 Number 1 (Jan. 2012)
Home > Archive > 2012 > Volume 7 Number 1 (Jan. 2012) >
JSW 2012 Vol.7(1): 25-32 ISSN: 1796-217X
doi: 10.4304/jsw.7.1.25-32

A Simple but Effective Maximal Frequent Itemset Mining Algorithm over Streams

Haifeng Li, Ning Zhang, and Zhixin Chen
School of Information, Central University of Finance and Economics, Beijing China

Abstract—Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in frequent itemsets using less space, thus being more suitable for stream mining. This paper considers a simple but effective algorithm for mining maximal frequent itemsets over a stream landmark. We design a compact data structure named FP-FOREST to improve an state-of-the-art algorithm INSTANT; thus, itemsets can be compressed and the support counting can be effective performed. Our experimental results show our algorithm achieves a better performance in memory cost and running time cost.

[PDF]

Cite:Haifeng Li, Ning Zhang, Zhixin Chen, "A Simple but Effective Maximal Frequent Itemset Mining Algorithm over Streams," Journal of Software vol. 9, no.1, pp. 25-32, 2012.

General Information

ISSN: 1796-217X (Online)
Frequency: Monthly
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Yoyo Y. Zhou
Abstracting/ Indexing: DBLP, EBSCO, ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat, etc
E-mail: jsw@iap.org
  • Dec 06, 2019 News!

    Vol 14, No 1- Vol 14, No 4 has been indexed by EI (Inspec)   [Click]

  • Nov 18, 2019 News!

    Papers published in JSW Vol 14, No 1- Vol 14 No 10 have been indexed by DBLP     [Click]

  • Dec 06, 2019 News!

     Vol 13, No 10- Vol 13, No 12 has been indexed by EI (Inspec)   [Click]

  • Aug 01, 2018 News!

    [CFP] 2020 the annual meeting of JSW Editorial Board, ICCSM 2020, will be held in Rome, Italy, July 17-19, 2020   [Click]

  • Jun 25, 2019 News!

    Vol.13, No.9 has been indexed by EI (Inspec).   [Click]