scientific article; zbMATH DE number 7049731
From MaRDI portal
Publication:4633019
zbMath1483.62116arXiv1706.02803MaRDI QIDQ4633019
Michael W. Mahoney, Alex Gittens, Shu-Sen Wang
Publication date: 2 May 2019
Full work available at URL: https://arxiv.org/abs/1706.02803
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
Breaking the curse of dimensionality: hierarchical Bayesian network model for multi-view clustering ⋮ Randomized numerical linear algebra: Foundations and algorithms ⋮ Randomized Spectral Clustering in Large-Scale Stochastic Block Models ⋮ Randomized Low-Rank Approximation for Symmetric Indefinite Matrices ⋮ Unnamed Item ⋮ Fast kernel \(k\)-means clustering using incomplete Cholesky factorization ⋮ Unnamed Item ⋮ A new robust fuzzy clustering validity index for imbalanced data sets ⋮ Diversity Sampling is an Implicit Regularization for Kernel Methods ⋮ Perturbations of CUR Decompositions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Faster least squares approximation
- Spectral partitioning works: planar graphs and finite element meshes
- Random matrices: The distribution of the smallest singular values
- NP-hardness of Euclidean sum-of-squares clustering
- On approximate geometric \(k\)-clustering
- The Littlewood-Offord problem and invertibility of random matrices
- Sublinear Randomized Algorithms for Skeleton Decompositions
- Computational Advertising: Techniques for Targeting Relevant Ads
- Dimensionality Reduction for k-Means Clustering and Low Rank Approximation
- Randomized Dimensionality Reduction for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Means Clustering
- IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM
- Randomized Algorithms for Matrices and Data
- Low-Rank Approximation and Regression in Input Sparsity Time
- Extensions of Lipschitz mappings into a Hilbert space
- Compression of motion capture databases
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- Linear-time approximation schemes for clustering problems in any dimensions
- On coresets for k-means and k-median clustering
- The Planar k-Means Problem is NP-Hard
- Relative-Error $CUR$ Matrix Decompositions
- The complexity of the generalized Lloyd - Max problem (Corresp.)
- A local search approximation algorithm for k-means clustering
- Input Sparsity Time Low-rank Approximation via Ridge Leverage Score Sampling
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- Least squares quantization in PCM
- 10.1162/153244303321897735
- Random Projection Trees for Vector Quantization
- Improved Bounds for the Nyström Method With Application to Kernel Classification
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Near-Optimal Column-Based Matrix Reconstruction
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
- Lower Bounds for the Partitioning of Graphs
- Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering
- Algorithms and Computation
This page was built for publication:
