{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:45:05Z","timestamp":1743083105164,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":29,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819605781"},{"type":"electronic","value":"9789819605798"}],"license":[{"start":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T00:00:00Z","timestamp":1732838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T00:00:00Z","timestamp":1732838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-0579-8_10","type":"book-chapter","created":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T14:46:26Z","timestamp":1732805186000},"page":"133-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Representation with\u00a0Minimized Max-Error in\u00a0Optimal Piecewise Linear Approximation of\u00a0Time Series Data"],"prefix":"10.1007","author":[{"given":"Huanyu","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tongliang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiting","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenyu","family":"Shu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaoyi","family":"Pang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,29]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Abam, M., Berg, M., Hachenberger, P., Zarei, A.: Streaming algorithms for line simplification. In: SCG\u201907, pp. 175\u2013183 (2007)","DOI":"10.1145\/1247069.1247103"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/PL00009500","volume":"23","author":"P Agarwal","year":"2000","unstructured":"Agarwal, P., Varadarajan, K.: Efficient algorithms for approximating polygonal chains. Discrete Comput. Geom. 23, 273\u2013291 (2000)","journal-title":"Discrete Comput. Geom."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1145\/366573.366611","volume":"4","author":"R Bellman","year":"1961","unstructured":"Bellman, R.: On the approximation of curves by line segments using dynamic programming. Commun. ACM 4, 284 (1961)","journal-title":"Commun. ACM"},{"key":"10_CR4","unstructured":"Berg, M., Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications (2008)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Dalai, M., Leonardi, R.: Efficient (piecewise) linear minmax approximation of digital signals. In: 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing, vol.\u00a02, pp. ii\u2013585\u20138 (2004)","DOI":"10.1109\/ICASSP.2004.1326325"},{"issue":"8","key":"10_CR6","doi-asserted-by":"publisher","first-page":"3111","DOI":"10.1109\/TSP.2006.875394","volume":"54","author":"M Dalai","year":"2006","unstructured":"Dalai, M., Leonardi, R.: Approximations of one-dimensional digital signals under the $$l_\\infty $$ norm. IEEE Trans. Signal Process. 54(8), 3111\u20133124 (2006)","journal-title":"IEEE Trans. Signal Process."},{"key":"10_CR7","unstructured":"Dau, H., et al.: The UCR time series classification archive (2018). https:\/\/www.cs.ucr.edu\/~eamonn\/time_series_data_2018\/"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0166-218X(91)90065-5","volume":"31","author":"P Egyed","year":"1991","unstructured":"Egyed, P., Wenger, R.: Ordered stabbing of pairwise disjoint convex sets in linear time. Discrete Appl. Math. 31, 133\u2013140 (1991)","journal-title":"Discrete Appl. Math."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.14778\/1687627.1687645","volume":"2","author":"H Elmeleegy","year":"2009","unstructured":"Elmeleegy, H., Elmagarmid, A., Cecchet, E., Aref, W., Zwaenepoel, W.: Online piece-wise linear approximation of numerical streams with precision guarantees. Proc. VLDB Endow. 2, 145\u2013156 (2009)","journal-title":"Proc. VLDB Endow."},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1145\/368637.368753","volume":"5","author":"B Gluss","year":"1962","unstructured":"Gluss, B.: Further remarks on line segment curve-fitting using dynamic programming. Commun. ACM 5, 441\u2013443 (1962)","journal-title":"Commun. ACM"},{"issue":"4","key":"10_CR11","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/BF02570717","volume":"14","author":"MT Goodrich","year":"1995","unstructured":"Goodrich, M.T.: Efficient piecewise-linear function approximation using the uniform metric. Discrete Comput. Geometry 14(4), 445\u2013462 (1995). https:\/\/doi.org\/10.1007\/BF02570717","journal-title":"Discrete Comput. Geometry"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Guibas, L., Hershberger, J., Mitchell, J., Snoeyink, J.: Approximating polygons and subdivisions with minimum link paths. In: ISA \u201991, pp. 151\u2013162 (1991)","DOI":"10.1007\/3-540-54945-5_59"},{"key":"10_CR13","first-page":"132","volume":"53","author":"S Hakimi","year":"1991","unstructured":"Hakimi, S., Schmeichel, E.: Fitting polygonal functions to a set of points in the plane. CVGIP 53, 132\u2013136 (1991)","journal-title":"CVGIP"},{"key":"10_CR14","unstructured":"Hershberger, J., Snoeyink, J.: Speeding up the douglas-peucker line-simplification algorithm. In: 5th International Symposium Spatial Data Handling, pp. 134\u2013143 (2000)"},{"key":"10_CR15","first-page":"31","volume":"36","author":"H Imai","year":"1986","unstructured":"Imai, H., Iri, M.: Computational-geometric methods for polygonal approximations of a curve. CVGIP 36, 31\u201341 (1986)","journal-title":"CVGIP"},{"key":"10_CR16","first-page":"159","volume":"9","author":"H Imai","year":"1986","unstructured":"Imai, H., Iri, M.: An optimal algorithm for approximating a piecewise linear function. Inform. Process. Lett. 9, 159\u2013162 (1986)","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"10_CR17","doi-asserted-by":"publisher","first-page":"697","DOI":"10.14778\/3574245.3574255","volume":"16","author":"P Jiao","year":"2022","unstructured":"Jiao, P., et al.: Toward quantity-of-interest preserving lossy compression for scientific data. Proc. VLDB Endow. 16(4), 697\u2013710 (2022)","journal-title":"Proc. VLDB Endow."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Kitsios, X., Liakos, P., Papakonstantinopoulou, K., Kotidis, Y.: Sim-piece: highly accurate piecewise linear approximation through similar segment merging 16(8), 1910\u20131922 (2023)","DOI":"10.14778\/3594512.3594521"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3474373","volume":"46","author":"X Lin","year":"2021","unstructured":"Lin, X., Ma, S., Jiang, J., Hou, Y., Wo, T.: Error bounded line simplification algorithms for trajectory compression: an experimental evaluation. TODS 46, 1\u201344 (2021)","journal-title":"TODS"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Luo, G., et al.: Piecewise linear approximation of streaming time series data with max-error guarantees. In: ICDE\u201915, pp. 173\u2013184 (2015)","DOI":"10.1109\/ICDE.2015.7113282"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in r3 and related problems. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pp. 329\u2013338 (1982)","DOI":"10.1109\/SFCS.1982.24"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1145\/358746.358758","volume":"24","author":"J O\u2019Rourke","year":"1981","unstructured":"O\u2019Rourke, J.: An on-line algorithm for fitting straight lines between data ranges. Commun. ACM 24, 574\u2013578 (1981)","journal-title":"Commun. ACM"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Seidel, R.: Small-dimensional linear programming and convex hulls made easy 6(3), 423\u2013434 (1991)","DOI":"10.1007\/BF02574699"},{"issue":"1","key":"10_CR24","first-page":"99","volume":"35","author":"S Suri","year":"1986","unstructured":"Suri, S.: A linear time algorithm for minimum link paths inside a simple polygon. CVGIP 35(1), 99\u2013110 (1986)","journal-title":"CVGIP"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Weibel, R.: Generalization of spatial data: principles and selected algorithms. In: Algorithmic Foundations of Geographic Information Systems, pp. 99\u2013152 (1996)","DOI":"10.1007\/3-540-63818-0_5"},{"issue":"6","key":"10_CR26","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.: Maximum error-bounded piecewise linear representation for online stream approximation. VLDBJ 23(6), 915\u2013937 (2014)","journal-title":"VLDBJ"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Zhang, X., Wu, X.: Near-lossless $$l_\\infty $$-constrained image decompression via deep neural network. In: 2019 Data Compression Conference (DCC), pp. 33\u201342 (2019)","DOI":"10.1109\/DCC.2019.00011"},{"key":"10_CR28","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.1007\/s13042-019-01052-y","volume":"11","author":"H Zhao","year":"2020","unstructured":"Zhao, H., Li, T., Chen, G., Dong, Z., Bo, M., Pang, C.: An online PLA algorithm with maximum error bound for generating optimal mixed-segments. Int. J. Mach. Learn. Cybern. 11, 1483\u20131499 (2020)","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"10_CR29","first-page":"164","volume":"34","author":"H Zhao","year":"2022","unstructured":"Zhao, H., et al.: An optimal online semi-connected PLA algorithm with maximum error bound. IEEE TKDE 34, 164\u2013177 (2022)","journal-title":"IEEE TKDE"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0579-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T15:04:06Z","timestamp":1732806246000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0579-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,29]]},"ISBN":["9789819605781","9789819605798"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0579-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,29]]},"assertion":[{"value":"29 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare that they have no known competing interests that could have appeared to influence the work reported in this paper.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Doha","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qatar","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wise2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wise2024-qatar.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}