A Novel Segmentation and Representation Approach for Streaming Time Series. Hu, Y., Guan, P., Zhan, P., Ding, Y., & Li, X. IEEE Access, 7:184423–184437, 2019. Conference Name: IEEE Accessdoi abstract bibtex Along with the coming of Internet of Everything era, massive numbers of pervasive connected devices in various fields are continuously producing oceans of time series stream data. In order to carry out different kinds of data mining tasks (similarity search, classification, clustering, and prediction) based on streaming time series efficiently and effectively, segmentation and representation which segment a streaming time series into several subsequences and provide approximative representation for the raw data, should be done as the first step. With the virtue of solid theoretical foundations, piecewise linear representation (PLR) has been gained success in yielding more compact representation and fewer segments. However, the current state of art PLR methods have their own flaws: For one thing, most of current PLR methods focus on the guaranteed error bound instead of the holistic approximation error, which may lead to excessive fitting errors of segments and loss of factual research significance. For another, most of current PLR methods process streaming time series with some fixed criteria, which cannot provide a more flexible way to represent streaming time series. Motivated by the above analysis, we propose a novel continuous segmentation and multi-resolution representation approach based on turning points, which subdivides the streaming time series by a set of temporal feature points and represents the time series flexibly. Our method can not only generate more accurate approximation than the state-of-the-art of PLR algorithm, but also represent the streaming time series in a more flexible way to meet different needs of users. Extensive experiments on different kinds of typical time series datasets have been conducted to demonstrate the superiorities of our method.
@article{hu_novel_2019,
title = {A {Novel} {Segmentation} and {Representation} {Approach} for {Streaming} {Time} {Series}},
volume = {7},
issn = {2169-3536},
doi = {10.1109/ACCESS.2018.2828320},
abstract = {Along with the coming of Internet of Everything era, massive numbers of pervasive connected devices in various fields are continuously producing oceans of time series stream data. In order to carry out different kinds of data mining tasks (similarity search, classification, clustering, and prediction) based on streaming time series efficiently and effectively, segmentation and representation which segment a streaming time series into several subsequences and provide approximative representation for the raw data, should be done as the first step. With the virtue of solid theoretical foundations, piecewise linear representation (PLR) has been gained success in yielding more compact representation and fewer segments. However, the current state of art PLR methods have their own flaws: For one thing, most of current PLR methods focus on the guaranteed error bound instead of the holistic approximation error, which may lead to excessive fitting errors of segments and loss of factual research significance. For another, most of current PLR methods process streaming time series with some fixed criteria, which cannot provide a more flexible way to represent streaming time series. Motivated by the above analysis, we propose a novel continuous segmentation and multi-resolution representation approach based on turning points, which subdivides the streaming time series by a set of temporal feature points and represents the time series flexibly. Our method can not only generate more accurate approximation than the state-of-the-art of PLR algorithm, but also represent the streaming time series in a more flexible way to meet different needs of users. Extensive experiments on different kinds of typical time series datasets have been conducted to demonstrate the superiorities of our method.},
journal = {IEEE Access},
author = {Hu, Yupeng and Guan, Peiyuan and Zhan, Peng and Ding, Yiming and Li, Xueqing},
year = {2019},
note = {Conference Name: IEEE Access},
keywords = {Approximation algorithms, Data mining, Indexes, Internet of Everything era, Internet of Things, Microsoft Windows, Task analysis, Time series analysis, Turning, continuous segmentation approach, data mining, data structures, multi-resolution representation, multiresolution representation approach, online segmentation, piecewise linear representation, piecewise linear techniques, streaming time series, time series, time series stream data, typical time series datasets},
pages = {184423--184437},
}
Downloads: 0
{"_id":"JwMWsJXi3PQAFtkL8","bibbaseid":"hu-guan-zhan-ding-li-anovelsegmentationandrepresentationapproachforstreamingtimeseries-2019","author_short":["Hu, Y.","Guan, P.","Zhan, P.","Ding, Y.","Li, X."],"bibdata":{"bibtype":"article","type":"article","title":"A Novel Segmentation and Representation Approach for Streaming Time Series","volume":"7","issn":"2169-3536","doi":"10.1109/ACCESS.2018.2828320","abstract":"Along with the coming of Internet of Everything era, massive numbers of pervasive connected devices in various fields are continuously producing oceans of time series stream data. In order to carry out different kinds of data mining tasks (similarity search, classification, clustering, and prediction) based on streaming time series efficiently and effectively, segmentation and representation which segment a streaming time series into several subsequences and provide approximative representation for the raw data, should be done as the first step. With the virtue of solid theoretical foundations, piecewise linear representation (PLR) has been gained success in yielding more compact representation and fewer segments. However, the current state of art PLR methods have their own flaws: For one thing, most of current PLR methods focus on the guaranteed error bound instead of the holistic approximation error, which may lead to excessive fitting errors of segments and loss of factual research significance. For another, most of current PLR methods process streaming time series with some fixed criteria, which cannot provide a more flexible way to represent streaming time series. Motivated by the above analysis, we propose a novel continuous segmentation and multi-resolution representation approach based on turning points, which subdivides the streaming time series by a set of temporal feature points and represents the time series flexibly. Our method can not only generate more accurate approximation than the state-of-the-art of PLR algorithm, but also represent the streaming time series in a more flexible way to meet different needs of users. Extensive experiments on different kinds of typical time series datasets have been conducted to demonstrate the superiorities of our method.","journal":"IEEE Access","author":[{"propositions":[],"lastnames":["Hu"],"firstnames":["Yupeng"],"suffixes":[]},{"propositions":[],"lastnames":["Guan"],"firstnames":["Peiyuan"],"suffixes":[]},{"propositions":[],"lastnames":["Zhan"],"firstnames":["Peng"],"suffixes":[]},{"propositions":[],"lastnames":["Ding"],"firstnames":["Yiming"],"suffixes":[]},{"propositions":[],"lastnames":["Li"],"firstnames":["Xueqing"],"suffixes":[]}],"year":"2019","note":"Conference Name: IEEE Access","keywords":"Approximation algorithms, Data mining, Indexes, Internet of Everything era, Internet of Things, Microsoft Windows, Task analysis, Time series analysis, Turning, continuous segmentation approach, data mining, data structures, multi-resolution representation, multiresolution representation approach, online segmentation, piecewise linear representation, piecewise linear techniques, streaming time series, time series, time series stream data, typical time series datasets","pages":"184423–184437","bibtex":"@article{hu_novel_2019,\n\ttitle = {A {Novel} {Segmentation} and {Representation} {Approach} for {Streaming} {Time} {Series}},\n\tvolume = {7},\n\tissn = {2169-3536},\n\tdoi = {10.1109/ACCESS.2018.2828320},\n\tabstract = {Along with the coming of Internet of Everything era, massive numbers of pervasive connected devices in various fields are continuously producing oceans of time series stream data. In order to carry out different kinds of data mining tasks (similarity search, classification, clustering, and prediction) based on streaming time series efficiently and effectively, segmentation and representation which segment a streaming time series into several subsequences and provide approximative representation for the raw data, should be done as the first step. With the virtue of solid theoretical foundations, piecewise linear representation (PLR) has been gained success in yielding more compact representation and fewer segments. However, the current state of art PLR methods have their own flaws: For one thing, most of current PLR methods focus on the guaranteed error bound instead of the holistic approximation error, which may lead to excessive fitting errors of segments and loss of factual research significance. For another, most of current PLR methods process streaming time series with some fixed criteria, which cannot provide a more flexible way to represent streaming time series. Motivated by the above analysis, we propose a novel continuous segmentation and multi-resolution representation approach based on turning points, which subdivides the streaming time series by a set of temporal feature points and represents the time series flexibly. Our method can not only generate more accurate approximation than the state-of-the-art of PLR algorithm, but also represent the streaming time series in a more flexible way to meet different needs of users. Extensive experiments on different kinds of typical time series datasets have been conducted to demonstrate the superiorities of our method.},\n\tjournal = {IEEE Access},\n\tauthor = {Hu, Yupeng and Guan, Peiyuan and Zhan, Peng and Ding, Yiming and Li, Xueqing},\n\tyear = {2019},\n\tnote = {Conference Name: IEEE Access},\n\tkeywords = {Approximation algorithms, Data mining, Indexes, Internet of Everything era, Internet of Things, Microsoft Windows, Task analysis, Time series analysis, Turning, continuous segmentation approach, data mining, data structures, multi-resolution representation, multiresolution representation approach, online segmentation, piecewise linear representation, piecewise linear techniques, streaming time series, time series, time series stream data, typical time series datasets},\n\tpages = {184423--184437},\n}\n\n","author_short":["Hu, Y.","Guan, P.","Zhan, P.","Ding, Y.","Li, X."],"key":"hu_novel_2019","id":"hu_novel_2019","bibbaseid":"hu-guan-zhan-ding-li-anovelsegmentationandrepresentationapproachforstreamingtimeseries-2019","role":"author","urls":{},"keyword":["Approximation algorithms","Data mining","Indexes","Internet of Everything era","Internet of Things","Microsoft Windows","Task analysis","Time series analysis","Turning","continuous segmentation approach","data mining","data structures","multi-resolution representation","multiresolution representation approach","online segmentation","piecewise linear representation","piecewise linear techniques","streaming time series","time series","time series stream data","typical time series datasets"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://bibbase.org/zotero/mh_lenguyen","dataSources":["iwKepCrWBps7ojhDx"],"keywords":["approximation algorithms","data mining","indexes","internet of everything era","internet of things","microsoft windows","task analysis","time series analysis","turning","continuous segmentation approach","data mining","data structures","multi-resolution representation","multiresolution representation approach","online segmentation","piecewise linear representation","piecewise linear techniques","streaming time series","time series","time series stream data","typical time series datasets"],"search_terms":["novel","segmentation","representation","approach","streaming","time","series","hu","guan","zhan","ding","li"],"title":"A Novel Segmentation and Representation Approach for Streaming Time Series","year":2019}