Pages that link to "Item:Q2978788"

The following pages link to Randomized Dimensionality Reduction for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Means Clustering (Q2978788):

Displaying 21 items.

• Toward a unified theory of sparse dimensionality reduction in Euclidean space (Q496171) (← links)
• Optimal column subset selection for image classification by genetic algorithms (Q1621645) (← links)
• Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics (Q1747733) (← links)
• Fuzzy \(c\)-means and cluster ensemble with random projection for big data clustering (Q1793461) (← links)
• On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms (Q1986965) (← links)
• Dimension reduction for objects composed of vector sets (Q2012154) (← links)
• Quick-means: accelerating inference for K-means by learning fast transforms (Q2051290) (← links)
• Subset selection for matrices with fixed blocks (Q2066125) (← links)
• Parameterized \(k\)-clustering: tractability island (Q2221803) (← links)
• Global and local structure preserving sparse subspace learning: an iterative approach to unsupervised feature selection (Q2416964) (← links)
• Structural conditions for projection-cost preservation via randomized matrix multiplication (Q2419040) (← links)
• Core-Sets: Updated Survey (Q3297370) (← links)
• Approximating Spectral Clustering via Sampling: A Review (Q3297374) (← links)
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
• On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms (Q5136251) (← links)
• Real-Time Radiation Treatment Planning with Optimality Guarantees via Cluster and Bound Methods (Q5139612) (← links)
• Minimum cost‐compression risk in principal component analysis (Q6075174) (← links)
• k-means-g*: accelerating \(k\)-means clustering algorithm utilizing primitive geometric concepts (Q6150442) (← links)
• On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)
• Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers (Q6173264) (← links)
• Algorithm for orthogonal matrix nearness and its application to feature representation (Q6492598) (← links)