Pages that link to "Item:Q2385500"

The following pages link to A new efficient algorithm based on DC programming and DCA for clustering (Q2385500):

Displaying 33 items.

• DCA based algorithms for multiple sequence alignment (MSA) (Q301241) (← links)
• DC approximation approaches for sparse optimization (Q319281) (← links)
• Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms (Q477981) (← links)
• DCA based algorithms for feature selection in multi-class support vector machine (Q513636) (← links)
• A new linearization method for generalized linear multiplicative programming (Q622153) (← links)
• An intelligent multi-criteria optimization method for quick and market-oriented textile material design (Q652684) (← links)
• An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
• A branch and reduce approach for solving a class of low rank d.c. programs (Q732158) (← links)
• Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms (Q889303) (← links)
• Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm (Q890292) (← links)
• New and efficient DCA based algorithms for minimum sum-of-squares clustering (Q898299) (← 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)
• Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering (Q1749775) (← links)
• A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique (Q1756799) (← links)
• An incremental bundle method for portfolio selection problem under second-order stochastic dominance (Q2200800) (← links)
• A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems (Q2307744) (← links)
• Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming (Q2338781) (← links)
• Binary classification via spherical separator by DC programming and DCA (Q2393067) (← 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 DC programming approach for feature selection in support vector machines learning (Q2442767) (← links)
• The Confrontation of Two Clustering Methods in Portfolio Management: Ward’s Method Versus DCA Method (Q3192958) (← links)
• Clustering and multifacility location with constraints via distance function penalty methods and dc programming (Q4646536) (← links)
• Qualitative properties of the minimum sum-of-squares clustering problem (Q5121778) (← 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)
• A DC Programming Approach for Finding Communities in Networks (Q5383809) (← links)
• (Q5866396) (← links)
• A novel optimization approach towards improving separability of clusters (Q6164339) (← links)
• A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program (Q6175368) (← links)
• Open issues and recent advances in DC programming and DCA (Q6200375) (← links)