New and efficient DCA based algorithms for minimum sum-of-squares clustering

DOI10.1016/j.patcog.2013.07.012zbMath1326.68225OpenAlexW1989830207MaRDI QIDQ898299

Le Hoai Minh, Tao Pham Dinh, Hoai An Le Thi

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

zbMATH Keywords

DCAclusteringcombinatorial optimizationGaussian kernelDC programmingexact penaltynonsmooth nonconvex programmingMSSC

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (24)

Solving a continuous multifacility location problem by DC algorithms ⋮ Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model ⋮ DC Programming and DCA for General DC Programs ⋮ Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation ⋮ On strategies to fix degenerate \(k\)-means solutions ⋮ A universal rank approximation method for matrix completion ⋮ Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems ⋮ Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms ⋮ Unnamed Item ⋮ SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering ⋮ Semi-supervised \(k\)-means clustering via DC programming approach ⋮ New diagonal bundle method for clustering problems in large data sets ⋮ A novel optimization approach towards improving separability of clusters ⋮ Open issues and recent advances in DC programming and DCA ⋮ Efficient Nonnegative Matrix Factorization by DC Programming and DCA ⋮ Sparse Covariance Matrix Estimation by DCA-Based Algorithms ⋮ DC optimization for constructing discrete Sugeno integrals and learning nonadditive measures ⋮ Fuzzy granular gravitational clustering algorithm for multivariate data ⋮ Clustering and multifacility location with constraints via distance function penalty methods and dc programming ⋮ DC programming and DCA: thirty years of developments ⋮ A DC optimization-based clustering technique for edge detection ⋮ A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique ⋮ Self-organizing maps by difference of convex functions optimization ⋮ K-means clustering via a nonconvex optimization approach

Cites Work

• Unnamed Item
• Unnamed Item
• A majorization-minimization approach to the sparse generalized eigenvalue problem
• Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms
• Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
• On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• NP-hardness of Euclidean sum-of-squares clustering
• A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
• Cluster analysis and mathematical programming
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• Variable neighborhood search
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Support-vector networks
• A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
• A survey of kernel and spectral methods for clustering
• A new efficient algorithm based on DC programming and DCA for clustering
• A DC programming approach for feature selection in support vector machines learning
• Theoretical foundations of the potential function method in pattern recognition learning
• A global optimization RLT-based approach for solving the hard clustering problem
• Optimization based DC programming and DCA for hierarchical clustering
• DC Programming and DCA for General DC Programs
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• The Concave-Convex Procedure
• On ψ-Learning
• An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
• A PAC-Bayesian margin bound for linear classifiers
• Learning mixtures of arbitrary gaussians
• Integer Programming and the Theory of Grouping
• Multicategory ψ-Learning

This page was built for publication: New and efficient DCA based algorithms for minimum sum-of-squares clustering