Pages that link to "Item:Q936447"

The following pages link to Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems (Q936447):

Displaying 29 items.

• Heuristics for the time dependent team orienteering problem: application to tourist route planning (Q337623) (← links)
• Interpretation and optimization of the \(k\)-means algorithm. (Q464720) (← links)
• Fast global \(k\)-means clustering based on local geometrical information (Q497555) (← links)
• Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions (Q609175) (← links)
• Fast modified global \(k\)-means algorithm for incremental cluster construction (Q621088) (← links)
• Weight selection in \(W-k\)-means algorithm with an application in color image segmentation (Q651544) (← links)
• An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
• New and efficient DCA based algorithms for minimum sum-of-squares clustering (Q898299) (← links)
• Fast global \(k\)-means clustering using cluster membership and inequality (Q962787) (← links)
• New diagonal bundle method for clustering problems in large data sets (Q1694910) (← links)
• A new method for solving supervised data classification problems (Q1723858) (← links)
• The global \(k\)-means clustering analysis based on multi-granulations nearness neighborhood (Q1948567) (← links)
• A heuristic algorithm for solving the minimum sum-of-squares clustering problems (Q2018474) (← links)
• A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem (Q2036141) (← links)
• A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks (Q2053830) (← links)
• K-means clustering via a nonconvex optimization approach (Q2117651) (← links)
• An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms (Q2244241) (← links)
• \(K\)-means cloning: adaptive spherical \(K\)-means clustering (Q2283822) (← links)
• An incremental clustering algorithm based on hyperbolic smoothing (Q2340498) (← links)
• Nonsmooth nonconvex optimization approach to clusterwise linear regression problems (Q2355817) (← links)
• Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems (Q2416961) (← links)
• Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem (Q2423794) (← links)
• The hyperbolic smoothing clustering method (Q2654237) (← links)
• The use of the hyperbolic smoothing clustering algorithm in taxonomy of macroalgae (Q3194697) (← links)
• Decomposition/Aggregation K-means for Big Data (Q4965129) (← links)
• Qualitative properties of the minimum sum-of-squares clustering problem (Q5121778) (← links)
• A novel fast heuristic to handle large-scale shape clustering (Q5222322) (← links)
• Comments on: Optimization and data mining in medicine (Q5966277) (← links)
• A novel optimization approach towards improving separability of clusters (Q6164339) (← links)