{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T20:07:40Z","timestamp":1778875660666,"version":"3.51.4"},"reference-count":35,"publisher":"Wiley","license":[{"start":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T00:00:00Z","timestamp":1609718400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Islamic University of Madinah","award":["24\/40"],"award-info":[{"award-number":["24\/40"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Scientific Programming"],"published-print":{"date-parts":[[2021,1,4]]},"abstract":"<jats:p>Finding flexible periodic patterns in a time series database is nontrivial due to irregular occurrence of unimportant events, which makes it intractable or computationally intensive for large datasets. There exist various solutions based on Apriori, projection, tree, and other techniques to mine these patterns. However, the existence of constant size tree structure, i.e., suffix tree, with extra information in memory throughout the mining process, redundant and invalid pattern generation, limited types of mined flexible periodic patterns, and repeated traversal over tree data structure for pattern discovery, results in unacceptable space and time complexity. In order to overcome these issues, we introduce an efficient approach called HOVA-FPPM based on Apriori approach with hashed occurrence vectors to find all types of flexible periodic patterns. We do not rely on complex tree structure rather manage necessary information in a hash table for efficient lookup during the mining process. We measured the performance of our proposed approach and compared the results with the baseline approach, i.e., FPPM. The results show that our approach requires lesser time and space, regardless of the data size or period value.<\/jats:p>","DOI":"10.1155\/2021\/8841188","type":"journal-article","created":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T01:20:07Z","timestamp":1609809607000},"page":"1-14","source":"Crossref","is-referenced-by-count":12,"title":["HOVA-FPPM: Flexible Periodic Pattern Mining in Time Series Databases Using Hashed Occurrence Vectors and Apriori Approach"],"prefix":"10.1155","volume":"2021","author":[{"given":"Muhammad Fasih","family":"Javed","sequence":"first","affiliation":[{"name":"IKMA Lab, Department of Computer Science, National University of Computer and Emerging Sciences, Islamabad, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9989-6163","authenticated-orcid":true,"given":"Waqas","family":"Nawaz","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Systems, Islamic University of Madinah, Al-Madinah, Saudi Arabia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3916-1659","authenticated-orcid":true,"given":"Kifayat Ullah","family":"Khan","sequence":"additional","affiliation":[{"name":"IKMA Lab, Department of Computer Science, National University of Computer and Emerging Sciences, Islamabad, Pakistan"}]}],"member":"311","reference":[{"issue":"1","key":"1","first-page":"54","article-title":"A survey of sequential pattern mining","volume":"1","author":"P. Fournier-Viger","year":"2017","journal-title":"Data Science and Pattern Recognition"},{"key":"2","article-title":"Detection of time series patterns and periodicity of cloud computing workloads","author":"C. St-Onge","year":"2020","journal-title":"Future Generation Computer Systems"},{"issue":"1","key":"3","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.engappai.2010.09.007","article-title":"A review on time series data mining","volume":"24","author":"T.-c. Fu","year":"2011","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"4","first-page":"567","article-title":"A comprehensive study on periodicity mining algorithms","author":"M. Patel"},{"key":"5","first-page":"617","article-title":"Detecting multiple periods and periodic patterns in event time sequences","author":"Q. Yuan"},{"key":"6","first-page":"124","article-title":"Efficient mining of event periodicity in data series","author":"H. Yuan"},{"key":"7","volume-title":"Sliding Window Based Weighted Periodic Pattern Mining over Time Series Data","author":"R. A. Rizvee","year":"2019"},{"key":"8","first-page":"363","article-title":"Identifying representative trends in massive time series data sets using sketches","author":"P. Indyk"},{"issue":"1","key":"9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1109\/TKDE.2010.76","article-title":"Efficient periodicity mining in time series databases using suffix trees","volume":"23","author":"F. Rasheed","year":"2010","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"10","key":"10","doi-asserted-by":"crossref","first-page":"1638","DOI":"10.1016\/j.jss.2011.04.022","article-title":"New and efficient knowledge discovery of partial periodic patterns with multiple minimum supports","volume":"84","author":"S.-S. Chen","year":"2011","journal-title":"Journal of Systems and Software"},{"key":"11","unstructured":"XylogiannopoulosK.Data structures, algorithms and applications for big data analytics: single, multiple and all repeated patterns detection in discrete sequences2017Calgary, AB, USAUniversity of CalgaryPh.D. dissertation"},{"key":"12","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.engappai.2015.04.014","article-title":"An efficient approach to mine flexible periodic patterns in time series databases","volume":"44","author":"A. K. Chanda","year":"2015","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"13","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.eswa.2017.02.028","article-title":"A new framework for mining weighted periodic patterns in time series databases","volume":"79","author":"A. K. Chanda","year":"2017","journal-title":"Expert Systems with Applications"},{"key":"14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.engappai.2017.11.005","article-title":"Mining non-redundant closed flexible periodic patterns","volume":"69","author":"S. Akther","year":"2018","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"15","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1016\/j.ins.2018.06.045","article-title":"A periodicity-based parallel time series prediction algorithm in cloud computing environments","volume":"496","author":"J. Chen","year":"2019","journal-title":"Information Sciences"},{"issue":"3","key":"16","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01206331","article-title":"On-line construction of suffix trees","volume":"14","author":"E. Ukkonen","year":"1995","journal-title":"Algorithmica"},{"key":"17","first-page":"259","article-title":"An efficient algorithm for frequent closed itemsets mining","author":"L. Ma"},{"key":"18","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.engappai.2013.09.006","article-title":"An efficient method for mining frequent itemsets with double constraints","volume":"27","author":"H. Duong","year":"2014","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"8","key":"19","doi-asserted-by":"crossref","first-page":"3015","DOI":"10.1016\/j.eswa.2012.12.017","article-title":"Effective periodic pattern mining in time series databases","volume":"40","author":"M. A. Nishi","year":"2013","journal-title":"Expert Systems with Applications"},{"key":"20","first-page":"581","article-title":"Comine: efficient mining of correlated patterns","author":"Y.-K. Lee"},{"key":"21","first-page":"205","article-title":"Mining partially periodic event patterns with unknown periods","author":"S. Ma"},{"key":"22","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1007\/978-981-13-0514-6_76","article-title":"Efficient high-utility itemset mining over variety of databases: a survey,","volume-title":"Soft Computing in Data Analytics","author":"U. Suvarna","year":"2019"},{"issue":"4","key":"23","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1109\/TKDE.2005.60","article-title":"Efficient algorithms for mining closed itemsets and their lattice structure","volume":"17","author":"M. J. Zaki","year":"2005","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"21","key":"24","doi-asserted-by":"crossref","first-page":"4878","DOI":"10.1016\/j.ins.2011.05.012","article-title":"A framework for mining interesting high utility patterns with a strong frequency affinity","volume":"181","author":"C. F. Ahmed","year":"2011","journal-title":"Information Sciences"},{"issue":"15","key":"25","doi-asserted-by":"crossref","first-page":"11979","DOI":"10.1016\/j.eswa.2012.03.062","article-title":"Interactive mining of high utility patterns over data streams","volume":"39","author":"C. F. Ahmed","year":"2012","journal-title":"Expert Systems with Applications"},{"key":"26","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/978-3-662-58384-5_6","article-title":"Discovering periodic-correlated patterns in temporal databases","volume-title":"Transactions on Large-Scale Data-And Knowledge-Centered Systems XXXVIII","author":"J. Venkatesh","year":"2018"},{"issue":"3","key":"27","doi-asserted-by":"crossref","first-page":"2098","DOI":"10.1016\/j.eswa.2009.06.064","article-title":"Mining closed flexible patterns in time-series databases","volume":"37","author":"H.-W. Wu","year":"2010","journal-title":"Expert Systems with Applications"},{"issue":"4","key":"28","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/s10115-004-0175-4","article-title":"Tsp: mining top-k closed sequential patterns","volume":"7","author":"P. Tzvetkov","year":"2005","journal-title":"Knowledge and Information Systems"},{"key":"29","first-page":"1","article-title":"Discovering partial periodic itemsets in temporal databases","author":"R. U. Kiran"},{"key":"30","first-page":"27","article-title":"Pfpm: dis-\u02c7 covering periodic frequent patterns with novel periodicity measures","author":"P. Fournier-Viger"},{"key":"31","first-page":"8","article-title":"Warp: time warping for periodicity detection","author":"M. G. Elfeky"},{"key":"32","first-page":"725","article-title":"Infominer+: mining partial periodic patterns with gap penalties,","author":"R. Yang"},{"issue":"1","key":"33","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TKDE.2006.10","article-title":"Fast and memory efficient mining of frequent closed itemsets","volume":"18","author":"C. Lucchese","year":"2005","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"34","first-page":"429","article-title":"Sequential pattern mining using a bitmap representation","author":"J. Ayres"},{"key":"35","first-page":"370","article-title":"Multiple and partial periodicity mining in time series databases","author":"C. Berberidis"}],"container-title":["Scientific Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2021\/8841188.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2021\/8841188.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2021\/8841188.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T14:02:47Z","timestamp":1670680967000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/sp\/2021\/8841188\/"}},"subtitle":[],"editor":[{"given":"Jiwei","family":"Huang","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1,4]]},"references-count":35,"alternative-id":["8841188","8841188"],"URL":"https:\/\/doi.org\/10.1155\/2021\/8841188","relation":{},"ISSN":["1875-919X","1058-9244"],"issn-type":[{"value":"1875-919X","type":"electronic"},{"value":"1058-9244","type":"print"}],"subject":[],"published":{"date-parts":[[2021,1,4]]}}}