Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2013.040717
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 4 Issue 7, 2013.
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.
HebaTallah Mohamed Nabil, Ahmed Sharaf Eldin and Mohamed Abd El-Fattah Belal, “Mining Frequent Itemsets from Online Data Streams: Comparative Study” International Journal of Advanced Computer Science and Applications(IJACSA), 4(7), 2013. http://dx.doi.org/10.14569/IJACSA.2013.040717