A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem
type: Item
instance of: scholarly article
title: A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem
author: Rudolf Scitovski
author: Kristian Sabo
published in: Advances in Data Analysis and Classification. ADAC
publication date: 2021-06-28T00:00:00Z
Mathematics Subject Classification ID: 62H30
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C56
Mathematics Subject Classification ID: 91C20
zbMATH DE Number: 7363866
zbMATH Keywords: multiple generalized circles
zbMATH Keywords: the detection problem
zbMATH Keywords: modified \(k\)-means
zbMATH Keywords: \texttt{DBSCAN}
zbMATH Keywords: incremental algorithm
describes a project that uses: DIRECT
describes a project that uses: Mathematica
describes a project that uses: SIGOA
describes a project that uses: SymDIRECT
MaRDI profile type: Publication
full work available at URL: s11634-020-00385-9
OpenAlex ID: W3005790651
cites work: Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
cites work: Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
cites work: Q4490109
cites work: Incomplete total least squares
cites work: Circular and Linear Regression
cites work: Q4868581
cites work: A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
cites work: Introduction to nonlinear and global optimization
cites work: Q4889854
cites work: Lipschitzian optimization without the Lipschitz constant
cites work: Q3444817
cites work: Total Least Squares: State-of-the-Art Regression in Numerical Analysis
cites work: Simplicial Global Optimization
cites work: Interpretation and optimization of the \(k\)-means algorithm.
cites work: An approach to cluster separability in a partition
cites work: One-dimensional center-based l 1-clustering method
cites work: Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem
cites work: Q3321259
cites work: Q3378484
cites work: Q3514009
cites work: Density-ratio based clustering for discovering clusters with varying densities
DOI: 10.1007/S11634-020-00385-9
description: scientific article; zbMATH DE number 7363866