Pages that link to "Item:Q5395696"

The following pages link to The effectiveness of lloyd-type methods for the k-means problem (Q5395696):

Displaying 50 items.

• Quantile-based clustering (Q107146) (← links)
• A bad instance for \texttt{k-means++} (Q393129) (← links)
• The planar \(k\)-means problem is NP-hard (Q441888) (← links)
• Guaranteed clustering and biclustering via semidefinite programming (Q463740) (← links)
• Center-based clustering under perturbation stability (Q763489) (← links)
• Variational learning of a Dirichlet process of generalized Dirichlet distributions for simultaneous clustering and feature selection (Q888568) (← links)
• NP-hardness of Euclidean sum-of-squares clustering (Q1009338) (← links)
• Simultaneous variable weighting and determining the number of clusters -- a weighted Gaussian means algorithm (Q1640944) (← links)
• Probably certifiably correct \(k\)-means clustering (Q1675259) (← links)
• Feature-weighted clustering with inner product induced norm based dissimilarity measures: an optimization perspective (Q1697916) (← links)
• Discrepancy minimizing spectral clustering (Q1752470) (← links)
• Convex programming based spectral clustering (Q2051294) (← links)
• On perturbation resilience of non-uniform \(k\)-center (Q2072096) (← links)
• The approximation algorithm based on seeding method for functional \(k\)-means problem (Q2076447) (← links)
• The bi-criteria seeding algorithms for two variants of \(k\)-means problem (Q2082186) (← links)
• An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194) (← links)
• Approximation algorithm for spherical \(k\)-means problem with penalty (Q2086912) (← links)
• K-means clustering via a nonconvex optimization approach (Q2117651) (← links)
• A refined approximation for Euclidean \(k\)-means (Q2122798) (← links)
• Regularity-based spectral clustering and mapping the Fiedler-carpet (Q2148856) (← links)
• Oblivious sampling with applications to two-party \(k\)-means clustering (Q2188971) (← links)
• Global optimality in \(k\)-means clustering (Q2195470) (← links)
• Good (K-means) clusterings are unique (up to small perturbations) (Q2274925) (← links)
• Optimizing cluster structures with inner product induced norm based dissimilarity measures: theoretical development and convergence analysis (Q2282276) (← links)
• The seeding algorithm for \(k\)-means problem with penalties (Q2292125) (← links)
• A unified framework for clustering constrained data without locality property (Q2300724) (← links)
• The seeding algorithms for spherical \(k\)-means clustering (Q2307745) (← links)
• \(k\)-means++ under approximation stability (Q2348259) (← links)
• Fast indefinite multi-point (IMP) clustering (Q2363687) (← links)
• Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
• Convex optimization for the planted \(k\)-disjoint-clique problem (Q2436653) (← links)
• An investigation on support vector clustering for big data in quantum paradigm (Q2677266) (← links)
• Parallel Algorithms for Nearest Neighbor Search Problems in High Dimensions (Q2830635) (← links)
• Core-Sets: Updated Survey (Q3297370) (← links)
• Approximating Spectral Clustering via Sampling: A Review (Q3297374) (← links)
• The Planar k-Means Problem is NP-Hard (Q3605504) (← links)
• Local Search Yields a PTAS for $k$-Means in Doubling Metrics (Q4634026) (← links)
• Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032) (← links)
• (Q4636989) (← links)
• An efficient <i>k</i>‐means‐type algorithm for clustering datasets with incomplete records (Q4970437) (← links)
• Approximate Clustering with Same-Cluster Queries (Q4993306) (← links)
• (Q5091167) (← links)
• Stability and Recovery for Independence Systems (Q5111712) (← links)
• Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms (Q5117377) (← links)
• (Q5149243) (← links)
• The Parallel Seeding Algorithm for k-Means Problem with Penalties (Q5149519) (← links)
• Generalized quasirandom properties of expanding graph sequences (Q5216273) (← links)
• The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems (Q5737722) (← links)
• Partitioning Well-Clustered Graphs: Spectral Clustering Works! (Q5737808) (← links)
• (Q6062155) (← links)