MFIS—Mining Frequent Itemsets on Data Streams

  • Zhi-jun Xie
  • Hong Chen
  • Cuiping Li
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4093)


We propose an efficient approach to mine frequent Itemsets on data streams. It is a memory efficient and accurate one-pass algorithm that can deal with batch updates. The proposed algorithm performers well by dividing all frequent itemsets into frequent equivalence classes and pruning all redundant itemsets except for those that represent GLB (Greatest Lower Bound) and LUB (Least Upper Bound) of the frequent equivalence classes. The number of GLB and LUB is much less than the number of frequent itemsets. The experimental evaluation on synthetic and real datasets shows that the algorithm is very accurate and requires significantly lower memory than other well-known one-pass algorithms.


Equivalence Class Data Stream Frequent Itemsets Support Level Frequent Itemset Mining 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. Very Large Databases (VLDB 1994), September 1994, pp. 487–499. Santiago, Chile (1994)Google Scholar
  2. 2.
    Borgelt, C.: Apriori implementation,
  3. 3.
    Gehrke, J., Korn, F., Srivastava, D.: On computing correlated aggregates over continual data streams. In: Proc. ACM SIGMOD Management of Data, June 2001, pp. 13–24 (2001)Google Scholar
  4. 4.
    Goethals, B.: FP-tree Implementation,
  5. 5.
    Jin, R., Agrawal, G.: An algorithm for in-core frequent itemset mining on streaming data. In: International Conference on Data Mining 2005 (ICDM 2005), pp. 210–217 (2005)Google Scholar
  6. 6.
    Zaki, M.J., Hsiao, C.: Charm, An efficient algorithm for closed itemset mining. In: 2nd SIAM Data Mining (2002)Google Scholar
  7. 7.
    Han, J., Pei, J., Yin, Y.: Mining Frequent patterns without candidate generation. In: Proceedings of the ACM SIGMOD Conference on Management of Data (2000)Google Scholar
  8. 8.
    Li, C., Cong, G., Tung, A.K.H., Wang, S.: Incremental Maintenance of Quotient Cube for sum and Median. SIGKDD, pp. 226–235 (2004)Google Scholar
  9. 9.
    Manku, G.S., Motwain, R.: Approximate Frequency Counts Over Data Streams. In: Proceedings of Conference on Very Large Database (VLDB), pp. 346–357 (2002)Google Scholar
  10. 10.
    Xie, Z., Chen, H., Li, C.: An Efficient Algorithm for Frequent Itemset Mining on Data Streams. In: Perner, P. (ed.) ICDM 2006. LNCS (LNAI), vol. 4065, pp. 474–491. Springer, Heidelberg (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Zhi-jun Xie
    • 1
  • Hong Chen
    • 1
  • Cuiping Li
    • 1
  1. 1.School of InformationRenmin UniversityBeijingP.R. China

Personalised recommendations