Mining frequent, maximal and closed frequent itemsets over data stream - a review

M. Jeya Sutha and F. Ramesh Dhanaseelan

International Journal of Data Analysis Techniques and Strategies, 2017, vol. 9, issue 1, 46-62

Abstract: Numerous global applications like traffic modelling, military sensing and tracking, online data processing, etc., generate large volume of data stream. Due to broad range of applications, to estimate the frequency of the items becomes an important problem. This paper reviews the state-of-the-art algorithm for identifying frequent items from data stream. The processing techniques and data synopsis structure of each algorithm are described and compared. The different window models for processing the stream have been identified and discussed. The characteristics and limitations of the algorithms of each model are presented, and issues regarding the improvement are discussed.

Keywords: data mining; data stream; frequent itemset mining; stream mining algorithms; window models; frequent itemsets. (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=83068 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:injdan:v:9:y:2017:i:1:p:46-62

Access Statistics for this article

More articles in International Journal of Data Analysis Techniques and Strategies from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().