A method for searching for a globally optimal k-partition of higher-dimensional datasets
From MaRDI portal
Publication:6568951
Recommendations
- 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
- A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set
- Set partition by globally optimized cluster seed points
- Interpretation and optimization of the \(k\)-means algorithm.
- Global optimality in k-means clustering
Cites work
- A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem
- A deterministic approach to global box-constrained optimization
- A global optimization technique for checking parametric robustness
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
- A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set
- A univariate global search working with a set of Lipschitz constants for the first derivative
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
- An approach to cluster separability in a partition
- 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
- Cluster Analysis and Applications
- DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization
- Fast modified global \(k\)-means algorithm for incremental cluster construction
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global optimization. Scientific and engineering case studies
- Globally-biased disimpl algorithm for expensive global optimization
- Incremental method for multiple line detection problem -- iterative reweighted approach
- Introduction to clustering large and high-dimensional data.
- Lipschitz global optimization methods in control problems
- Lipschitz optimization methods for fitting a sum of damped sinusoids to a series of observations
- Lipschitzian optimization without the Lipschitz constant
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- One-dimensional P-algorithm with convergence rate \(O(n^{-3+\delta})\) for smooth functions
- PSwarm: a hybrid solver for linearly constrained global derivative-free optimization
- Parallel global optimization on GPU
- Partitional clustering via nonsmooth optimization. Clustering via optimization
- Simplicial global optimization
- Spectral clustering with eigenvector selection
- Stochastic global optimization.
- The DIRECT algorithm: 25 years later
- The adaptation of the \(k\)-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm.
- Three points method for searching the best least absolute deviations plane
- Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering
This page was built for publication: A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568951)
