Pages that link to "Item:Q3638866"
From MaRDI portal
The following pages link to Adaptive Sampling for k-Means Clustering (Q3638866):
Displaying 25 items.
- Tight lower bound instances for \(k\)-means++ in two dimensions (Q284583) (← links)
- A bad instance for \texttt{k-means++} (Q393129) (← links)
- A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems (Q486976) (← links)
- Graph summarization with quality guarantees (Q1741300) (← links)
- A bi-criteria analysis for fuzzy \(C\)-means problem (Q2039654) (← 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)
- Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy (Q2091111) (← links)
- The seeding algorithm for \(k\)-means problem with penalties (Q2292125) (← links)
- The seeding algorithms for spherical \(k\)-means clustering (Q2307745) (← links)
- \(k\)-means++ under approximation stability (Q2348259) (← links)
- On the \(k\)-means/median cost function (Q2671798) (← links)
- A Bad Instance for k-Means++ (Q3010415) (← links)
- Core-Sets: Updated Survey (Q3297370) (← links)
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
- KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation (Q4629536) (← links)
- Approximate Clustering with Same-Cluster Queries (Q4993306) (← links)
- (Q5002622) (← links)
- Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction (Q5075781) (← links)
- Semi-supervised k-means++ (Q5106957) (← links)
- The Parallel Seeding Algorithm for k-Means Problem with Penalties (Q5149519) (← links)
- Noisy, Greedy and Not so Greedy k-Means++ (Q5874485) (← links)
- One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering (Q6046948) (← links)
- Approximation Algorithms for Matroid and Knapsack Means Problems (Q6053494) (← links)
- The provably good parallel seeding algorithms for the <i>k</i>‐means problem with penalties (Q6092504) (← links)