Effective periodic pattern mining in time series databases
The goal of analyzing a time series database is to find whether and how frequent a periodic pattern is repeated within the series. Periodic pattern mining is the problem that regards temporal regularity. However, most of the existing algorithms have a major limitation in mining interesting patterns...
Gespeichert in:
Veröffentlicht in: | Expert systems with applications 2013-06, Vol.40 (8), p.3015-3027 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 3027 |
---|---|
container_issue | 8 |
container_start_page | 3015 |
container_title | Expert systems with applications |
container_volume | 40 |
creator | Nishi, Manziba Akanda Ahmed, Chowdhury Farhan Samiullah, Md Jeong, Byeong-Soo |
description | The goal of analyzing a time series database is to find whether and how frequent a periodic pattern is repeated within the series. Periodic pattern mining is the problem that regards temporal regularity. However, most of the existing algorithms have a major limitation in mining interesting patterns of users interest, that is, they can mine patterns of specific length with all the events sequentially one after another in exact positions within this pattern. Though there are certain scenarios where a pattern can be flexible, that is, it may be interesting and can be mined by neglecting any number of unimportant events in between important events with variable length of the pattern. Moreover, existing algorithms can detect only specific type of periodicity in various time series databases and require the interaction from user to determine periodicity. In this paper, we have proposed an algorithm for the periodic pattern mining in time series databases which does not rely on the user for the period value or period type of the pattern and can detect all types of periodic patterns at the same time, indeed these flexibilities are missing in existing algorithms. The proposed algorithm facilitates the user to generate different kinds of patterns by skipping intermediate events in a time series database and find out the periodicity of the patterns within the database. It is an improvement over the generating pattern using suffix tree, because suffix tree based algorithms have weakness in this particular area of pattern generation. Comparing with the existing algorithms, the proposed algorithm improves generating different kinds of interesting patterns and detects whether the generated pattern is periodic or not. We have tested the performance of our algorithm on both synthetic and real life data from different domains and found a large number of interesting event sequences which were missing in existing algorithms and the proposed algorithm was efficient enough in generating and detecting periodicity of flexible patterns on both types of data. |
doi_str_mv | 10.1016/j.eswa.2012.12.017 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1671383579</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0957417412012584</els_id><sourcerecordid>1671383579</sourcerecordid><originalsourceid>FETCH-LOGICAL-c363t-94fb1c10914cc783903f75300fe67297a1f23609060439ceb88047e25418be873</originalsourceid><addsrcrecordid>eNp9kM1LAzEQxYMoWKv_gKe9CF62ziS7m13xIqV-QMGLnkM2O5GU_TLZVvzvTWnxKAzMYd57w_sxdo2wQMDibrOg8K0XHJAv4gDKEzbDUoq0kJU4ZTOocplmKLNzdhHCBqICQM7Y_cpaMpPbUTKSd0PjTDLqaSLfJ53rXf-ZuD6ZXEdJiHcKSaMnXetA4ZKdWd0GujruOft4Wr0vX9L12_Pr8nGdGlGIKa0yW6NBqDAzRpaiAmFlLgAsFZJXUqPlooAKCshEZaguS8gk8TzDsqZYYc5uD7mjH762FCbVuWCobXVPwzYoLCSKUuSx6Jzxg9T4IQRPVo3eddr_KAS1B6U2ag9K7UGpOBFDNN0c83UwurVe98aFPyeXiMBLjLqHg45i2Z0jr4Jx1BtqnI8IVTO4_978AinAfGc</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1671383579</pqid></control><display><type>article</type><title>Effective periodic pattern mining in time series databases</title><source>Elsevier ScienceDirect Journals</source><creator>Nishi, Manziba Akanda ; Ahmed, Chowdhury Farhan ; Samiullah, Md ; Jeong, Byeong-Soo</creator><creatorcontrib>Nishi, Manziba Akanda ; Ahmed, Chowdhury Farhan ; Samiullah, Md ; Jeong, Byeong-Soo</creatorcontrib><description>The goal of analyzing a time series database is to find whether and how frequent a periodic pattern is repeated within the series. Periodic pattern mining is the problem that regards temporal regularity. However, most of the existing algorithms have a major limitation in mining interesting patterns of users interest, that is, they can mine patterns of specific length with all the events sequentially one after another in exact positions within this pattern. Though there are certain scenarios where a pattern can be flexible, that is, it may be interesting and can be mined by neglecting any number of unimportant events in between important events with variable length of the pattern. Moreover, existing algorithms can detect only specific type of periodicity in various time series databases and require the interaction from user to determine periodicity. In this paper, we have proposed an algorithm for the periodic pattern mining in time series databases which does not rely on the user for the period value or period type of the pattern and can detect all types of periodic patterns at the same time, indeed these flexibilities are missing in existing algorithms. The proposed algorithm facilitates the user to generate different kinds of patterns by skipping intermediate events in a time series database and find out the periodicity of the patterns within the database. It is an improvement over the generating pattern using suffix tree, because suffix tree based algorithms have weakness in this particular area of pattern generation. Comparing with the existing algorithms, the proposed algorithm improves generating different kinds of interesting patterns and detects whether the generated pattern is periodic or not. We have tested the performance of our algorithm on both synthetic and real life data from different domains and found a large number of interesting event sequences which were missing in existing algorithms and the proposed algorithm was efficient enough in generating and detecting periodicity of flexible patterns on both types of data.</description><identifier>ISSN: 0957-4174</identifier><identifier>EISSN: 1873-6793</identifier><identifier>DOI: 10.1016/j.eswa.2012.12.017</identifier><language>eng</language><publisher>Amsterdam: Elsevier Ltd</publisher><subject>Algorithms ; Applied sciences ; Computer science; control theory; systems ; Data mining ; Data processing. List processing. Character string processing ; Event skipping ; Exact sciences and technology ; Flexibility ; Inference from stochastic processes; time series analysis ; Information systems. Data bases ; Knowledge discovery ; Mathematics ; Memory organisation. Data processing ; Pattern analysis ; Pattern generation ; Periodic pattern ; Probability and statistics ; Sciences and techniques of general use ; Software ; Statistics ; Suffix tree ; Suffix trees ; Time series</subject><ispartof>Expert systems with applications, 2013-06, Vol.40 (8), p.3015-3027</ispartof><rights>2012 Elsevier Ltd</rights><rights>2014 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c363t-94fb1c10914cc783903f75300fe67297a1f23609060439ceb88047e25418be873</citedby><cites>FETCH-LOGICAL-c363t-94fb1c10914cc783903f75300fe67297a1f23609060439ceb88047e25418be873</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0957417412012584$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=27110281$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Nishi, Manziba Akanda</creatorcontrib><creatorcontrib>Ahmed, Chowdhury Farhan</creatorcontrib><creatorcontrib>Samiullah, Md</creatorcontrib><creatorcontrib>Jeong, Byeong-Soo</creatorcontrib><title>Effective periodic pattern mining in time series databases</title><title>Expert systems with applications</title><description>The goal of analyzing a time series database is to find whether and how frequent a periodic pattern is repeated within the series. Periodic pattern mining is the problem that regards temporal regularity. However, most of the existing algorithms have a major limitation in mining interesting patterns of users interest, that is, they can mine patterns of specific length with all the events sequentially one after another in exact positions within this pattern. Though there are certain scenarios where a pattern can be flexible, that is, it may be interesting and can be mined by neglecting any number of unimportant events in between important events with variable length of the pattern. Moreover, existing algorithms can detect only specific type of periodicity in various time series databases and require the interaction from user to determine periodicity. In this paper, we have proposed an algorithm for the periodic pattern mining in time series databases which does not rely on the user for the period value or period type of the pattern and can detect all types of periodic patterns at the same time, indeed these flexibilities are missing in existing algorithms. The proposed algorithm facilitates the user to generate different kinds of patterns by skipping intermediate events in a time series database and find out the periodicity of the patterns within the database. It is an improvement over the generating pattern using suffix tree, because suffix tree based algorithms have weakness in this particular area of pattern generation. Comparing with the existing algorithms, the proposed algorithm improves generating different kinds of interesting patterns and detects whether the generated pattern is periodic or not. We have tested the performance of our algorithm on both synthetic and real life data from different domains and found a large number of interesting event sequences which were missing in existing algorithms and the proposed algorithm was efficient enough in generating and detecting periodicity of flexible patterns on both types of data.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Data mining</subject><subject>Data processing. List processing. Character string processing</subject><subject>Event skipping</subject><subject>Exact sciences and technology</subject><subject>Flexibility</subject><subject>Inference from stochastic processes; time series analysis</subject><subject>Information systems. Data bases</subject><subject>Knowledge discovery</subject><subject>Mathematics</subject><subject>Memory organisation. Data processing</subject><subject>Pattern analysis</subject><subject>Pattern generation</subject><subject>Periodic pattern</subject><subject>Probability and statistics</subject><subject>Sciences and techniques of general use</subject><subject>Software</subject><subject>Statistics</subject><subject>Suffix tree</subject><subject>Suffix trees</subject><subject>Time series</subject><issn>0957-4174</issn><issn>1873-6793</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNp9kM1LAzEQxYMoWKv_gKe9CF62ziS7m13xIqV-QMGLnkM2O5GU_TLZVvzvTWnxKAzMYd57w_sxdo2wQMDibrOg8K0XHJAv4gDKEzbDUoq0kJU4ZTOocplmKLNzdhHCBqICQM7Y_cpaMpPbUTKSd0PjTDLqaSLfJ53rXf-ZuD6ZXEdJiHcKSaMnXetA4ZKdWd0GujruOft4Wr0vX9L12_Pr8nGdGlGIKa0yW6NBqDAzRpaiAmFlLgAsFZJXUqPlooAKCshEZaguS8gk8TzDsqZYYc5uD7mjH762FCbVuWCobXVPwzYoLCSKUuSx6Jzxg9T4IQRPVo3eddr_KAS1B6U2ag9K7UGpOBFDNN0c83UwurVe98aFPyeXiMBLjLqHg45i2Z0jr4Jx1BtqnI8IVTO4_978AinAfGc</recordid><startdate>20130615</startdate><enddate>20130615</enddate><creator>Nishi, Manziba Akanda</creator><creator>Ahmed, Chowdhury Farhan</creator><creator>Samiullah, Md</creator><creator>Jeong, Byeong-Soo</creator><general>Elsevier Ltd</general><general>Elsevier</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20130615</creationdate><title>Effective periodic pattern mining in time series databases</title><author>Nishi, Manziba Akanda ; Ahmed, Chowdhury Farhan ; Samiullah, Md ; Jeong, Byeong-Soo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c363t-94fb1c10914cc783903f75300fe67297a1f23609060439ceb88047e25418be873</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Data mining</topic><topic>Data processing. List processing. Character string processing</topic><topic>Event skipping</topic><topic>Exact sciences and technology</topic><topic>Flexibility</topic><topic>Inference from stochastic processes; time series analysis</topic><topic>Information systems. Data bases</topic><topic>Knowledge discovery</topic><topic>Mathematics</topic><topic>Memory organisation. Data processing</topic><topic>Pattern analysis</topic><topic>Pattern generation</topic><topic>Periodic pattern</topic><topic>Probability and statistics</topic><topic>Sciences and techniques of general use</topic><topic>Software</topic><topic>Statistics</topic><topic>Suffix tree</topic><topic>Suffix trees</topic><topic>Time series</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Nishi, Manziba Akanda</creatorcontrib><creatorcontrib>Ahmed, Chowdhury Farhan</creatorcontrib><creatorcontrib>Samiullah, Md</creatorcontrib><creatorcontrib>Jeong, Byeong-Soo</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Expert systems with applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Nishi, Manziba Akanda</au><au>Ahmed, Chowdhury Farhan</au><au>Samiullah, Md</au><au>Jeong, Byeong-Soo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Effective periodic pattern mining in time series databases</atitle><jtitle>Expert systems with applications</jtitle><date>2013-06-15</date><risdate>2013</risdate><volume>40</volume><issue>8</issue><spage>3015</spage><epage>3027</epage><pages>3015-3027</pages><issn>0957-4174</issn><eissn>1873-6793</eissn><abstract>The goal of analyzing a time series database is to find whether and how frequent a periodic pattern is repeated within the series. Periodic pattern mining is the problem that regards temporal regularity. However, most of the existing algorithms have a major limitation in mining interesting patterns of users interest, that is, they can mine patterns of specific length with all the events sequentially one after another in exact positions within this pattern. Though there are certain scenarios where a pattern can be flexible, that is, it may be interesting and can be mined by neglecting any number of unimportant events in between important events with variable length of the pattern. Moreover, existing algorithms can detect only specific type of periodicity in various time series databases and require the interaction from user to determine periodicity. In this paper, we have proposed an algorithm for the periodic pattern mining in time series databases which does not rely on the user for the period value or period type of the pattern and can detect all types of periodic patterns at the same time, indeed these flexibilities are missing in existing algorithms. The proposed algorithm facilitates the user to generate different kinds of patterns by skipping intermediate events in a time series database and find out the periodicity of the patterns within the database. It is an improvement over the generating pattern using suffix tree, because suffix tree based algorithms have weakness in this particular area of pattern generation. Comparing with the existing algorithms, the proposed algorithm improves generating different kinds of interesting patterns and detects whether the generated pattern is periodic or not. We have tested the performance of our algorithm on both synthetic and real life data from different domains and found a large number of interesting event sequences which were missing in existing algorithms and the proposed algorithm was efficient enough in generating and detecting periodicity of flexible patterns on both types of data.</abstract><cop>Amsterdam</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.eswa.2012.12.017</doi><tpages>13</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0957-4174 |
ispartof | Expert systems with applications, 2013-06, Vol.40 (8), p.3015-3027 |
issn | 0957-4174 1873-6793 |
language | eng |
recordid | cdi_proquest_miscellaneous_1671383579 |
source | Elsevier ScienceDirect Journals |
subjects | Algorithms Applied sciences Computer science control theory systems Data mining Data processing. List processing. Character string processing Event skipping Exact sciences and technology Flexibility Inference from stochastic processes time series analysis Information systems. Data bases Knowledge discovery Mathematics Memory organisation. Data processing Pattern analysis Pattern generation Periodic pattern Probability and statistics Sciences and techniques of general use Software Statistics Suffix tree Suffix trees Time series |
title | Effective periodic pattern mining in time series databases |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T04%3A58%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Effective%20periodic%20pattern%20mining%20in%20time%20series%20databases&rft.jtitle=Expert%20systems%20with%20applications&rft.au=Nishi,%20Manziba%20Akanda&rft.date=2013-06-15&rft.volume=40&rft.issue=8&rft.spage=3015&rft.epage=3027&rft.pages=3015-3027&rft.issn=0957-4174&rft.eissn=1873-6793&rft_id=info:doi/10.1016/j.eswa.2012.12.017&rft_dat=%3Cproquest_cross%3E1671383579%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1671383579&rft_id=info:pmid/&rft_els_id=S0957417412012584&rfr_iscdi=true |