Pages that link to "Item:Q2117651"

The following pages link to K-means clustering via a nonconvex optimization approach (Q2117651):

Displaying 13 items.

• Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal (Q998835) (← links)
• Optimizing MSE for clustering with balanced size constraints (Q2335035) (← links)
• Self-learning \(K\)-means clustering: a global optimization approach (Q2392762) (← links)
• Minimizing differences of convex functions with applications to facility location and clustering (Q2401517) (← links)
• Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems (Q2416961) (← links)
• A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems (Q2572256) (← links)
• A global optimization RLT-based approach for solving the hard clustering problem (Q2576449) (← links)
• (Q3776414) (← links)
• Improved Conic Reformulations for $K$-means Clustering (Q4555446) (← links)
• Mechanism and a new algorithm for nonconvex clustering (Q5107735) (← links)
• Spherical k-Means++ Clustering (Q5268447) (← links)
• Semi-supervised \(k\)-means clustering via DC programming approach (Q6134046) (← links)
• A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering (Q6488346) (← links)