Pages that link to "Item:Q540436"

The following pages link to \(k\)-means requires exponentially many iterations even in the plane (Q540436):

Displaying 20 items.

• Exact algorithms for size constrained 2-clustering in the plane (Q288798) (← links)
• A bad instance for \texttt{k-means++} (Q393129) (← links)
• \(k\)-means requires exponentially many iterations even in the plane (Q540436) (← links)
• On the minimum of the mean-squared error in 2-means clustering (Q1624878) (← links)
• Iterative ensemble normalized cuts (Q1669788) (← links)
• An LP-based \(k\)-means algorithm for balancing weighted point sets (Q1694906) (← links)
• On the complexity of clustering with relaxed size constraints in fixed dimension (Q1704856) (← links)
• An efficient \(K\)-means clustering algorithm for tall data (Q1987188) (← links)
• An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194) (← links)
• The seeding algorithm for spherical \(k\)-means clustering with penalties (Q2082212) (← links)
• A refined approximation for Euclidean \(k\)-means (Q2122798) (← links)
• When do birds of a feather flock together? \(k\)-means, proximity, and conic programming (Q2288194) (← links)
• Construction of the similarity matrix for the spectral clustering method: numerical experiments (Q2309260) (← links)
• Fast indefinite multi-point (IMP) clustering (Q2363687) (← links)
• On the Complexity of Clustering with Relaxed Size Constraints (Q2830056) (← links)
• A Bad Instance for k-Means++ (Q3010415) (← links)
• Local Search Yields a PTAS for $k$-Means in Doubling Metrics (Q4634026) (← links)
• Good Clusterings Have Large Volume (Q4971590) (← links)
• Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms (Q5117377) (← links)
• Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems (Q5283361) (← links)