On b-bit min-wise hashing for large-scale regression and classification with sparse data
From MaRDI portal
Publication:4558503
zbMath1468.68170arXiv1308.1269MaRDI QIDQ4558503
Nicolai Meinshausen, Rajen D. Shah
Publication date: 22 November 2018
Full work available at URL: https://arxiv.org/abs/1308.1269
Ridge regression; shrinkage estimators (Lasso) (62J07) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Predictive learning via rule ensembles
- Statistics for high-dimensional data. Methods, theory and applications.
- Faster least squares approximation
- Kernel methods in machine learning
- Random projections for the nonnegative least-squares problem
- Universal classes of hash functions
- Least angle regression. (With discussion)
- Randomized sketches for kernels: fast and optimal nonparametric regression
- A proof for the positive definiteness of the Jaccard index matrix
- High-dimensional generalized linear models and the lasso
- Boosting for high-dimensional linear models
- Iterative Hessian sketch: Fast and accurate solution approximation for constrained least-squares
- Randomized Sketches of Convex Programs With Sharp Guarantees
- Randomized Algorithms for Matrices and Data
- Extensions of Lipschitz mappings into a Hilbert space
- Greed is Good: Algorithmic Results for Sparse Approximation
- On the Equivalence between Kernel Quadrature Rules and Random Feature Expansions
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Random forests
This page was built for publication: On b-bit min-wise hashing for large-scale regression and classification with sparse data
