Abstract
Analytics of Streaming data has been interesting and one of the profound research areas in the Data Science. Analysis and examination of real time data is one of the major areas of challenge in the BigData Analytics. One of the areas of research being mining of top k-closed frequent Itemsets in real time. Therefore an efficient algorithm MCSET(Mining closed itemsets) is proposed which uses Hash mapping technique to mine efficiently the closed itemsets. Experimental results shows that proposed algorithm has improved the scalability and improved the time efficiency compared to the existing closed association rule mining algorithm of data streams.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Agarwal, R., Srikant, R.: Quest synthetic DataGenerator. <http://www.Almaden.ibm.com/cs/quest/syndata.html> (1994)
Data mining-FP growth algorithm-stack overflow. <stackoverflow.com/questions/5448493/fp-growth-algorithm>
Fournier-Viger, P., Wu, C.W., Zida, S., Tseng, V.S.: FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning. Found. Intell. Syst. 8502(2014), 83–92
Lin, C.-W., Hong, T.-P., Lan, G.-C., Wong, J.-W., Lin, W.-Y.: Efficient updating of discovered high utility item sets for transaction deletion in dynamic databases. Adv. Eng. Inf. 29(2015), 16–27. <www.elsevier.com/locate/aei>
Lin, C.W., Hong, T.P., Lu, W.H.: The pre-FUFP algorithm for incremental mining. Expert Sys. Appl. 34, 2424–2435 (2008)
Lin, J.C.W., Gan, W., Hong, T.-P.: A fast updated algorithim to maintain the discovered high-utility itemsets for transaction modification. doi:10.1016/j.aei.2015.05.003. <http://www.elsevier.com/locate/aei> (2015)
Need of temporal database. <stackoverflow.com/questions/…/why-do-we-need-a-temporal-database>
Song, W., Liu, Y., Li, J.: Mining high utility itemsets utility by dynamically pruning the tree. Struct. Appl. Intell. 1–15 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Shah, R.A., Meena, M.J., Syed Ibrahim, S.P. (2016). Efficient Mining of Top k-Closed Itemset in Real Time. In: Vijayakumar, V., Neelanarayanan, V. (eds) Proceedings of the 3rd International Symposium on Big Data and Cloud Computing Challenges (ISBCC – 16’). Smart Innovation, Systems and Technologies, vol 49. Springer, Cham. https://doi.org/10.1007/978-3-319-30348-2_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-30348-2_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-30347-5
Online ISBN: 978-3-319-30348-2
eBook Packages: EngineeringEngineering (R0)