{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T09:15:40Z","timestamp":1783415740050,"version":"3.54.6"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642333071","type":"print"},{"value":"9783642333088","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33308-8_13","type":"book-chapter","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T21:33:52Z","timestamp":1346535232000},"page":"149-161","source":"Crossref","is-referenced-by-count":1,"title":["Segmentation Algorithm for Algebraic Progressions"],"prefix":"10.1007","author":[{"given":"Dovile","family":"Karaliene","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zenonas","family":"Navickas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alfonsas","family":"Vainoras","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"6","key":"13_CR1","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\u00a04(6), 284 (1961)","journal-title":"Commun. ACM"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Terzi, E., Tsaparas, P.: Efficient algorithms for sequence segmentation. In: Proceedings of the SIAM International Conference on Data Mining, SDM (2006)","DOI":"10.1137\/1.9781611972764.28"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Shatkay, H., Zdonik, S.B.: Approximate queries and representations for large data sequences. In: Proceedings of the International Conference on Data Engineering (ICDE), pp. 536\u2013545 (1996)","DOI":"10.1109\/ICDE.1996.492204"},{"issue":"12","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1927","DOI":"10.1016\/0031-3203(95)00052-6","volume":"28","author":"A. Koski","year":"1995","unstructured":"Koski, A., Juhola, M., Meriste, M.: Syntactic recognition of ECG signals by attributed finite automata. Pattern Recognition\u00a028(12), 1927\u20131940 (1995)","journal-title":"Pattern Recognition"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Mannila, H., Salmenkivi, M.: Finding simple intensity descriptions from event sequence data. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 341\u2013346 (2001)","DOI":"10.1145\/502512.502562"},{"key":"13_CR6","unstructured":"Dd Ge, X., Smyth, P.: Segmental Semi-Markov models for endpoint detection in plasma etching. IEEE Transactions on Semiconductor Engineering (2001)"},{"key":"13_CR7","unstructured":"Eamonn, J.K., Selina, C., David, H., Michael, J.P.: An online algorithm for segmenting time series. In: Proceedings of the IEEE International Conference on Data Mining (ICDM), pp. 289\u2013296 (2001)"},{"issue":"12","key":"13_CR8","doi-asserted-by":"publisher","first-page":"2232","DOI":"10.1109\/TPAMI.2010.44","volume":"32","author":"E. Fuchs","year":"2010","unstructured":"Fuchs, E., Gruber, T., Nitschke, J., Sick, B.: Online segmentation of time series based on polynomial least-squares approximations. IEEE Trans. Pattern Anal. Mach. Intell.\u00a032(12), 2232\u20132245 (2010)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"13_CR9","unstructured":"Fu, A.C., Chung, F.L., Ng, V., Luk, R.: Evolutionary segmentation of financial time series into subsequences. In: Evolutionary Computation, pp. 426\u2013430 (2001)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Cohen, P.R., Heeringa, B., Adams, N.M.: Unsupervised segmentation of categorical time series into episodes. In: ICDM, pp. 99\u2013106 (2002)","DOI":"10.21236\/ADA461169"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Lemire, D.: A better alternative to piecewise linear time series segmentation. In: SIAM Data Mining, pp. 545\u2013550 (2007)","DOI":"10.1137\/1.9781611972771.59"},{"issue":"7","key":"13_CR12","first-page":"992","volume":"20","author":"T. Palpanas","year":"2008","unstructured":"Palpanas, T., Vlachos, M., Keogh, E.J., Gunopulos, D.: Streaming time series summarization using user-defined amnesic functions. TKDE\u00a020(7), 992\u20131006 (2008)","journal-title":"TKDE"},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"399","DOI":"10.3846\/13926292.2006.9637327","volume":"11","author":"Z. Navickas","year":"2006","unstructured":"Navickas, Z., Bikulciene, L.: Expressions of solutions of ordinary differential equations by standard functions. Mathematical Modeling and Analysis\u00a011, 399\u2013412 (2006)","journal-title":"Mathematical Modeling and Analysis"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1016\/j.amc.2009.01.074","volume":"211","author":"Z. Navickas","year":"2009","unstructured":"Navickas, Z., Ragulskis, M.: How far one can go with the Exp-function method? Applied Mathematics and Computation\u00a0211, 522\u2013530 (2009)","journal-title":"Applied Mathematics and Computation"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"2380","DOI":"10.1016\/j.amc.2010.03.083","volume":"216","author":"Z. Navickas","year":"2010","unstructured":"Navickas, Z., Bikulciene, L., Ragulskis, M.: Generalization of Exp-function and other standard function methods. Applied Mathematic sand Computation\u00a0216, 2380\u20132393 (2010)","journal-title":"Applied Mathematic sand Computation"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"3874","DOI":"10.1016\/j.cnsns.2010.01.032","volume":"15","author":"Z. Navickas","year":"2010","unstructured":"Navickas, Z., Ragulskis, M., Bikulciene, L.: Be careful with the Exp-function method -additional remarks. Communications in Nonlinear Science and Numerical Simulations\u00a015, 3874\u20133886 (2010)","journal-title":"Communications in Nonlinear Science and Numerical Simulations"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1016\/j.neucom.2011.02.017","volume":"64","author":"M. Ragulskis","year":"2011","unstructured":"Ragulskis, M., Lukoseviciute, K., Navickas, Z., Palivonaite, R.: Short-term time series forecasting based on the identification of skeleton algebraic sequences. Neurocomputing\u00a064, 1735\u20131747 (2011)","journal-title":"Neurocomputing"},{"issue":"92","key":"13_CR18","first-page":"107","volume":"4","author":"A. Sliupaite","year":"2009","unstructured":"Sliupaite, A., Navickas, Z., Vainoras, A.: Evaluation of Complexity of ECG Parameters Using Sample Entropy and Hankel Matrix. Electronics and Electrical Engineering, Kaunas: Technologija\u00a04(92), 107\u2013110 (2009)","journal-title":"Electronics and Electrical Engineering, Kaunas: Technologija"},{"issue":"2","key":"13_CR19","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1081\/SAC-120017494","volume":"32","author":"V.G. Moskvina","year":"2003","unstructured":"Moskvina, V.G., Zhigljavsky, A.A.: An algorithm based on singular spectrum analysis for change-point detection. Communication in Statistics - Simulation and Computation\u00a032(2), 319\u2013352 (2003)","journal-title":"Communication in Statistics - Simulation and Computation"}],"container-title":["Communications in Computer and Information Science","Information and Software Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33308-8_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T18:16:48Z","timestamp":1744049808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33308-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642333071","9783642333088"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33308-8_13","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}