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

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Mining Recurring Patterns in Time Series

by Dharmesh Bhalodiya, Jaydeep Tadhani, Rajesh Davda
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 178 - Number 11
Year of Publication: 2019
Authors: Dharmesh Bhalodiya, Jaydeep Tadhani, Rajesh Davda
10.5120/ijca2019918826

Dharmesh Bhalodiya, Jaydeep Tadhani, Rajesh Davda . Mining Recurring Patterns in Time Series. International Journal of Computer Applications. 178, 11 ( May 2019), 1-4. DOI=10.5120/ijca2019918826

@article{ 10.5120/ijca2019918826,
author = { Dharmesh Bhalodiya, Jaydeep Tadhani, Rajesh Davda },
title = { Mining Recurring Patterns in Time Series },
journal = { International Journal of Computer Applications },
issue_date = { May 2019 },
volume = { 178 },
number = { 11 },
month = { May },
year = { 2019 },
issn = { 0975-8887 },
pages = { 1-4 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume178/number11/30571-2019918826/ },
doi = { 10.5120/ijca2019918826 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:50:03.325186+05:30
%A Dharmesh Bhalodiya
%A Jaydeep Tadhani
%A Rajesh Davda
%T Mining Recurring Patterns in Time Series
%J International Journal of Computer Applications
%@ 0975-8887
%V 178
%N 11
%P 1-4
%D 2019
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Periodic pattern mining consists of finding patterns that exhibit either complete or partial cyclic repetitions in a time series. Past studies on partial periodic search focused on finding regular patterns, i.e., patterns exhibiting either complete or partial cyclic repetitions throughout a series. An example regular pattern of Bat, Ball stats that customers have been purchasing items Bat and Ball alost every day throughout the year. The type of partial periodic pattern is recurring patens, i.e., patterns exhibiting cyclic repetitions only for particular time intervals within a series. Its a very difficult task to identify those periodic frequent patterns within given threshold in time. To overcome these problem, we introduced modification in traditional PR-tree structure. And this structure improves overall efficiency by running time, Periodic Frequent Pattern generation and Memory consumptions.

References
  1. Jiawei Han and Micheline Kamber, Data Mining Concepts and Techniques, Second Edition, Morgan Kaufmann Publications, 2006.
  2. Surana A., Kiran R.U., Reddy P.K. An Efficient Approach to Mine Periodic-Frequent Patterns in Transactional Databases. In: Cao L., Huang J.Z., Bailey J., Koh Y.S., Luo J. (eds) New Frontiers in Applied Data Mining. PAKDD 2011. Lecture Notes in Computer Science, vol 7104. Springer, Berlin, Heidelberg 2012 doi:10.1007/978-3-642-28320-8_22
  3. Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, and Young-Koo Lee, Discovering Periodic-Frequent Patterns in Transactional Databases, Springer-Verlag Berlin Heidelberg, pp. 242253, 2009.
  4. S. Ma and J. Hellerstein, Mining partially periodicevent patterns with unknown periods, in ICDE, 2001, pp. 205214.
  5. J. Han, G. Dong, and Y. Yin, Efficient mining of partial periodic patterns in time series database, in ICDE, 1999, pp. 106115.
  6. R. Yang, W. Wang, and P. Yu, Infominer+: mining partial periodic patterns with gap penalties, in ICDM, 2002, pp. 725728.
  7. Berberidis C., Vlahavas I., ArefW.G., Atallah M., Elmagarmid A.K. (2002) On the Discovery of Weak Periodicities in Large Time Series. In: Elomaa T., Mannila H., Toivonen H. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 2002. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence), vol 2431. Springer, Berlin, Heidelberg
  8. H. Cao, D. Cheung, and N. Mamoulis, Discovering partial periodic patterns in discrete data sequences, in Advances in Knowledge Discovery and Data Mining, 2004, vol. 3056, pp. 653658.
  9. W. G. Aref, M. G.s Elfeky and A. K. Elmagarmid, ”Incremental, online, and merge mining of partial periodic patterns in time-series databases,” in IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 3, pp. 332-342, Mar 2004. doi: 10.1109/TKDE.2003.1262186
  10. Bing Liu, Wynne Hsu, and Yiming Ma. 1999. Mining association rules with multiple minimum supports. In Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining (KDD ’99). ACM, New York, NY, USA, 337-341. DOI: http://dx.doi.org/10.1145/312129.312274
  11. Manziba Akanda Nishi, Chowdhury Farhan Ahmed, Md. Samiullah, and Byeong-Soo Jeong. 2013. Effective periodic pattern mining in time series databases. Expert Syst. Appl. 40, 8 (June 2013), 3015-3027. DOI: https://doi.org/10.1016/j.eswa.2012.12.017
  12. R. Uday Kiran, Haichuan Shang, Masashi Toyoda and Masaru Kitsuregawa, Discovering Recurring Patterns in Time Series, Proc.18thInternational Conference on Extending Database Technology (EDBT), March 23-27, 2015
  13. R. Agrawal, T. Imielinski, and A. Swami, Mining association rules between sets of items in large databases, in SIGMOD, 1993, pp. 207216.
Index Terms

Computer Science
Information Sciences

Keywords

Recurring Patterns RP-tree Time Series

Powered by PhDFocusTM