Pages that link to "Item:Q898299"
From MaRDI portal
The following pages link to New and efficient DCA based algorithms for minimum sum-of-squares clustering (Q898299):
Displaying 31 items.
- Fuzzy granular gravitational clustering algorithm for multivariate data (Q506340) (← links)
- A DC optimization-based clustering technique for edge detection (Q519782) (← links)
- An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
- Self-organizing maps by difference of convex functions optimization (Q736509) (← links)
- Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms (Q889303) (← links)
- Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model (Q1642987) (← links)
- New diagonal bundle method for clustering problems in large data sets (Q1694910) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique (Q1756799) (← links)
- K-means clustering via a nonconvex optimization approach (Q2117651) (← links)
- Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation (Q2163851) (← links)
- A new efficient algorithm based on DC programming and DCA for clustering (Q2385500) (← links)
- Minimizing differences of convex functions with applications to facility location and clustering (Q2401517) (← links)
- On strategies to fix degenerate \(k\)-means solutions (Q2403298) (← links)
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems (Q2416961) (← links)
- Optimization based DC programming and DCA for hierarchical clustering (Q2643938) (← links)
- DC Programming and DCA for General DC Programs (Q3192952) (← links)
- Clustering and multifacility location with constraints via distance function penalty methods and dc programming (Q4646536) (← links)
- Solving a continuous multifacility location problem by DC algorithms (Q5038184) (← links)
- A universal rank approximation method for matrix completion (Q5097888) (← links)
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering (Q5106412) (← links)
- DC optimization for constructing discrete Sugeno integrals and learning nonadditive measures (Q5151517) (← links)
- Block Clustering Based on Difference of Convex Functions (DC) Programming and DC Algorithms (Q5378276) (← links)
- Efficient Nonnegative Matrix Factorization by DC Programming and DCA (Q5380443) (← links)
- Sparse Covariance Matrix Estimation by DCA-Based Algorithms (Q5380866) (← links)
- (Q5866396) (← links)
- Semi-supervised \(k\)-means clustering via DC programming approach (Q6134046) (← links)
- A novel optimization approach towards improving separability of clusters (Q6164339) (← links)
- Open issues and recent advances in DC programming and DCA (Q6200375) (← links)
- A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering (Q6488346) (← links)
- DCA for Gaussian kernel support vector machines with feature selection (Q6629042) (← links)
