Frequent Itemset Mining with Elimination of Null Transactions Over Data Streams

  • B. Subbulakshmi
  • A. Periya Nayaki
  • C. Deisy
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 325)


A data stream is an input massive data that arrives at high speed and it is unbounded. The sliding window model is used to extract the recent frequent patterns by adjusting the window size containing only the recent transactions and eliminating the old transactions. Another acute challenge in frequent pattern mining is the presence of null transactions. Null transaction is a transaction which contains only a single item and its presence does not contribute toward frequent pattern discovery. Most of the existing streaming algorithms did not consider the overhead of null transactions, and hence, they fails to discover the frequent patterns faster during mining process. To overcome these issues, a new algorithm called frequent itemset mining using variable size sliding window with elimination of null transactions (FIM-VSSW-ENT) is used for extracting recent frequent patterns from data streams. Experimental results using synthetic and real datasets show that our proposed algorithm gives better result in terms of processing time and memory storage.


Sliding window model Data streams Concept change 


  1. 1.
    S.K. Tanbeer, C.F. Ahmed, B.S. Jeong, Y.-K. Lee, Sliding window-based frequent pattern mining over data streams. Elsevier, Inf. Sci. 179, 3843–3865 (2009)CrossRefMathSciNetGoogle Scholar
  2. 2.
    N. Jiang, L. Gruenwald, Research issues in data stream association rule mining. ACM SIGMOD Rec. 35(1), 14–19 (2006)CrossRefGoogle Scholar
  3. 3.
    C. Gianella, J. Han, J. Pei, X. Yan, P.S. Yu, Mining frequent patterns in data streams at multiple time granularities, in Proceedings of Data Mining: next generation challenges and future directions (2004) pp. 191–212Google Scholar
  4. 4.
    G.S. Manku, R. Motwani, Approximate frequency counts over data streams, in Proceedings of the 28th international conference on very large databases (2002), pp. 346–357Google Scholar
  5. 5.
    H.F. Li, S.Y. Lee, M.K. Shan, An efficient algorithm for mining frequent itemsets over the entire history of data streams, in Proceedings of the First International Workshop on Knowledge Discovery in Data Streams Conjunction With ECML and PKDD (2004)Google Scholar
  6. 6.
    M. Deypir, M.H. Sadreddini, A dynamic layout of sliding window for frequent itemset mining over data streams. Elsevier, J. Syst. Sofware. 85, 746–759 (2012)CrossRefGoogle Scholar
  7. 7.
    M. Deypir, M.H. Sadreddini, S. Hashemi, Towards a variable size sliding window model for frequent itemset mining over data streams. Elsevier, Comput. Ind. Eng. 63, 161–172 (2012)CrossRefGoogle Scholar
  8. 8.
    B. Nair, A.K. Tripathy, Accelerating Closed Frequent Itemset Mining by Elimination of Null Transactions. J. Emerg. Trends Comput. Inf. Sci. 2(7), 317–324 (2011)Google Scholar
  9. 9.
    B. Goethals, Frequent Set Mining. Data Mining and Knowledge Discovery Handbook. (Springer, New York, 2005), pp. 377–397Google Scholar
  10. 10.
    C.K.S. Leung, Q.I. Khan, DSTree-a tree structure for the mining of frequent sets from data streams, in Proceedings ICDM (2006), pp. 928–932Google Scholar

Copyright information

© Springer India 2015

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringThiagarajar College of EngineeringMaduraiIndia

Personalised recommendations