Kernels as features: on kernels, margins, and low-dimensional mappings
From MaRDI portal
Publication:851869
Recommendations
Cites work
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 3477343 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- 10.1162/153244303321897681
- 10.1162/153244303765208403
- A PAC-Bayesian margin bound for linear classifiers
- Advances in large-margin classifiers
- An algorithmic theory of learning: Robust concepts and random projection
- An introduction to support vector machines and other kernel-based learning methods.
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Extensions of Lipschitz mappings into a Hilbert space
- Large margin classification using the perceptron algorithm
- Structural risk minimization over data-dependent hierarchies
- Support-vector networks
Cited in
(18)- Adaptive metric dimensionality reduction
- Generalization error of random feature and kernel methods: hypercontractivity and kernel matrix concentration
- MREKLM: a fast multiple empirical kernel learning machine
- Feature elimination in kernel machines in moderately high dimensions
- Structure from randomness in halfspace learning with the zero-one loss
- On the impossibility of dimension reduction for doubling subsets of \(\ell_{p}\)
- Theory and Algorithm for Learning with Dissimilarity Functions
- Parameterized attribute reduction with Gaussian kernel based fuzzy rough sets
- Beam search algorithms for multilabel learning
- Deep learning: a statistical viewpoint
- Large scale analysis of generalization error in learning using margin based classification methods
- Data-independent random projections from the feature-map of the homogeneous polynomial kernel of degree two
- Similarity, kernels, and the fundamental constraints on cognition
- scientific article; zbMATH DE number 7559100 (Why is no real title available?)
- Algorithmic Learning Theory
- A theory of learning with similarity functions
- Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers
- Sparse learning for large-scale and high-dimensional data: a randomized convex-concave optimization approach
This page was built for publication: Kernels as features: on kernels, margins, and low-dimensional mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q851869)