A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
From MaRDI portal
Publication:2572256
Recommendations
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- An algorithm for clustering based on non-smooth optimization techniques
- An algorithm for minimizing clustering functions
- K-means clustering via a nonconvex optimization approach
- An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms
Cites work
- A Branch and Bound Clustering Algorithm
- A comparison of two dual-based procedures for solving the p-median problem
- A Dynamic Programming Algorithm for Cluster Analysis
- A Method for Minimization of Quasidifferentiable Functions
- A Simplex Method for Function Minimization
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Analysis of global k-means, an incremental heuristic for minimum sum-of-squares clustering
- Automatische Klassifikation
- Cluster analysis and mathematical programming
- Cluster analysis by simulated annealing
- Evaluation of a Branch and Bound Algorithm for Clustering
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3972657 (Why is no real title available?)
- scientific article; zbMATH DE number 3678973 (Why is no real title available?)
- scientific article; zbMATH DE number 3731161 (Why is no real title available?)
- scientific article; zbMATH DE number 50640 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- scientific article; zbMATH DE number 1535760 (Why is no real title available?)
- scientific article; zbMATH DE number 872150 (Why is no real title available?)
- scientific article; zbMATH DE number 1421092 (Why is no real title available?)
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
- UOBYQA: unconstrained optimization by quadratic approximation
- Variable neighborhood decomposition search
- Variable neighborhood search
Cited in
(56)- A formula for multiple classifiers in data mining based on Brandt semigroups
- Cayley graphs as classifiers for data mining: the influence of asymmetries
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
- Comparison of internal clustering validation indices for prototype-based clustering
- New diagonal bundle method for clustering problems in large data sets
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- Optimization problems for machine learning: a survey
- K-means clustering via a nonconvex optimization approach
- Sequential difference-of-convex programming
- An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms
- Proximal bundle methods for nonsmooth DC programming
- An inertial algorithm for DC programming
- An incremental clustering algorithm based on hyperbolic smoothing
- Aggregate codifferential method for nonsmooth DC optimization
- Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- A scatter search approach for the minimum sum-of-squares clustering problem
- Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- The hyperbolic smoothing clustering method
- Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints
- Dynamical gene-environment networks under ellipsoidal uncertainty: set-theoretic regression analysis based on ellipsoidal OR
- An efficient optimization method for solving unsupervised data classification problems
- Internet security applications of Gröbner-Shirshov bases
- Optimization of matrix semirings for classification systems.
- The use of the hyperbolic smoothing clustering algorithm in taxonomy of macroalgae
- scientific article; zbMATH DE number 7403513 (Why is no real title available?)
- An algorithm for clustering based on non-smooth optimization techniques
- OPTIMAL REES MATRIX CONSTRUCTIONS FOR ANALYSIS OF DATA
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
- Qualitative properties of the minimum sum-of-squares clustering problem
- A smoothing alternating minimization-based algorithm for clustering with sum-min of duclidean norms
- scientific article; zbMATH DE number 7416587 (Why is no real title available?)
- An algorithm for minimizing clustering functions
- Optimization approach for clustering datasets with weights
- OPTIMIZATION OF MULTIPLE CLASSIFIERS IN DATA MINING BASED ON STRING REWRITING SYSTEMS
- Codifferential method for minimizing nonsmooth DC functions
- Minimization of the sum of minima of convex functions and its application to clustering
- Rees matrix constructions for clustering of data.
- Internet security applications of the Munn rings
- Comments on: Optimization and data mining in medicine
- Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering
- Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
- A novel optimization approach towards improving separability of clusters
- Fast modified global \(k\)-means algorithm for incremental cluster construction
- An improved column generation algorithm for minimum sum-of-squares clustering
- An inexact proximal linearized DC algorithm with provably terminating inner loop
- On the solution of min-sum-min problems
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Design of hybrids for the minimum sum-of-squares clustering problem
This page was built for publication: A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2572256)
