Mining partial periodic correlations in time series
Recently, periodic pattern mining from time series data has been studied extensively. However, an interesting type of periodic pattern, called partial periodic (PP) correlation in this paper, has not been investigated. An example of PP correlation is that power consumption is high either on Monday o...
Gespeichert in:
Veröffentlicht in: | Knowledge and information systems 2008-04, Vol.15 (1), p.31-54 |
---|---|
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 | 54 |
---|---|
container_issue | 1 |
container_start_page | 31 |
container_title | Knowledge and information systems |
container_volume | 15 |
creator | He, Zhen Wang, X. Sean Lee, Byung Suk Ling, Alan C. H. |
description | Recently, periodic pattern mining from time series data has been studied extensively. However, an interesting type of periodic pattern, called partial periodic (PP) correlation in this paper, has not been investigated. An example of PP correlation is that power consumption is high either on Monday or Tuesday but not on both days. In general, a PP correlation is a set of offsets within a particular period such that the data at these offsets are correlated with a certain user-desired strength. In the above example, the period is a week (7 days), and each day of the week is an offset of the period. PP correlations can provide insightful knowledge about the time series and can be used for predicting future values. This paper introduces an algorithm to mine time series for PP correlations based on the principal component analysis (PCA) method. Specifically, given a period, the algorithm maps the time series data to data points in a multidimensional space, where the dimensions correspond to the offsets within the period. A PP correlation is then equivalent to correlation of data when projected to a subset of the dimensions. The algorithm discovers, with one sequential scan of data, all those PP correlations (called minimum PP correlations) that are not unions of some other PP correlations. Experiments using both real and synthetic data sets show that the PCA-based algorithm is highly efficient and effective in finding the minimum PP correlations. |
doi_str_mv | 10.1007/s10115-006-0051-5 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_34885917</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1457252201</sourcerecordid><originalsourceid>FETCH-LOGICAL-c443t-29ae6727267455e775a7bacab6ec22887ef7aa43b96700dacba42352e7af530b3</originalsourceid><addsrcrecordid>eNp1kE1LxDAQhoMouK7-AG_Fg7fqTNJ02qMsfsGKFz2HNDtdsvTLpHvw39ulC4LgYZiBed5heIS4RrhDALqPCIg6Bcin0pjqE7EAiWWqEPPT44yK6FxcxLgDQMoRF0K9-c5322SwYfS2SQYOvt94l7g-BG7s6PsuJr5LRt9yEqctx0txVtsm8tWxL8Xn0-PH6iVdvz-_rh7WqcsyNaaytJyTJJlTpjUTaUuVdbbK2UlZFMQ1WZupqswJYGNdZTOptGSytVZQqaW4ne8Oof_acxxN66PjprEd9_toVFYUukSawJs_4K7fh276zUjIFECp9QThDLnQxxi4NkPwrQ3fBsEcHJrZoZkcmoNDc8jIORMnttty-D38f-gHBp5ywg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204300955</pqid></control><display><type>article</type><title>Mining partial periodic correlations in time series</title><source>Springer Nature - Complete Springer Journals</source><creator>He, Zhen ; Wang, X. Sean ; Lee, Byung Suk ; Ling, Alan C. H.</creator><creatorcontrib>He, Zhen ; Wang, X. Sean ; Lee, Byung Suk ; Ling, Alan C. H.</creatorcontrib><description>Recently, periodic pattern mining from time series data has been studied extensively. However, an interesting type of periodic pattern, called partial periodic (PP) correlation in this paper, has not been investigated. An example of PP correlation is that power consumption is high either on Monday or Tuesday but not on both days. In general, a PP correlation is a set of offsets within a particular period such that the data at these offsets are correlated with a certain user-desired strength. In the above example, the period is a week (7 days), and each day of the week is an offset of the period. PP correlations can provide insightful knowledge about the time series and can be used for predicting future values. This paper introduces an algorithm to mine time series for PP correlations based on the principal component analysis (PCA) method. Specifically, given a period, the algorithm maps the time series data to data points in a multidimensional space, where the dimensions correspond to the offsets within the period. A PP correlation is then equivalent to correlation of data when projected to a subset of the dimensions. The algorithm discovers, with one sequential scan of data, all those PP correlations (called minimum PP correlations) that are not unions of some other PP correlations. Experiments using both real and synthetic data sets show that the PCA-based algorithm is highly efficient and effective in finding the minimum PP correlations.</description><identifier>ISSN: 0219-1377</identifier><identifier>EISSN: 0219-3116</identifier><identifier>DOI: 10.1007/s10115-006-0051-5</identifier><identifier>CODEN: KISNCR</identifier><language>eng</language><publisher>London: Springer-Verlag</publisher><subject>Algorithms ; Computer Science ; Data mining ; Data Mining and Knowledge Discovery ; Database Management ; Information Storage and Retrieval ; Information systems ; Information Systems and Communication Service ; Information Systems Applications (incl.Internet) ; IT in Business ; Mining ; Principal components analysis ; Regular Paper ; Securities markets ; Studies ; Time series</subject><ispartof>Knowledge and information systems, 2008-04, Vol.15 (1), p.31-54</ispartof><rights>Springer-Verlag London Limited 2006</rights><rights>Springer-Verlag London Limited 2008</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c443t-29ae6727267455e775a7bacab6ec22887ef7aa43b96700dacba42352e7af530b3</citedby><cites>FETCH-LOGICAL-c443t-29ae6727267455e775a7bacab6ec22887ef7aa43b96700dacba42352e7af530b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10115-006-0051-5$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10115-006-0051-5$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>He, Zhen</creatorcontrib><creatorcontrib>Wang, X. Sean</creatorcontrib><creatorcontrib>Lee, Byung Suk</creatorcontrib><creatorcontrib>Ling, Alan C. H.</creatorcontrib><title>Mining partial periodic correlations in time series</title><title>Knowledge and information systems</title><addtitle>Knowl Inf Syst</addtitle><description>Recently, periodic pattern mining from time series data has been studied extensively. However, an interesting type of periodic pattern, called partial periodic (PP) correlation in this paper, has not been investigated. An example of PP correlation is that power consumption is high either on Monday or Tuesday but not on both days. In general, a PP correlation is a set of offsets within a particular period such that the data at these offsets are correlated with a certain user-desired strength. In the above example, the period is a week (7 days), and each day of the week is an offset of the period. PP correlations can provide insightful knowledge about the time series and can be used for predicting future values. This paper introduces an algorithm to mine time series for PP correlations based on the principal component analysis (PCA) method. Specifically, given a period, the algorithm maps the time series data to data points in a multidimensional space, where the dimensions correspond to the offsets within the period. A PP correlation is then equivalent to correlation of data when projected to a subset of the dimensions. The algorithm discovers, with one sequential scan of data, all those PP correlations (called minimum PP correlations) that are not unions of some other PP correlations. Experiments using both real and synthetic data sets show that the PCA-based algorithm is highly efficient and effective in finding the minimum PP correlations.</description><subject>Algorithms</subject><subject>Computer Science</subject><subject>Data mining</subject><subject>Data Mining and Knowledge Discovery</subject><subject>Database Management</subject><subject>Information Storage and Retrieval</subject><subject>Information systems</subject><subject>Information Systems and Communication Service</subject><subject>Information Systems Applications (incl.Internet)</subject><subject>IT in Business</subject><subject>Mining</subject><subject>Principal components analysis</subject><subject>Regular Paper</subject><subject>Securities markets</subject><subject>Studies</subject><subject>Time series</subject><issn>0219-1377</issn><issn>0219-3116</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNp1kE1LxDAQhoMouK7-AG_Fg7fqTNJ02qMsfsGKFz2HNDtdsvTLpHvw39ulC4LgYZiBed5heIS4RrhDALqPCIg6Bcin0pjqE7EAiWWqEPPT44yK6FxcxLgDQMoRF0K9-c5322SwYfS2SQYOvt94l7g-BG7s6PsuJr5LRt9yEqctx0txVtsm8tWxL8Xn0-PH6iVdvz-_rh7WqcsyNaaytJyTJJlTpjUTaUuVdbbK2UlZFMQ1WZupqswJYGNdZTOptGSytVZQqaW4ne8Oof_acxxN66PjprEd9_toVFYUukSawJs_4K7fh276zUjIFECp9QThDLnQxxi4NkPwrQ3fBsEcHJrZoZkcmoNDc8jIORMnttty-D38f-gHBp5ywg</recordid><startdate>20080401</startdate><enddate>20080401</enddate><creator>He, Zhen</creator><creator>Wang, X. Sean</creator><creator>Lee, Byung Suk</creator><creator>Ling, Alan C. H.</creator><general>Springer-Verlag</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L.0</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PHGZM</scope><scope>PHGZT</scope><scope>PKEHL</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQGLB</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope></search><sort><creationdate>20080401</creationdate><title>Mining partial periodic correlations in time series</title><author>He, Zhen ; Wang, X. Sean ; Lee, Byung Suk ; Ling, Alan C. H.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c443t-29ae6727267455e775a7bacab6ec22887ef7aa43b96700dacba42352e7af530b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Algorithms</topic><topic>Computer Science</topic><topic>Data mining</topic><topic>Data Mining and Knowledge Discovery</topic><topic>Database Management</topic><topic>Information Storage and Retrieval</topic><topic>Information systems</topic><topic>Information Systems and Communication Service</topic><topic>Information Systems Applications (incl.Internet)</topic><topic>IT in Business</topic><topic>Mining</topic><topic>Principal components analysis</topic><topic>Regular Paper</topic><topic>Securities markets</topic><topic>Studies</topic><topic>Time series</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>He, Zhen</creatorcontrib><creatorcontrib>Wang, X. Sean</creatorcontrib><creatorcontrib>Lee, Byung Suk</creatorcontrib><creatorcontrib>Ling, Alan C. H.</creatorcontrib><collection>CrossRef</collection><collection>Global News & ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central (New)</collection><collection>ProQuest One Academic (New)</collection><collection>ProQuest One Academic Middle East (New)</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Applied & Life Sciences</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central Basic</collection><jtitle>Knowledge and information systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>He, Zhen</au><au>Wang, X. Sean</au><au>Lee, Byung Suk</au><au>Ling, Alan C. H.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Mining partial periodic correlations in time series</atitle><jtitle>Knowledge and information systems</jtitle><stitle>Knowl Inf Syst</stitle><date>2008-04-01</date><risdate>2008</risdate><volume>15</volume><issue>1</issue><spage>31</spage><epage>54</epage><pages>31-54</pages><issn>0219-1377</issn><eissn>0219-3116</eissn><coden>KISNCR</coden><abstract>Recently, periodic pattern mining from time series data has been studied extensively. However, an interesting type of periodic pattern, called partial periodic (PP) correlation in this paper, has not been investigated. An example of PP correlation is that power consumption is high either on Monday or Tuesday but not on both days. In general, a PP correlation is a set of offsets within a particular period such that the data at these offsets are correlated with a certain user-desired strength. In the above example, the period is a week (7 days), and each day of the week is an offset of the period. PP correlations can provide insightful knowledge about the time series and can be used for predicting future values. This paper introduces an algorithm to mine time series for PP correlations based on the principal component analysis (PCA) method. Specifically, given a period, the algorithm maps the time series data to data points in a multidimensional space, where the dimensions correspond to the offsets within the period. A PP correlation is then equivalent to correlation of data when projected to a subset of the dimensions. The algorithm discovers, with one sequential scan of data, all those PP correlations (called minimum PP correlations) that are not unions of some other PP correlations. Experiments using both real and synthetic data sets show that the PCA-based algorithm is highly efficient and effective in finding the minimum PP correlations.</abstract><cop>London</cop><pub>Springer-Verlag</pub><doi>10.1007/s10115-006-0051-5</doi><tpages>24</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0219-1377 |
ispartof | Knowledge and information systems, 2008-04, Vol.15 (1), p.31-54 |
issn | 0219-1377 0219-3116 |
language | eng |
recordid | cdi_proquest_miscellaneous_34885917 |
source | Springer Nature - Complete Springer Journals |
subjects | Algorithms Computer Science Data mining Data Mining and Knowledge Discovery Database Management Information Storage and Retrieval Information systems Information Systems and Communication Service Information Systems Applications (incl.Internet) IT in Business Mining Principal components analysis Regular Paper Securities markets Studies Time series |
title | Mining partial periodic correlations in time series |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-21T17%3A33%3A46IST&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=Mining%20partial%20periodic%20correlations%20in%20time%20series&rft.jtitle=Knowledge%20and%20information%20systems&rft.au=He,%20Zhen&rft.date=2008-04-01&rft.volume=15&rft.issue=1&rft.spage=31&rft.epage=54&rft.pages=31-54&rft.issn=0219-1377&rft.eissn=0219-3116&rft.coden=KISNCR&rft_id=info:doi/10.1007/s10115-006-0051-5&rft_dat=%3Cproquest_cross%3E1457252201%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=204300955&rft_id=info:pmid/&rfr_iscdi=true |