CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A Survey on Mining Frequent Itemsets over Data Streams

by Shailvi Maurya, Sneha Ambhore, Sneha Parit
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 179 - Number 8
Year of Publication: 2017
Authors: Shailvi Maurya, Sneha Ambhore, Sneha Parit
10.5120/ijca2017916030

Shailvi Maurya, Sneha Ambhore, Sneha Parit . A Survey on Mining Frequent Itemsets over Data Streams. International Journal of Computer Applications. 179, 8 ( Dec 2017), 37-40. DOI=10.5120/ijca2017916030

@article{ 10.5120/ijca2017916030,
author = { Shailvi Maurya, Sneha Ambhore, Sneha Parit },
title = { A Survey on Mining Frequent Itemsets over Data Streams },
journal = { International Journal of Computer Applications },
issue_date = { Dec 2017 },
volume = { 179 },
number = { 8 },
month = { Dec },
year = { 2017 },
issn = { 0975-8887 },
pages = { 37-40 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume179/number8/28760-2017916030/ },
doi = { 10.5120/ijca2017916030 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:59:13.043688+05:30
%A Shailvi Maurya
%A Sneha Ambhore
%A Sneha Parit
%T A Survey on Mining Frequent Itemsets over Data Streams
%J International Journal of Computer Applications
%@ 0975-8887
%V 179
%N 8
%P 37-40
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Mining frequent itemsets over data stream has been challenging task. The incoming data from various sources like ecommerce website, click streams, text, audio, weather forecasting etc. are massive unbounded and high speed that it is impractical to store all, process and scan complete data at the same time to extract information. While processing memory and time are the main parameters must be minimum consumed. Thus the paper provides different algorithms for mining over static and dynamic data also known as data stream.

References
  1. Agrawal, R., & Srikant, R. 1994. “Fast algorithms for mining association rules”, In Proc. VLDB int. conf. very large databases (pp. 487–499).
  2. Zaki, M. 2000. “Scalable algorithms for association mining”, IEEE Transactions on Knowledge and Data Engineering, 12(3), 372–390.
  3. Chang, J., & Lee, W. S. 2003. “Finding recently frequent itemsets adaptively over online transactional data streams”, Information Systems, 31(8), 849–869.
  4. [Leung, C. K.- S., & Khan, Q. I. 2006. “DSTree: A tree structure for the mining of frequent sets from data streams”, In Proc. ICDM (pp. 928–932).
  5. Mozafari, B., Thakkar, H., & Zaniolo, C. 2008. “Verifying and mining frequent patterns from large windows over data streams”, In Proc. int. conf. ICDE (pp. 179– 188).
  6. Li, H.-F., & Lee, S.-Y. 2009. “Mining frequent itemsets over data streams using efficient window sliding techniques”, Expert Systems with Applications, 36(2), 1466–1477.
  7. Li, K., Wang, y. y., Ellahi, M., Wang, H.-an 2008. “Mining recent frequent itemsets in data streams, IEEE fifth Int. conf. on Fuzzy Syatem and Knowledge Discovery”.
  8. Tanbeer, S. K., Ahmed, C. F., Jeong, B. S., Lee, Y. K. 2009. “Sliding window-based frequent pattern mining over data streams”, Information Sciences 179 (2009) 3843–3865
  9. Deypir, M., Sadreddini, M. H., Hashemi, S. 2012. “Towards a variable size sliding window model for frequent itemset mining over data streams”, Computers & Industrial Engineering 63 (2012) 161–172.
  10. Nori, F., Deypir, M., Sadreddini, M. H., Hashemi, S. 2013. “A sliding window based algorithm for frequent closed itemset mining over data streams”, The Journal of Systems and Software 86 (2013) 615– 623.
  11. Deypir, M., Sadreddini, M. H., Hashemi, S. 2011. “A dynamic layout of sliding window for frequent itemset mining over data streams”, The Journal of Systems and Software 85 (2012) 746– 759.
  12. Harpreet Singh, Renu Dhir 2013. “A New Efficient Matrix Based Frequent Itemset Mining Algorithm with Tags”, International Journal of Future Computer and Communication, Vol. 2, No. 4.
  13. C.Ganesh, B.Sathiyabhama, T.Geetha, 2016. “Fast Frequent Pattern Mining Using Vertical Data Format for Knowledge Discovery”, International Journal of Emerging Research in Management &Technology ISSN: 2278-9359 (Volume-5, Issue-5).
Index Terms

Computer Science
Information Sciences

Keywords

Data mining data stream frequent itemsets.

Powered by PhDFocusTM