Mining Frequent Itemsets from Online Data Streams: Comparative Study

Abstract

Online mining of data streams poses many new challenges more than mining static databases. In addition to the one-scan nature, the unbounded memory requirement, the high data arrival rate of data streams and the combinatorial explosion of itemsets exacerbate the mining task. The high complexity of the frequent itemsets mining problem hinders the application of the stream mining techniques. In this review, we present a comparative study among almost all, as we are acquainted, the algorithms for mining frequent itemsets from online data streams. All those techniques immolate with the accuracy of the results due to the relatively limited storage, leading, at all times, to approximated results.

Authors and Affiliations

HebaTallah Nabil, Ahmed Eldin, Mohamed Belal

Keywords

Related Articles

Software Cost Estimation using Enhanced Artificial Bee Colony Algorithm

Cost estimation is very important in software development progress so that resource and time planning can be successfully performed. Accurate estimation of cost is directly related to the decision making mechanism in the...

An Open Source P2P Encrypted Voip Application

Open source is the future of technology. This community is growing by the day; developing and improving existing frameworks and software for free. Open source replacements are coming up for almost all proprietary softwar...

Recent Approaches to Enhance the Efficiency of Ultra-Wide Band MAC Protocols

Ultra-wide band (UWB) is a promising radio technology to transmit huge data in short distances between different digital devices or between individual components of a personal computer. Due to the magnificent features of...

Performance Analysis of Proposed Congestion Avoiding Protocol for IEEE 802.11s

The wireless technology is one of the core compo-nents of mobile applications with mobility support at low deploy-ment costs. Among these, Wireless Mesh Network (WMN) is one of the technologies that supports mobile users...

Efficient Distributed SPARQL Queries on Apache Spark

RDF is a widely-accepted framework for describing metadata in the web due to its simplicity and universal graph-like data model. Owing to the abundance of RDF data, existing query techniques are rendered unsuitable. To t...

Download PDF file
  • EP ID EP93421
  • DOI 10.14569/IJACSA.2013.040717
  • Views 107
  • Downloads 0

How To Cite

HebaTallah Nabil, Ahmed Eldin, Mohamed Belal (2013). Mining Frequent Itemsets from Online Data Streams: Comparative Study. International Journal of Advanced Computer Science & Applications, 4(7), 117-125. https://europub.co.uk/articles/-A-93421