Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers
From MaRDI portal
Recommendations
- High-dimensional outlier detection using random projections
- Randomized Robust Subspace Recovery and Outlier Detection for High Dimensional Data Matrices
- Low rank approximation in the presence of outliers
- Random projections for the nonnegative least-squares problem
- Optimal outlier removal in high-dimensional spaces
- Optimal outlier removal in high-dimensional
- Robust inexact alternating optimization for matrix completion with outliers
- High-dimensional inference robust to outliers with ℓ1-norm penalization
- Random projections for linear programming
- Random Projections for Large-Scale Regression
Cites work
- A sparse Johnson-Lindenstrauss transform
- A survey on unsupervised outlier detection in high‐dimensional numerical data
- Algorithms for facility location problems with outliers. (Extended abstract)
- An algorithmic theory of learning: Robust concepts and random projection
- An elementary proof of a theorem of Johnson and Lindenstrauss
- An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
- Approximate clustering via core-sets
- Coresets for polytope distance
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Dimensionality reduction for k-means clustering and low rank approximation
- Embeddings of surfaces, curves, and moving points in euclidean space
- Extensions of Lipschitz mappings into a Hilbert space
- Feature selection for linear SVM with provable guarantees
- Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction
- scientific article; zbMATH DE number 2079414 (Why is no real title available?)
- scientific article; zbMATH DE number 194744 (Why is no real title available?)
- Kernels as features: on kernels, margins, and low-dimensional mappings
- LIBLINEAR: a library for large linear classification
- Linear dimensionality reduction: survey, insights, and generalizations
- Performance of Johnson-Lindenstrauss transform for \(k\)-means and \(k\)-medians clustering
- Randomized Dimensionality Reduction for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Means Clustering
- Robust support vector machines based on the rescaled hinge loss function
- Sparser Johnson-Lindenstrauss transforms
- Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
- Stronger data poisoning attacks break data sanitization defenses
- Support-vector networks
- The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
- The non-uniform k-center problem
- The persistent homology of distance functions under random projection
This page was built for publication: Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173264)
