{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T20:17:38Z","timestamp":1767212258633,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,2,12]],"date-time":"2020-02-12T00:00:00Z","timestamp":1581465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,12]],"date-time":"2020-02-12T00:00:00Z","timestamp":1581465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004488","name":"Hrvatska Zaklada za Znanost","doi-asserted-by":"publisher","award":["IP-2016-06-6545","IP-2016-06-8350"],"award-info":[{"award-number":["IP-2016-06-6545","IP-2016-06-8350"]}],"id":[{"id":"10.13039\/501100004488","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Data Anal Classif"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s11634-020-00385-9","type":"journal-article","created":{"date-parts":[[2020,2,12]],"date-time":"2020-02-12T13:02:53Z","timestamp":1581512573000},"page":"83-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["A combination of k-means and DBSCAN algorithm for solving the multiple generalized circle detection problem"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7386-5991","authenticated-orcid":false,"given":"Rudolf","family":"Scitovski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1787-3161","authenticated-orcid":false,"given":"Kristian","family":"Sabo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,12]]},"reference":[{"key":"385_CR1","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1016\/j.patcog.2012.09.020","volume":"46","author":"C Akinlar","year":"2013","unstructured":"Akinlar C, Topal C (2013) Edcircles: a real-time circle detector with a false detection control. Pattern Recognit 46:725\u2013740","journal-title":"Pattern Recognit"},{"key":"385_CR2","doi-asserted-by":"publisher","first-page":"3192","DOI":"10.1016\/j.patcog.2008.04.004","volume":"41","author":"AM Bagirov","year":"2008","unstructured":"Bagirov AM (2008) Modified global $$k$$-means algorithm for minimum sum-of-squares clustering problems. Pattern Recognit 41:3192\u20133199","journal-title":"Pattern Recognit"},{"key":"385_CR3","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.ejor.2013.02.059","volume":"229","author":"AM Bagirov","year":"2013","unstructured":"Bagirov AM, Ugon J, Mirzayeva H (2013) Nonsmooth nonconvex optimization approach to clusterwise linear regression problems. Eur J Oper Res 229:132\u2013142","journal-title":"Eur J Oper Res"},{"key":"385_CR4","volume-title":"Fuzzy models and algorithms for pattern recognition and image processing","author":"JC Bezdek","year":"2005","unstructured":"Bezdek JC, Keller J, Krisnapuram R, Pal NR (2005) Fuzzy models and algorithms for pattern recognition and image processing. Springer, New York"},{"key":"385_CR5","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.datak.2006.01.013","volume":"60","author":"D Birant","year":"2007","unstructured":"Birant D, Kut A (2007) ST-DBSCAN: an algorithm for clustering spatial-temporal data. Data Knowl Eng 60:208\u2013221","journal-title":"Data Knowl Eng"},{"key":"385_CR6","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s002110050402","volume":"81","author":"K Br\u00fcntjen","year":"1999","unstructured":"Br\u00fcntjen K, Sp\u00e4th H (1999) Incomplete total least squares. Numer Math 81:521\u2013538","journal-title":"Numer Math"},{"key":"385_CR7","series-title":"Monographs on statistics and applied probability","doi-asserted-by":"publisher","DOI":"10.1201\/EBK1439835906","volume-title":"Circular and linear regression: fitting circles and lines by least squares","author":"N Chernov","year":"2010","unstructured":"Chernov N (2010) Circular and linear regression: fitting circles and lines by least squares, vol 117. Monographs on statistics and applied probability. Chapman & Hall\/CRC, London"},{"key":"385_CR8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971200","volume-title":"Numerical methods for unconstrained optimization and nonlinear equations","author":"JJ Dennis","year":"1996","unstructured":"Dennis JJ, Schnabel R (1996) Numerical methods for unconstrained optimization and nonlinear equations. SIAM, Philadelphia"},{"key":"385_CR9","unstructured":"Ester M, Kriegel H, Sander J (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: 2nd international conference on knowledge discovery and data mining (KDD-96), Portland, pp 226\u2013231"},{"key":"385_CR10","unstructured":"Finkel DE (2003) DIRECT optimization algorithm user guide. Center for Research in Scientific Computation. North Carolina State University. http:\/\/www4.ncsu.edu\/~ctk\/Finkel_Direct\/DirectUserGuide_pdf.pdf"},{"key":"385_CR11","unstructured":"Gablonsky JM (2001) Direct version 2.0. Technical report, Center for Research in Scientific Computation. North Carolina State University"},{"key":"385_CR12","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1016\/j.patcog.2016.06.031","volume":"60","author":"R Grbi\u0107","year":"2016","unstructured":"Grbi\u0107 R, Grahovac D, Scitovski R (2016) A method for solving the multiple ellipses detection problem. Pattern Recognit 60:824\u2013834","journal-title":"Pattern Recognit"},{"key":"385_CR13","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1007\/s10898-012-0020-3","volume":"57","author":"R Grbi\u0107","year":"2013","unstructured":"Grbi\u0107 R, Nyarko EK, Scitovski R (2013) A modification of the DIRECT method for Lipschitz global optimization for a symmetric function. J Global Optim 57:1193\u20131212","journal-title":"J Global Optim"},{"key":"385_CR14","unstructured":"Griffin G, Holub A, Perona P (2007) Caltech-256 object category database. Technical report, Caltech. http:\/\/authors.library.caltech.edu\/7694S"},{"key":"385_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-88670-1","volume-title":"Introduciton to nonlinear and global optimization","author":"EMT Hendrix","year":"2010","unstructured":"Hendrix EMT, T\u00f3th BG (2010) Introduciton to nonlinear and global optimization. Springer, New York"},{"key":"385_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global optimization: deterministic approach","author":"R Horst","year":"1996","unstructured":"Horst R, Tuy H (1996) Global optimization: deterministic approach, 3rd edn. Springer, Berlin","edition":"3"},{"key":"385_CR17","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00941892","volume":"79","author":"DR Jones","year":"1993","unstructured":"Jones DR, Perttunen CD, Stuckman BE (1993) Lipschitzian optimization without the Lipschitz constant. J Optim Theory Appl 79:157\u2013181","journal-title":"J Optim Theory Appl"},{"key":"385_CR18","volume-title":"Introduction to clustering large and high-dimensional data","author":"J Kogan","year":"2007","unstructured":"Kogan J (2007) Introduction to clustering large and high-dimensional data. Cambridge University Press, New York"},{"key":"385_CR19","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.cageo.2014.09.003","volume":"73","author":"A Morales-Esteban","year":"2014","unstructured":"Morales-Esteban A, Mart\u00ednez-\u00c1lvarez F, Scitovski S, Scitovski R (2014) A fast partitioning algorithm using adaptive Mahalanobis clustering with application to seismic zoning. Comput Geosci 73:132\u2013141","journal-title":"Comput Geosci"},{"key":"385_CR20","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1137\/1036055","volume":"36","author":"Y Nievergelt","year":"1994","unstructured":"Nievergelt Y (1994) Total least squares: state-of-the-art regression in numerical analysis. SIAM Rev 36:258\u2013264","journal-title":"SIAM Rev"},{"key":"385_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-9093-7","volume-title":"Simplicial global optimization","author":"R Paulavi\u010dius","year":"2014","unstructured":"Paulavi\u010dius R, \u017dilinskas J (2014) Simplicial global optimization. Springer, Berlin"},{"key":"385_CR22","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10492-014-0063-5","volume":"59","author":"K Sabo","year":"2014","unstructured":"Sabo K, Scitovski R (2014) Interpretation and optimization of the k-means algorithm. Appl Math 59:391\u2013406","journal-title":"Appl Math"},{"key":"385_CR23","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.ins.2015.02.011","volume":"305","author":"K Sabo","year":"2015","unstructured":"Sabo K, Scitovski R (2015) An approach to cluster separability in a partition. Inf Sci 305:208\u2013218","journal-title":"Inf Sci"},{"key":"385_CR24","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s11590-011-0389-9","volume":"7","author":"K Sabo","year":"2013","unstructured":"Sabo K, Scitovski R, Vazler I (2013) One-dimensional center-based $$l_1$$-clustering method. Optim Lett 7:5\u201322","journal-title":"Optim Lett"},{"key":"385_CR25","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.patrec.2014.09.010","volume":"52","author":"R Scitovski","year":"2014","unstructured":"Scitovski R, Maro\u0161evi\u0107 T (2014) Multiple circle detection based on center-based clustering. Pattern Recognit Lett 52:9\u201316","journal-title":"Pattern Recognit Lett"},{"issue":"1","key":"385_CR26","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10898-019-00743-8","volume":"74","author":"R Scitovski","year":"2019","unstructured":"Scitovski R, Sabo K (2019a) Application of the DIRECT algorithm to searching for an optimal $$k$$-partition of the set A and its application to the multiple circle detection problem. J Global Optim 74(1):63\u201377","journal-title":"J Global Optim"},{"key":"385_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-019-00809-z","author":"R Scitovski","year":"2019","unstructured":"Scitovski R, Sabo K (2019b) DBSCAN-like clustering method for various data densities. Pattern Anal Appl. https:\/\/doi.org\/10.1007\/s10044-019-00809-z","journal-title":"Pattern Anal Appl"},{"key":"385_CR28","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.cageo.2013.06.010","volume":"59","author":"R Scitovski","year":"2013","unstructured":"Scitovski R, Scitovski S (2013) A fast partitioning algorithm and its application to earthquake investigation. Comput Geosci 59:124\u2013131","journal-title":"Comput Geosci"},{"key":"385_CR29","first-page":"17","volume":"29","author":"H Sp\u00e4th","year":"1981","unstructured":"Sp\u00e4th H (1981) Algorithm 48: a fast algorithm for clusterwise linear regression. Computing 29:17\u2013181","journal-title":"Computing"},{"key":"385_CR30","volume-title":"Cluster-formation und analyse","author":"H Sp\u00e4th","year":"1983","unstructured":"Sp\u00e4th H (1983) Cluster-formation und analyse. R. Oldenburg Verlag, M\u00fcnchen"},{"key":"385_CR31","volume-title":"Pattern recognition","author":"S Theodoridis","year":"2009","unstructured":"Theodoridis S, Koutroumbas K (2009) Pattern recognition, 4th edn. Academic Press, Burlington","edition":"4"},{"key":"385_CR32","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/978-3-642-25085-9_76","volume-title":"Progress in pattern recognition, image analysis, computer vision, and applications","author":"JCR Thomas","year":"2011","unstructured":"Thomas JCR (2011) A new clustering algorithm based on k-means using a line segment as prototype. In: Martin CS, Kim S-W (eds) Progress in pattern recognition, image analysis, computer vision, and applications. Springer, Berlin, pp 638\u2013645"},{"key":"385_CR33","doi-asserted-by":"crossref","unstructured":"Vendramin L, Campello RJGB, Hruschka ER (2009) On the comparison of relative clustering validity criteria. In: Proceedings of the SIAM international conference on data mining, SDM 2009, April 30 \u2013 May 2, 2009, Sparks, Nevada, USA SIAM, pp. 733\u2013744","DOI":"10.1137\/1.9781611972795.63"},{"key":"385_CR34","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.compag.2014.10.014","volume":"109","author":"I Vidovi\u0107","year":"2014","unstructured":"Vidovi\u0107 I, Scitovski R (2014) Center-based clustering for line detection and application to crop rows detection. Comput Electron Agric 109:212\u2013220","journal-title":"Comput Electron Agric"},{"key":"385_CR35","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1016\/j.patrec.2009.08.008","volume":"30","author":"P Viswanath","year":"2009","unstructured":"Viswanath P, Babu VS (2009) Rough-DBSCAN: a fast hybrid density based clustering method for large data sets. Pattern Recognit Lett 30:1477\u20131488","journal-title":"Pattern Recognit Lett"},{"key":"385_CR36","unstructured":"Weise T (2008) Global optimization algorithms. Theory and application. http:\/\/www.it-weise.de\/projects\/book.pdf"},{"key":"385_CR37","series-title":"Version 11.0 edition","volume-title":"Mathematica","author":"Wolfram Research I","year":"2016","unstructured":"Wolfram Research I (2016) Mathematica. Version 11.0 edition. Wolfram Research Inc, Champaign, IL"},{"key":"385_CR38","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1016\/j.patcog.2016.07.007","volume":"60","author":"Y Zhu","year":"2016","unstructured":"Zhu Y, Ting KM, Carman MJ (2016) Density-ratio based clustering for discovering clusters with varying densities. Pattern Recognit 60:983\u2013997","journal-title":"Pattern Recognit"}],"container-title":["Advances in Data Analysis and Classification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-020-00385-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11634-020-00385-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-020-00385-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,10]],"date-time":"2021-04-10T06:22:27Z","timestamp":1618035747000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11634-020-00385-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,12]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["385"],"URL":"https:\/\/doi.org\/10.1007\/s11634-020-00385-9","relation":{},"ISSN":["1862-5347","1862-5355"],"issn-type":[{"type":"print","value":"1862-5347"},{"type":"electronic","value":"1862-5355"}],"subject":[],"published":{"date-parts":[[2020,2,12]]},"assertion":[{"value":"20 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}