{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:07:02Z","timestamp":1760609222568,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T00:00:00Z","timestamp":1576800000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T00:00:00Z","timestamp":1576800000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61572022"],"award-info":[{"award-number":["61572022"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s13042-019-01052-y","type":"journal-article","created":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T12:02:56Z","timestamp":1576843376000},"page":"1483-1499","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An online PLA algorithm with maximum error bound for generating optimal mixed-segments"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5042-2530","authenticated-orcid":false,"given":"Huanyu","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Tongliang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Genlang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Zhaowei","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Mengya","family":"Bo","sequence":"additional","affiliation":[]},{"given":"Chaoyi","family":"Pang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,20]]},"reference":[{"issue":"2","key":"1052_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s13042-012-0081-0","volume":"4","author":"A Letchford","year":"2013","unstructured":"Letchford A, Gao J, Zheng L (2013) Filtering financial time series by least squares. Int J Mach Learn Cybern 4(2):149\u2013154","journal-title":"Int J Mach Learn Cybern"},{"issue":"11","key":"1052_CR2","doi-asserted-by":"publisher","first-page":"2497","DOI":"10.1109\/TMI.2016.2581211","volume":"35","author":"A Pulkkinen","year":"2016","unstructured":"Pulkkinen A, Cox BT, Arridge SR, Goh H, Kaipio JP, Tarvainen T (2016) Direct estimation of optical parameters from photoacoustic time series in quantitative photoacoustic tomography. IEEE Trans Med Imaging 35(11):2497\u20132508","journal-title":"IEEE Trans Med Imaging"},{"issue":"3","key":"1052_CR3","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1109\/TKDE.2017.2772907","volume":"30","author":"R Wang","year":"2018","unstructured":"Wang R, Chow C-Y, Lyu Y, Lee VCS, Kwong S, Li Y, Zeng J (2018) TaxiRec: recommending road clusters to taxi drivers using ranking-based extreme learning machines. IEEE Trans Knowl Data Eng 30(3):585\u2013598","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"7","key":"1052_CR4","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1109\/TSMC.2017.2701419","volume":"49","author":"X Wang","year":"2019","unstructured":"Wang X, Zhang T, Wang R (2019) Non-iterative deep learning: incorporating restricted Boltzmann machine into multilayer random weight neural networks. IEEE Trans Syst Man Cybern Syst 49(7):1299\u20131380","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"6","key":"1052_CR5","doi-asserted-by":"publisher","first-page":"1460","DOI":"10.1109\/TFUZZ.2017.2717803","volume":"25","author":"R Wang","year":"2017","unstructured":"Wang R, Wang X, Kwong S, Chen X (2017) Incorporating diversity and informativeness in multiple-instance active learning. IEEE Trans Fuzzy Syst 25(6):1460\u20131475","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"1052_CR6","unstructured":"Rafiei D, Mendelzon A (1998) Efficient retrieval of similar time sequences using DFT. eprint arXiv:cs\/9809033, pp 249\u2013257"},{"issue":"1","key":"1052_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-011-9571-9","volume":"65","author":"C Pang","year":"2013","unstructured":"Pang C, Zhang Q, Zhou X, Hansen DP, Wang S, Maeder AJ (2013) Computing unrestricted synopses under maximum error bound. Algorithmica 65(1):1\u201342","journal-title":"Algorithmica"},{"key":"1052_CR8","doi-asserted-by":"crossref","unstructured":"Perng C, Wang H, Zhang SR, Parker DS (2000) Landmarks: a new model for similarity-based pattern querying in time series databases. In: Proceedings of the 16th international conference on data engineering. IEEE Computer Society, pp 33\u201342","DOI":"10.1109\/ICDE.2000.839385"},{"issue":"12","key":"1052_CR9","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1109\/TKDE.2008.29","volume":"20","author":"X Liu","year":"2008","unstructured":"Liu X, Lin Z, Wang H (2008) Novel online methods for time series segmentation. IEEE Trans Knowl Data Eng 20(12):1616\u20131626","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1052_CR10","doi-asserted-by":"crossref","unstructured":"Palpanas T, Vlachos M, Keogh E, Gunopulos D, Truppel W (2004) Online amnesic approximation of streaming time series. In: 20th international conference on data engineering, 2004. Proceedings, pp 339\u2013349","DOI":"10.1109\/ICDE.2004.1320009"},{"key":"1052_CR11","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1109\/TKDE.2007.190737","volume":"20","author":"T Palpanas","year":"2008","unstructured":"Palpanas T, Vlachos M, Keogh E, Gunopulos D (2008) Streaming time series summarization using user-defined amnesic functions. IEEE Trans Knowl Data Eng 20:992\u20131006","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1052_CR12","unstructured":"Keogh EJ, Pazzani MJ (1999) Scaling up dynamic time warping to massive dataset. In: principles of data mining and knowledge discovery, Third European conference, PKDD \u201999, Prague, Czech Republic, September 15\u201318, 1999, Proceedings, pp 1\u201311"},{"issue":"6","key":"1052_CR13","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1007\/s00778-014-0355-0","volume":"23","author":"Q Xie","year":"2014","unstructured":"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):915\u2013937","journal-title":"VLDB J"},{"key":"1052_CR14","unstructured":"Zhao H, Pang C, Kotagiri R, Pang CK, Li T (2017) An optimal piecewise linear approximation algorithm on semi-connected segmentation under maximum error bound. Technical report, Zhejiang University"},{"key":"1052_CR15","doi-asserted-by":"crossref","unstructured":"Luo G, Yi K, Cheng S-W Li Z, Fan W, Cheng H, Yadong M (2015) Piecewise linear approximation of streaming time series data with max-error guarantees. In: IEEE international conference on data engineering, pp 173\u2013184","DOI":"10.1109\/ICDE.2015.7113282"},{"key":"1052_CR16","first-page":"132","volume-title":"Fitting polygonal functions to a set of points in the plane","author":"SL Hakimi","year":"1991","unstructured":"Hakimi SL, Schmeichel EF (1991) Fitting polygonal functions to a set of points in the plane. Academic Press, Inc, Cambridge, pp 132\u2013136"},{"issue":"3","key":"1052_CR17","first-page":"159","volume":"9","author":"H Imai","year":"1986","unstructured":"Imai H, Iri M (1986) An optimal algorithm for approximating a piecewise linear function. Inf Process Lett 9(3):159\u2013162","journal-title":"Inf Process Lett"},{"issue":"C","key":"1052_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2015.09.017","volume":"345","author":"H Zhao","year":"2016","unstructured":"Zhao H, Dong Z, Li T, Wang X, Pang C (2016) Segmenting time series with connected lines under maximum error bound. Inf Sci 345(C):1\u20138","journal-title":"Inf Sci"},{"key":"1052_CR19","unstructured":"Keogh E, Xi X, Wei L, Ratanamahatana C (2011) The ucr time series classification\/clustering homepage"},{"issue":"1","key":"1052_CR20","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0020-0255(83)90008-7","volume":"29","author":"U Appel","year":"1983","unstructured":"Appel U, Brandt AV (1983) Adaptive sequential segmentation of piecewise stationary time series. Inf Sci 29(1):27\u201356","journal-title":"Inf Sci"},{"issue":"6","key":"1052_CR21","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1145\/366573.366611","volume":"4","author":"R Bellman","year":"1961","unstructured":"Bellman R (1961) On the approximation of curves by line segments using dynamic programming. Commun. ACM 4(6):284","journal-title":"Commun. ACM"},{"key":"1052_CR22","doi-asserted-by":"crossref","unstructured":"Keogh E, Chu S, Hart D, Pazzani M (2001) An online algorithm for segmenting time series. In: Proceedings of the 2001 IEEE international conference on data mining, ICDM \u201901. IEEE Computer Society, pp 289\u2013296","DOI":"10.1109\/ICDM.2001.989531"},{"issue":"1","key":"1052_CR23","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/974750.974753","volume":"29","author":"M Garofalakis","year":"2004","unstructured":"Garofalakis M, Gibbons PB (2004) Probabilistic wavelet synopses. ACM Trans Database Syst 29(1):43\u201390","journal-title":"ACM Trans Database Syst"},{"issue":"4","key":"1052_CR24","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1145\/1114244.1114246","volume":"30","author":"M Garofalakis","year":"2005","unstructured":"Garofalakis M, Kumar A (2005) Wavelet synopses for general error metrics. ACM Trans Database Syst 30(4):888\u2013928","journal-title":"ACM Trans Database Syst"},{"issue":"5","key":"1052_CR25","doi-asserted-by":"publisher","first-page":"1638","DOI":"10.1109\/TFUZZ.2014.2371479","volume":"23","author":"X Wang","year":"2015","unstructured":"Wang X, Xing H-J, Li Y (2015) A study on relationship between generalization abilities and fuzziness of base classifiers in ensemble learning. IEEE Trans Fuzzy Syst 23(5):1638\u20131654","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"2","key":"1052_CR26","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1109\/TCYB.2017.2653223","volume":"48","author":"X Wang","year":"2018","unstructured":"Wang X, Wang R, Chen X (2018) Discovering the relationship between generalization and uncertainty by incorporating complexity of classification. IEEE Trans Cybern 48(2):703\u2013715","journal-title":"IEEE Trans Cybern"},{"issue":"9","key":"1052_CR27","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1145\/358746.358758","volume":"24","author":"J O\u2019Rourke","year":"1981","unstructured":"O\u2019Rourke J (1981) An on-line algorithm for fitting straight lines between data ranges. Commun ACM 24(9):574\u2013578","journal-title":"Commun ACM"},{"issue":"1","key":"1052_CR28","doi-asserted-by":"publisher","first-page":"145","DOI":"10.14778\/1687627.1687645","volume":"2","author":"H Elmeleegy","year":"2009","unstructured":"Elmeleegy H, Elmagarmid AK, Cecchet E, Aref WG, Zwaenepoel W (2009) Online piece-wise linear approximation of numerical streams with precision guarantees. Proc Vldb Endow 2(1):145\u2013156","journal-title":"Proc Vldb Endow"},{"issue":"3","key":"1052_CR29","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s13042-014-0310-9","volume":"7","author":"H Zhao","year":"2016","unstructured":"Zhao H, Li G, Zhang H, Xue Y (2016) An improved algorithm for segmenting online time series with error bound guarantee. Int J Mach Learn Cybern 7(3):365\u2013374","journal-title":"Int J Mach Learn Cybern"},{"key":"1052_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational geometry algorithms and applications","author":"MD Berg","year":"2008","unstructured":"Berg MD, Cheong O, van Kreveld M, Overmars M (2008) Computational geometry algorithms and applications. Springer, Berlin"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-019-01052-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-019-01052-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-019-01052-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,19]],"date-time":"2020-12-19T00:44:48Z","timestamp":1608338688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-019-01052-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,20]]},"references-count":30,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["1052"],"URL":"https:\/\/doi.org\/10.1007\/s13042-019-01052-y","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2019,12,20]]},"assertion":[{"value":"26 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}