New and efficient DCA based algorithms for minimum sum-of-squares clustering
From MaRDI portal
Publication:898299
DOI10.1016/J.PATCOG.2013.07.012zbMATH Open1326.68225OpenAlexW1989830207MaRDI QIDQ898299FDOQ898299
Authors: Le Hoai Minh, Le Thi Hoai An, Pham Dinh Tao 
Publication date: 8 December 2015
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2013.07.012
Recommendations
- A new efficient algorithm based on DC programming and DCA for clustering
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- Minimum sum of squares clustering in a low dimensional space
- On some incremental algorithms for the minimum sum-of-squares clustering problem. II: Incremental DC algorithms
- Less is more: simple algorithms for the minimum sum of squares clustering problem
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- A scatter search approach for the minimum sum-of-squares clustering problem
clusteringcombinatorial optimizationDCAGaussian kernelDC programmingexact penaltynonsmooth nonconvex programmingMSSC
Learning and adaptive systems in artificial intelligence (68T05) Applications of mathematical programming (90C90)
Cites Work
- Title not available (Why is that?)
- Support-vector networks
- The Concave-Convex Procedure
- NP-hardness of Euclidean sum-of-squares clustering
- Title not available (Why is that?)
- A majorization-minimization approach to the sparse generalized eigenvalue problem
- Theoretical foundations of the potential function method in pattern recognition learning
- On ψ-Learning
- Cluster analysis and mathematical programming
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- Variable neighborhood search
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- A survey of kernel and spectral methods for clustering
- Multicategory ψ-Learning
- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- Integer Programming and the Theory of Grouping
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- A new efficient algorithm based on DC programming and DCA for clustering
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A DC programming approach for feature selection in support vector machines learning
- Optimization based DC programming and DCA for hierarchical clustering
- DC Programming and DCA for General DC Programs
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- A global optimization RLT-based approach for solving the hard clustering problem
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- A PAC-Bayesian margin bound for linear classifiers
- Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms
- Learning mixtures of arbitrary gaussians
- Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
Cited In (30)
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- A novel optimization approach towards improving separability of clusters
- DC Programming and DCA for General DC Programs
- DC programming and DCA: thirty years of developments
- On strategies to fix degenerate \(k\)-means solutions
- A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique
- An improved column generation algorithm for minimum sum-of-squares clustering
- Semi-supervised \(k\)-means clustering via DC programming approach
- Clustering and multifacility location with constraints via distance function penalty methods and dc programming
- Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model
- Minimizing differences of convex functions with applications to facility location and clustering
- A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
- DC optimization for constructing discrete Sugeno integrals and learning nonadditive measures
- Self-organizing maps by difference of convex functions optimization
- Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation
- K-means clustering via a nonconvex optimization approach
- Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
- DCA for Gaussian kernel support vector machines with feature selection
- Open issues and recent advances in DC programming and DCA
- Solving a continuous multifacility location problem by DC algorithms
- Efficient Nonnegative Matrix Factorization by DC Programming and DCA
- New diagonal bundle method for clustering problems in large data sets
- A new efficient algorithm based on DC programming and DCA for clustering
- Fuzzy granular gravitational clustering algorithm for multivariate data
- A DC optimization-based clustering technique for edge detection
- Optimization based DC programming and DCA for hierarchical clustering
- A universal rank approximation method for matrix completion
- Sparse Covariance Matrix Estimation by DCA-Based Algorithms
- Title not available (Why is that?)
This page was built for publication: New and efficient DCA based algorithms for minimum sum-of-squares clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898299)
