Nothing Special   »   [go: up one dir, main page]

Skip to main content

Advertisement

Log in

An extensive experimental study on segmenting online time series with error bound guarantee

  • Original Article
  • Published:
International Journal of Machine Learning and Cybernetics Aims and scope Submit manuscript

Abstract

An improved algorithm, i.e., HFSW, for segmenting online time series with error bound is proposed in our latest paper (IJMLC doi:10.1007/s13042-014-0310-9, 2014). Some researchers engaged in this filed read this paper and point out that there are two another existing strategies named FSW (IEEE TKDE doi:10.1109/TKDE.2008.29, 2008) and DisAlg (VLDBJ doi:10.1007/s00778-014-0355-0, 2014) which can also deal with the segmentation of online time series. And then, they want us to conduct some further experiments to demonstrate the effectiveness of our proposed method through comparing HFSW with FSW and DisAlg. Thus, we conduct such experimental comparison by testing 43 real datasets with the same fixed setting and further give the analysis to main difference among these algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Liu X, Lin Z, Wang H (2008) Novel online methods for time series segmentation. IEEE Trans Knowl Data Eng 20(12):1616–1626

    Article  Google Scholar 

  2. Qi J, Zhang R, Ramamohanarao K, Wang H, Wen Z, Wu D (2013) Indexable online time series segmentation with error bound guarantee. World Wide Web 18(2):1–43

    Google Scholar 

  3. Xie Q, Pang C, Zhou X, Zhang X, Deng K (2014) Maximum error-bounded piecewise linear representation for online stream approximation. VLDB J 23(6):1–23

    Article  Google Scholar 

  4. Zhao H, Li G, Zhang H, Xue Y (2014) An improved algorithm for segmenting online time series with error bound guarantee. Int J Mach Learn Cybern 1868–8071

  5. Keogh E, Xi X, Wei L, Ratanamahatana C (2006) The UCR time series classification/clustering homepage

Download references

Acknowledgments

The authors would like to thank the authors of [4] for their generous giving us their source code for the comparison tests in this paper. This work was supported by the Hebei Academy of Sciences Project (No. 15606 and No. 15605).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Huanyu Zhao.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, R., Wang, L., Guo, X. et al. An extensive experimental study on segmenting online time series with error bound guarantee. Int. J. Mach. Learn. & Cyber. 7, 1053–1056 (2016). https://doi.org/10.1007/s13042-015-0379-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13042-015-0379-9

Keywords

Navigation