Mining frequent, maximal and closed frequent itemsets over data stream - a review
by M. Jeya Sutha; F. Ramesh Dhanaseelan
International Journal of Data Analysis Techniques and Strategies (IJDATS), Vol. 9, No. 1, 2017

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.

Online publication date: Mon, 20-Mar-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Analysis Techniques and Strategies (IJDATS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com