CFP last date
20 January 2025
Reseach Article

Kalman Filter based Flexible Sliding Window Algorithm for Mining Frequent Itemset over Data Stream

by Shailvi Maurya, S. K. Shrivastava
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 111 - Number 9
Year of Publication: 2015
Authors: Shailvi Maurya, S. K. Shrivastava
10.5120/19564-1322

Shailvi Maurya, S. K. Shrivastava . Kalman Filter based Flexible Sliding Window Algorithm for Mining Frequent Itemset over Data Stream. International Journal of Computer Applications. 111, 9 ( February 2015), 13-19. DOI=10.5120/19564-1322

@article{ 10.5120/19564-1322,
author = { Shailvi Maurya, S. K. Shrivastava },
title = { Kalman Filter based Flexible Sliding Window Algorithm for Mining Frequent Itemset over Data Stream },
journal = { International Journal of Computer Applications },
issue_date = { February 2015 },
volume = { 111 },
number = { 9 },
month = { February },
year = { 2015 },
issn = { 0975-8887 },
pages = { 13-19 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume111/number9/19564-1322/ },
doi = { 10.5120/19564-1322 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:47:24.317512+05:30
%A Shailvi Maurya
%A S. K. Shrivastava
%T Kalman Filter based Flexible Sliding Window Algorithm for Mining Frequent Itemset over Data Stream
%J International Journal of Computer Applications
%@ 0975-8887
%V 111
%N 9
%P 13-19
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A data stream mining is relevant issue in the context of information gain. The data arrived are large in amount limitless and high rate with time impractical to stock, excavating and testimony at identical measure of time to retrieve intelligence. Sliding window model utilized for frequent pattern mining data stream mining emphasis on recent data and minimum space consumed. In past algorithm window measurement change was steady to concept variation when stagnant and gets smaller when the concept variation happens. Renewed frequent patterns are moderately kept in the current concept whereas the stable transaction is moved out of window. Panes steadily combined to window and performing unnecessary mining for frequent itemsets, conduct is diminishing. Based on the sliding window model the new algorithm named KF_FSW (Kalman Filter based Flexible Sliding Window Model) which utilize Kalman filter function for prediction and measurement approach. The prediction and measurement method is done on basis of already existing information as measure. Thus coagulating the error for accurate position of behavior variation in window size fluctuates in streamed database. Test on standard dataset reports that proposed algorithm coagulates less number of windows for mining and even predicting efficiently the number of count for change ratio captured by occurring change variation.

References
  1. PhridviRaj, M. S. B. and GuruRao, C. V. 2014. "Data mining – past, present and future – a typical survey on data streams", The 7th International Conference Interdisciplinarity in Engineering, Procedia Technology 12 255 – 263.
  2. Aggarwal, C. C. 2007. "Data Streams – Models and Algorithms", Springer
  3. Deypir, M. , Sadreddini, M. H. and Hashemi, S. "A dynamic layout of sliding window for frequent itemset mining over data streams", The Journal of Systems and Software, 2012, 85 746– 759.
  4. Zaki, M. 2000 "Scalable algorithms for association mining", IEEE Transactions on Knowledge and Data Engineering, 12(3), 372–390.
  5. Borgelt, C. , 2003. "Efficient Implementations of Apriori and Eclat", Workshop of Frequent Item Set Mining Implementations.
  6. Thieme, L. S. , 2005. "Algorithmic Features of Eclat", Computer-based New Media Group.
  7. Li, K. , Wang, Y. Y. , Ellahi, M and Wang, H. -an. 2008. "Mining recent frequent itemsets in data streams", IEEE fifth Int. conf. on Fuzzy System and Knowledge Discovery.
  8. Chandrika, J. , Kumar, Dr. K. R. A. "Frequent Itemset Mining in Transactional Data Streams Based on Quality Control and Resource Adaptation", International Journal of Data Mining & Knowledge Management Process (IJDKP), 2012, Vol. 2.
  9. Kifer, D. , David, S. B. , Gehrke, J. 2004. "Detecting Change in Data Streams", Proceedings of the 30th VLDB Conference.
  10. Agrawal, R. , and Srikant, R. 1994. "Fast algorithms for mining association rules", In Proc. VLDB int. conf. very large databases, pp. 487–499.
  11. Chang, J. and Lee, W. S. 2003. "Finding recently frequent itemsets adaptively over online transactional data streams", Information Systems, 31(8), 849–869.
  12. "The Kalman Filter", Internet: www. ion. org/museum/item_view. cfm?cid=6&scid=5&iid=293.
  13. Leung, C. K- S and Khan, Q. I. 2006. "DSTree: A tree structure for the mining of frequent sets from data streams", In Proc. ICDM, pp. 928–932.
  14. Mozafari, B. , Thakkar, H. and Zaniolo, C. 2008. "Verifying and mining frequent patterns from large windows over data streams", In Proc. int. conf. ICDE, pp. 179– 188.
  15. Li, H. -F. and Lee, S. -Y. 2009. "Mining frequent itemsets over data streams using efficient window sliding techniques", Expert Systems with Applications, 36(2), 1466–1477.
  16. Tanbeer, S. K. , Ahmed, C. F. , Jeong, B. S. and Lee, Y. K. 2009. "Sliding window-based frequent pattern mining over data streams", Information Sciences, 179 3843–3865.
  17. Deypir, M. , Sadreddini, M. H. and Hashemi, S. 2012. "Towards a variable size sliding window model for frequent itemset mining over data streams". Computers & Industrial Engineering, 63 161–172.
  18. Nori, F. , Deypir, M. , Sadreddini, M. H. and. Hashemi, M. H. "A sliding window based algorithm for frequent closed itemset mining over data streams", The Journal of Systems and Software, 2013, 86 615– 623.
  19. Faragher, R. 2012. "Understanding the Basis of the Kalman Filter Via a Simple and Intuitive Derivation", IEEE Signal Processing Magazine
  20. "BMSWebView1 (Gazelle) ( KDD CUP 2000)", http://www. philippe-fournieviger. com/spmf/index. php?link=datasets. php
  21. Flouvat, F. 2005. "Experimental study of frequent itemsets datasets".
Index Terms

Computer Science
Information Sciences

Keywords

Data Mining Data Stream Sliding Window Model Frequent itemsets Kalman filter Concept Change.