Pages that link to "Item:Q621088"

The following pages link to Fast modified global \(k\)-means algorithm for incremental cluster construction (Q621088):

Displaying 16 items.

• Interpretation and optimization of the \(k\)-means algorithm. (Q464720) (← links)
• Fast global \(k\)-means clustering based on local geometrical information (Q497555) (← links)
• An incremental piecewise linear classifier based on polyhedral conic separation (Q890307) (← links)
• Incremental method for multiple line detection problem -- iterative reweighted approach (Q1998212) (← links)
• A heuristic algorithm for solving the minimum sum-of-squares clustering problems (Q2018474) (← links)
• Unsupervised learning by cluster quality optimization (Q2195427) (← links)
• An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms (Q2244241) (← links)
• The adaptation of the \(k\)-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm. (Q2280464) (← 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)
• Qualitative properties of the minimum sum-of-squares clustering problem (Q5121778) (← links)
• A novel fast heuristic to handle large-scale shape clustering (Q5222322) (← links)
• Center-based l1–clustering method (Q5494418) (← links)
• A novel optimization approach towards improving separability of clusters (Q6164339) (← links)