Pages that link to "Item:Q3605504"

The following pages link to The Planar k-Means Problem is NP-Hard (Q3605504):

Displaying 47 items.

• Clustering through continuous facility location problems (Q346248) (← links)
• A bad instance for \texttt{k-means++} (Q393129) (← links)
• The planar \(k\)-means problem is NP-hard (Q441888) (← links)
• A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets (Q463361) (← links)
• Improved and simplified inapproximability for \(k\)-means (Q506167) (← links)
• An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
• Boolean autoencoders and hypercube clustering complexity (Q690669) (← links)
• Hardness of \(k\)-anonymous microaggregation (Q1983125) (← links)
• An efficient \(K\)-means clustering algorithm for tall data (Q1987188) (← links)
• Temporally consistent tone mapping of images and video using optimal \(K\)-means clustering (Q2014481) (← links)
• A dual reformulation and solution framework for regularized convex clustering problems (Q2029898) (← links)
• Convex programming based spectral clustering (Q2051294) (← links)
• Optimality of spectral clustering in the Gaussian mixture model (Q2054516) (← links)
• An approximation algorithm for the spherical \(k\)-means problem with outliers by local search (Q2084618) (← links)
• Quantum-inspired ant lion-optimized hybrid fuzzy c-means method for fuzzy clustering and image segmentation (Q2100502) (← links)
• Scenario reduction revisited: fundamental limits and guarantees (Q2118076) (← links)
• An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space (Q2165794) (← links)
• Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering (Q2189394) (← links)
• Global optimality in \(k\)-means clustering (Q2195470) (← links)
• Approximation algorithms for spherical \(k\)-means problem using local search scheme (Q2220852) (← links)
• Parameterized \(k\)-clustering: tractability island (Q2221803) (← links)
• Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems (Q2261720) (← links)
• When do birds of a feather flock together? \(k\)-means, proximity, and conic programming (Q2288194) (← links)
• On strategies to fix degenerate \(k\)-means solutions (Q2403298) (← links)
• Local search approximation algorithms for the \(k\)-means problem with penalties (Q2420650) (← links)
• Optimising sum-of-squares measures for clustering multisets defined over a metric space (Q2444542) (← links)
• On the complexity of redescription mining (Q2680177) (← links)
• Dynamic parameters in sequential decision making (Q2682336) (← links)
• Core-Sets: Updated Survey (Q3297370) (← links)
• On the Hardness of Energy Minimisation for Crystal Structure Prediction (Q3297788) (← links)
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
• (Q4558500) (← links)
• (Q4633019) (← links)
• Local Search Yields a PTAS for $k$-Means in Doubling Metrics (Q4634026) (← links)
• EMERGING CLUSTER ANALYSIS OF SCI JOURNALS AND ITS EFFICIENCY (Q4911500) (← links)
• A Performance Guarantee for Spectral Clustering (Q4999362) (← links)
• Local Versions of Sum-of-Norms Clustering (Q5048022) (← links)
• A Distance-Preserving Matrix Sketch (Q5057218) (← links)
• The Ratio-Cut Polytope and K-Means Clustering (Q5062119) (← links)
• On Cluster-Aware Supervised Learning: Frameworks, Convergent Algorithms, and Applications (Q5084663) (← links)
• (Q5743481) (← links)
• Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model (Q5868965) (← links)
• Noisy, Greedy and Not so Greedy k-Means++ (Q5874485) (← links)
• Effective Heuristic Techniques for Combined Robust Clustering Problem (Q6053497) (← links)
• Strategic oscillation for the balanced minimum sum-of-squares clustering problem (Q6149519) (← links)
• Structured filtering (Q6172384) (← links)
• Local search yields a PTAS for fixed-dimensional \(k\)-means problem with penalties (Q6566778) (← links)