Efficient mining of top k-closed itemset in real time

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Shah, R. A., Meena, M. J., & Syed Ibrahim, S. P. (2016). Efficient mining of top k-closed itemset in real time. In Smart Innovation, Systems and Technologies (Vol. 49, pp. 317–324). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-319-30348-2_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free