Pages that link to "Item:Q4557531"

The following pages link to A local search approximation algorithm for k-means clustering (Q4557531):

Displaying 22 items.

• Clustering through continuous facility location problems (Q346248) (← links)
• Improved results on geometric hitting set problems (Q603882) (← links)
• An efficient \(K\)-means clustering algorithm for tall data (Q1987188) (← links)
• An improved Bregman \(k\)-means++ algorithm via local search (Q2019501) (← links)
• Improved local search algorithms for Bregman \(k\)-means and its variants (Q2084627) (← links)
• K-means clustering via a nonconvex optimization approach (Q2117651) (← links)
• Neighborhood granules and rough rule-base in tracking (Q2311233) (← links)
• Heterogeneous distributed big data clustering on sparse grids (Q2312425) (← links)
• Eigenvalues of quaternion tensors with applications to color video processing (Q2680318) (← links)
• New algorithms for a simple measure of network partitioning (Q2700788) (← links)
• Approximating Spectral Clustering via Sampling: A Review (Q3297374) (← links)
• Handling Biological Complexity Using Kron Reduction (Q4558868) (← links)
• (Q4633019) (← links)
• A general framework for efficient clustering of large datasets based on activity detection (Q4969747) (← links)
• Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering (Q5002733) (← links)
• The Ratio-Cut Polytope and K-Means Clustering (Q5062119) (← links)
• Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction (Q5075781) (← links)
• (Q5091167) (← links)
• A minimum spanning tree equipartition algorithm for microaggregation (Q5130200) (← links)
• Dimensionality-Dependent Generalization Bounds for <i>k</i>-Dimensional Coding Schemes (Q5380581) (← links)
• FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)
• On the discrepancy between Kleinberg's clustering axioms and \(k\)-means clustering algorithm behavior (Q6134326) (← links)