{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T14:07:37Z","timestamp":1774879657147,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319730127","type":"print"},{"value":"9783319730134","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T00:00:00Z","timestamp":1513814400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73013-4_29","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T19:19:27Z","timestamp":1513797567000},"page":"313-322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Randomized Algorithm for 2-Partition of\u00a0a\u00a0Sequence"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Kel\u2019manov","sequence":"first","affiliation":[]},{"given":"Sergey","family":"Khamidullin","sequence":"additional","affiliation":[]},{"given":"Vladimir","family":"Khandeev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"issue":"1","key":"29_CR1","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.engappai.2010.09.007","volume":"24","author":"T Fu","year":"2011","unstructured":"Fu, T.: A review on time series data mining. Eng. Appl. Artif. Intell. 24(1), 164\u2013181 (2011)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"29_CR2","series-title":"Remote Sensing and Digital Image Processing","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15967-6","volume-title":"Remote Sensing Time Series","author":"C Kuenzer","year":"2015","unstructured":"Kuenzer, C., Dech, S., Wagner, W.: Remote Sensing Time Series. Remote Sensing and Digital Image Processing, vol. 22. Springer, Switzerland (2015). https:\/\/doi.org\/10.1007\/978-3-319-15967-6"},{"issue":"11","key":"29_CR3","doi-asserted-by":"publisher","first-page":"1857","DOI":"10.1016\/j.patcog.2005.01.025","volume":"38","author":"TW Liao","year":"2005","unstructured":"Liao, T.W.: Clustering of time series data \u2013 a survey. Pattern Recogn. 38(11), 1857\u20131874 (2005)","journal-title":"Pattern Recogn."},{"key":"29_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14142-8","volume-title":"Data Mining: The Textbook","author":"CC Aggarwal","year":"2015","unstructured":"Aggarwal, C.C.: Data Mining: The Textbook. Springer, Switzerland (2015). https:\/\/doi.org\/10.1007\/978-3-319-14142-8"},{"issue":"6094","key":"29_CR5","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1126\/science.1223269","volume":"337","author":"JA Carter","year":"2012","unstructured":"Carter, J.A., Agol, E., et al.: Kepler-36: a pair of planets with neighboring orbits and dissimilar densities. Science 337(6094), 556\u2013559 (2012)","journal-title":"Science"},{"issue":"3","key":"29_CR6","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1109\/TSP.2003.822285","volume":"52","author":"AV Kel\u2019manov","year":"2004","unstructured":"Kel\u2019manov, A.V., Jeon, B.: A posteriori joint detection and discrimination of pulses in a quasiperiodic pulse train. IEEE Trans. Sig. Process. 52(3), 645\u2013656 (2004)","journal-title":"IEEE Trans. Sig. Process."},{"key":"29_CR7","volume-title":"Randomized Algorithms","author":"M Rajeev","year":"1995","unstructured":"Rajeev, M., Prabhakar, R.: Randomized Algorithms. Cambridge University Press, New York (1995)"},{"issue":"3","key":"29_CR8","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1134\/S1990478913030095","volume":"7","author":"AV Kel\u2019manov","year":"2013","unstructured":"Kel\u2019manov, A.V., Pyatkin, A.V.: On complexity of some problems of cluster analysis of vector sequences. J. Appl. Ind. Math. 7(3), 363\u2013369 (2013)","journal-title":"J. Appl. Ind. Math."},{"issue":"2","key":"29_CR9","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1134\/S1990478914020100","volume":"8","author":"AV Kel\u2019manov","year":"2014","unstructured":"Kel\u2019manov, A.V., Khamidullin, S.A.: An approximating polynomial algorithm for a sequence partitioning problem. J. Appl. Ind. Math. 8(2), 236\u2013244 (2014)","journal-title":"J. Appl. Ind. Math."},{"issue":"1","key":"29_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1134\/S0005117917010052","volume":"78","author":"AV Kel\u2019manov","year":"2017","unstructured":"Kel\u2019manov, A.V., Khamidullin, S.A., Khandeev, V.I.: Exact pseudopolynomial algorithm for one sequence partitioning problem. Autom. Remote Control 78(1), 67\u201374 (2017)","journal-title":"Autom. Remote Control"},{"issue":"2","key":"29_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1134\/S199047891602006X","volume":"10","author":"AV Kel\u2019manov","year":"2016","unstructured":"Kel\u2019manov, A.V., Khamidullin, S.A., Khandeev, V.I.: A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem. J. Appl. Ind. Math. 10(2), 209\u2013219 (2016)","journal-title":"J. Appl. Ind. Math."},{"issue":"1","key":"29_CR12","first-page":"55","volume":"9","author":"EK Gimadi","year":"2006","unstructured":"Gimadi, E.K., Kel\u2019manov, A.V., Kel\u2019manova, M.A., Khamidullin, S.A.: A posteriori detection of a quasiperiodic fragment with a given number of repetitions in a numerical sequence (in Russian). Sibirsk. Zh. Ind. Mat. 9(1), 55\u201374 (2006)","journal-title":"Sibirsk. Zh. Ind. Mat."},{"issue":"1","key":"29_CR13","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1134\/S1054661808010057","volume":"18","author":"EK Gimadi","year":"2008","unstructured":"Gimadi, E.K., Kel\u2019manov, A.V., Kel\u2019manova, M.A., Khamidullin, S.A.: A posteriori detecting a quasiperiodic fragment in a numerical sequence. Pattern Recogn. Image Anal. 18(1), 30\u201342 (2008)","journal-title":"Pattern Recogn. Image Anal."},{"issue":"S2","key":"29_CR14","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1134\/S0081543808060096","volume":"263","author":"AV Kel\u2019manov","year":"2008","unstructured":"Kel\u2019manov, A.V.: Off-line detection of a quasi-periodically recurring fragment in a numerical sequence. Proc. Steklov Inst. Math. 263(S2), 84\u201392 (2008)","journal-title":"Proc. Steklov Inst. Math."},{"issue":"11","key":"29_CR15","doi-asserted-by":"publisher","first-page":"1966","DOI":"10.1134\/S0965542509110128","volume":"49","author":"AV Kel\u2019manov","year":"2009","unstructured":"Kel\u2019manov, A.V., Pyatkin, A.V.: Complexity of certain problems of searching for subsets of vectors and cluster analysis. Comput. Math. Math. Phys. 49(11), 1966\u20131971 (2009)","journal-title":"Comput. Math. Math. Phys."},{"issue":"2","key":"29_CR16","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1134\/S0965542516020111","volume":"56","author":"AV Kel\u2019manov","year":"2016","unstructured":"Kel\u2019manov, A.V., Khandeev, V.I.: Fully polynomial-time approximation scheme for a special case of a quadratic euclidean 2-clustering problem. Comput. Math. Math. Phys. 56(2), 334\u2013341 (2016)","journal-title":"Comput. Math. Math. Phys."},{"key":"29_CR17","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"issue":"2","key":"29_CR18","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1134\/S096554251502013X","volume":"55","author":"AV Kel\u2019manov","year":"2015","unstructured":"Kel\u2019manov, A.V., Khandeev, V.I.: A randomized algorithm for two-cluster partition of a set of vectors. Comput. Math. Math. Phys. 55(2), 330\u2013339 (2015)","journal-title":"Comput. Math. Math. Phys."},{"issue":"5","key":"29_CR19","first-page":"762","volume":"41","author":"AV Kel\u2019manov","year":"2001","unstructured":"Kel\u2019manov, A.V., Khamidullin, S.A.: Posterior detection of a given number of identical subsequences in a quasi-periodic sequence. Comput. Math. Math. Phys. 41(5), 762\u2013774 (2001)","journal-title":"Comput. Math. Math. Phys."}],"container-title":["Lecture Notes in Computer Science","Analysis of Images, Social Networks and Texts"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73013-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:14:49Z","timestamp":1710324889000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73013-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,21]]},"ISBN":["9783319730127","9783319730134"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73013-4_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,21]]},"assertion":[{"value":"21 December 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Analysis of Images, Social Networks and Texts","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aist2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aistconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}