{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T09:10:51Z","timestamp":1694769051015},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T00:00:00Z","timestamp":1553126400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10472-019-09623-z","type":"journal-article","created":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T08:18:01Z","timestamp":1553156281000},"page":"157-168","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence"],"prefix":"10.1007","volume":"88","author":[{"given":"Alexander","family":"Kel\u2019manov","sequence":"first","affiliation":[]},{"given":"Sergey","family":"Khamidullin","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-2978-8340","authenticated-orcid":false,"given":"Vladimir","family":"Khandeev","sequence":"additional","affiliation":[]},{"given":"Artem","family":"Pyatkin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,21]]},"reference":[{"issue":"1","key":"9623_CR1","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/0196-6774(91)90022-Q","volume":"12","author":"A Aggarwal","year":"1991","unstructured":"Aggarwal, A., Imai, H., Katoh, N., Suri, S.: Finding k points with minimum diameter and related problems. J. Algorithms 12(1), 38\u201356 (1991)","journal-title":"J. Algorithms"},{"key":"9623_CR2","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1002\/9780470904848","volume-title":"Handbook of Statistical Data Editing and Imputation","author":"T Waal de","year":"2011","unstructured":"de Waal, T., Pannekoek, J., Scholtus, S.: Handbook of Statistical Data Editing and Imputation, p 456. Wiley, Hoboken (2011)"},{"key":"9623_CR3","doi-asserted-by":"publisher","first-page":"296","DOI":"10.4135\/9781452269948","volume-title":"Best Practices in Data Cleaning: a Complete Guide to Everything You Need to do before and after Collecting your Data","author":"JW Osborne","year":"2013","unstructured":"Osborne, J.W.: Best Practices in Data Cleaning: a Complete Guide to Everything You Need to do before and after Collecting your Data, p 296. SAGE Publication Inc., Los Angeles (2013)"},{"key":"9623_CR4","first-page":"297","volume-title":"Robust Methods for Data Reduction","author":"A Farcomeni","year":"2015","unstructured":"Farcomeni, A., Greco, L.: Robust Methods for Data Reduction, p 297. Chapman and Hall\/CRC, Boca Raton (2015)"},{"key":"9623_CR5","first-page":"191","volume":"79","author":"P Hansen","year":"1997","unstructured":"Hansen, P., Jaumard, B.: Cluster analysis and mathematical programming. Math. Program. 79, 191\u2013215 (1997)","journal-title":"Math. Program."},{"issue":"8","key":"9623_CR6","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain, A.K.: Data clustering: 50 years beyond k-means. Pattern Recogn. Lett. 31 (8), 651\u2013666 (2010)","journal-title":"Pattern Recogn. Lett."},{"key":"9623_CR7","first-page":"707","volume":"8583","author":"AS Shirkhorshidi","year":"2014","unstructured":"Shirkhorshidi, A.S., Aghabozorgi, S., Wah, T.Y., Herawan, T.: Big data clustering: a review. LNCS 8583, 707\u2013720 (2014)","journal-title":"LNCS"},{"key":"9623_CR8","first-page":"738","volume-title":"Pattern Recognition and Machine Learning","author":"CM Bishop","year":"2006","unstructured":"Bishop, C.M.: Pattern Recognition and Machine Learning, p 738. Springer, New York (2006)"},{"key":"9623_CR9","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-1-4614-7138-7","volume-title":"An Introduction to Statistical Learning","author":"G James","year":"2013","unstructured":"James, G., Witten, D., Hastie, T., Tibshirani, R.: An Introduction to Statistical Learning, p 426. Springer, New York (2013)"},{"key":"9623_CR10","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The Elements of Statistical Learning, vol. 2","author":"T Hastie","year":"2009","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning, vol. 2, p 763. Springer, Berlin (2009)"},{"key":"9623_CR11","doi-asserted-by":"crossref","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, Berlin (2015)"},{"issue":"1","key":"9623_CR12","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.engappai.2010.09.007","volume":"24","author":"T-C Fu","year":"2011","unstructured":"Fu, T.-C.: A review on time series data mining. Eng. Appl. Artif. Intel. 24(1), 164\u2013181 (2011)","journal-title":"Eng. Appl. Artif. Intel."},{"key":"9623_CR13","volume-title":"Remote sensing time series, remote sensing and digital image processing, vol. 22","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)"},{"issue":"11","key":"9623_CR14","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 \u2014 a survey. Pattern Recogn. 38(11), 1857\u20131874 (2005)","journal-title":"Pattern Recogn."},{"issue":"3","key":"9623_CR15","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1134\/S1990478911030069","volume":"5","author":"AV Kel\u2019manov","year":"2011","unstructured":"Kel\u2019manov, A.V., Pyatkin, A.V.: NP-completeness of some problems of choosing a vector subset. J. Appl. Indust. Math. 5(3), 352\u2013357 (2011)","journal-title":"J. Appl. Indust. Math."},{"issue":"12","key":"9623_CR16","first-page":"2284","volume":"52","author":"AV Kel\u2019manov","year":"2012","unstructured":"Kel\u2019manov, A.V., Pyatkin, A.: On the complexity of some problems of choosing a vector subsequence. Zhurnal Vychislitel\u2019noi Matematiki i Matematicheskoi Fiziki (in Russian) 52(12), 2284\u20132291 (2012)","journal-title":"Zhurnal Vychislitel\u2019noi Matematiki i Matematicheskoi Fiziki (in Russian)"},{"issue":"1","key":"9623_CR17","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1134\/S1990478912010097","volume":"6","author":"AV Kel\u2019manov","year":"2012","unstructured":"Kel\u2019manov, A.V., Romanchenko, S.M.: An approximation algorithm for solving a problem of search for a vector subset. J. Appl. Indust. Math. 6(1), 90\u201396 (2012)","journal-title":"J. Appl. Indust. Math."},{"issue":"2","key":"9623_CR18","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1134\/S0005117912020129","volume":"73","author":"AV Kel\u2019manov","year":"2012","unstructured":"Kel\u2019manov, A.V., Romanchenko, S.M.: Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems. Autom. Remote. Control. 73(2), 349\u2013354 (2012)","journal-title":"Autom. Remote. Control."},{"issue":"3","key":"9623_CR19","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1134\/S1990478912030131","volume":"6","author":"VV Shenmaier","year":"2012","unstructured":"Shenmaier, V.V.: An approximation scheme for a problem of search for a vector subset. J. Appl. Indust. Math. 6(3), 381\u2013386 (2012)","journal-title":"J. Appl. Indust. Math."},{"issue":"3","key":"9623_CR20","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1134\/S1990478914030041","volume":"8","author":"AV Kel\u2019manov","year":"2014","unstructured":"Kel\u2019manov, A.V., Romanchenko, S.M.: An FPTAS for a vector subset search problem. J. Appl. Indust. Math. 8(3), 329\u2013336 (2014)","journal-title":"J. Appl. Indust. Math."},{"issue":"2","key":"9623_CR21","first-page":"550","volume":"10","author":"VV Shenmaier","year":"2016","unstructured":"Shenmaier, V.V.: Solving some vector subset problems by voronoi diagrams. J. Appl. Indust. Math. 10(2), 550\u2013566 (2016)","journal-title":"J. Appl. Indust. Math."},{"issue":"4","key":"9623_CR22","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1134\/S1990478912040059","volume":"6","author":"AV Kel\u2019manov","year":"2012","unstructured":"Kel\u2019manov, A.V., Romanchenko, S.M., Khamidullin, S.A.: Approximation algorithms for some intractable problems of choosing a vector subsequence. J. Appl. Indust. Math. 6(4), 443\u2013450 (2012)","journal-title":"J. Appl. Indust. Math."},{"issue":"1","key":"9623_CR23","first-page":"143","volume":"53","author":"AV Kel\u2019manov","year":"2013","unstructured":"Kel\u2019manov, A.V., Romanchenko, S.M., Khamidullin, S.A.: Exact pseudopolynomial algorithms for some np-hard problems of searching a vectors subsequence. Zhurnal Vychislitel\u2019noi Matematiki i Matematicheskoi Fiziki (in Russian) 53(1), 143\u2013153 (2013)","journal-title":"Zhurnal Vychislitel\u2019noi Matematiki i Matematicheskoi Fiziki (in Russian)"},{"issue":"4","key":"9623_CR24","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1134\/S1995423917040036","volume":"10","author":"AV Kel\u2019manov","year":"2017","unstructured":"Kel\u2019manov, A.V., Romanchenko, S.M., Khamidullin, S.A.: An approximation scheme for the problem of finding a subsequence. Numer. Anal. Appl. 10(4), 313\u2013323 (2017)","journal-title":"Numer. Anal. Appl."},{"issue":"3","key":"9623_CR25","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1134\/S1054661817030038","volume":"17","author":"AA Ageev","year":"2017","unstructured":"Ageev, A.A., Kel\u2019manov, A.V., Pyatkin, A.V., Khamidullin, S.A., Shenmaier, V.V.: Approximation polynomial algorithm for the data editing and data cleaning problem. Pattern Recognit Image Anal. 17(3), 365\u2013370 (2017)","journal-title":"Pattern Recognit Image Anal."},{"key":"9623_CR26","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-319-93800-4_10","volume":"871","author":"AV Kel\u2019manov","year":"2018","unstructured":"Kel\u2019manov, A.V., Pyatkin, A.V., Khamidullin, S.A., Khandeev, V.I., Shenmaier, V.V., Shamardin Y.V.: An approximation polynomial algorithm for a problem of searching for the longest subsequence in a finite sequence of points in euclidean space. Communications in Computer and Information Science 871, 120\u2013130 (2018)","journal-title":"Communications in Computer and Information Science"},{"issue":"5","key":"9623_CR27","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":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-019-09623-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-019-09623-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-019-09623-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T18:51:42Z","timestamp":1694717502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-019-09623-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,21]]},"references-count":27,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["9623"],"URL":"https:\/\/doi.org\/10.1007\/s10472-019-09623-z","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,21]]},"assertion":[{"value":"21 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1007%2FS10472-019-09623-Z', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid884' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:884', '*');; return false;" style='text-decoration: none; '>Idea </a> <a style='color: white;' href='#diffid884'><sup>1</sup></a></div><div><a href='#diffid119' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:119', '*');; return false;" style='text-decoration: none; '>idea </a> <a style='color: white;' href='#diffid119'><sup>1</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>