Mining Frequent Itemsets from Online Data Streams: Comparative Study
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2013, Vol 4, Issue 7
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
- EP ID EP93421
- DOI 10.14569/IJACSA.2013.040717
- Views 97
- Downloads 0
Design and Simulation of a Novel Dual Band Microstrip Antenna for LTE-3 and LTE-7 Bands
Long Term Evolution (LTE) is currently being used in many developed countries and hopefully will be implemented in more countries. An antenna operating in LTE-3 band can support global roaming in ITU Regions 1 and 3, Cos...
Backstepping Control of Induction Motor Fed by Five-Level NPC Inverter
In this paper we will present a contribution to the backstepping control for induction motor (IM) based on the principle of Field Orientated Control (FOC). This law is established step by step while ensuring the stabilit...
Visualizing Computer Programming in a Computer-based Simulated Environment
This paper investigated the challenges presented by computer programming (sequential/traditional, concurrent and parallel) for novice programmers and developers. The researcher involved Higher Education in Computer Scien...
NHCA: Developing New Hybrid Cryptography Algorithm for Cloud Computing Environment
The amount of transmitted data through the internet become larger and larger every day. The need of an encryption algorithm that guarantee transmitting data speedily and in a secure manner become a must. The aim of the r...
On Some Methods for Dimensionality Reduction of ECG Signals
Dimensionality reduction with two methods, namely, Laplacian Eigenmap (LE) and Locality Preserving Projections (LPP) is studied for normal and pathological noisy and noiseless ECG patterns. Besides, the possibility of us...