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.


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:  Quarterly
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Yoyo Y. Zhou
Abstracting/ Indexing: DBLP, EBSCO, CNKIGoogle Scholar, ProQuest, INSPEC(IET), ULRICH's Periodicals Directory, WorldCat, etc
E-mail: jsweditorialoffice@gmail.com
  • Mar 01, 2024 News!

    Vol 19, No 1 has been published with online version    [Click]

  • Jan 04, 2024 News!

    JSW will adopt Article-by-Article Work Flow

  • Apr 01, 2024 News!

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

  • Apr 01, 2024 News!

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

  • Nov 02, 2023 News!

    Vol 18, No 4 has been published with online version   [Click]