Pages that link to "Item:Q5212843"

The following pages link to Performance of Johnson-Lindenstrauss transform for <i>k</i> -means and <i>k</i> -medians clustering (Q5212843):

Displaying 10 items.

• A refined approximation for Euclidean \(k\)-means (Q2122798) (← links)
• Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument (Q2185843) (← links)
• Better guarantees for \(k\)-median with service installation costs (Q2672628) (← links)
• Approximating Spectral Clustering via Sampling: A Review (Q3297374) (← links)
• An improved primal-dual approximation algorithm for the <i>k</i>-means problem with penalties (Q5048009) (← links)
• On coresets for support vector machines (Q5919115) (← links)
• Dimension reduction for maximum matchings and the fastest mixing Markov chain (Q6117114) (← links)
• k-means-g*: accelerating \(k\)-means clustering algorithm utilizing primitive geometric concepts (Q6150442) (← links)
• Fast Metric Embedding into the Hamming Cube (Q6154196) (← links)
• Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers (Q6173264) (← links)