Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
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)
N. Jiang, L. Gruenwald, Research issues in data stream association rule mining. ACM SIGMOD Rec. 35(1), 14–19 (2006)
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–212
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–357
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)
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)
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)
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)
B. Goethals, Frequent Set Mining. Data Mining and Knowledge Discovery Handbook. (Springer, New York, 2005), pp. 377–397
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–932
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer India
About this paper
Cite this paper
Subbulakshmi, B., Periya Nayaki, A., Deisy, C. (2015). Frequent Itemset Mining with Elimination of Null Transactions Over Data Streams. In: Suresh, L., Dash, S., Panigrahi, B. (eds) Artificial Intelligence and Evolutionary Algorithms in Engineering Systems. Advances in Intelligent Systems and Computing, vol 325. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2135-7_38
Download citation
DOI: https://doi.org/10.1007/978-81-322-2135-7_38
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2134-0
Online ISBN: 978-81-322-2135-7
eBook Packages: EngineeringEngineering (R0)