10.1162/153244303321897681
From MaRDI portal
Publication:4825352
DOI10.1162/153244303321897681zbMATH Open1084.68551OpenAlexW4210892291MaRDI QIDQ4825352FDOQ4825352
Authors: Shai Ben-David, Nadav Eiron, Hans Ulrich Simon 
Publication date: 28 October 2004
Published in: CrossRef Listing of Deleted DOIs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/153244303321897681
Recommendations
- scientific article; zbMATH DE number 1827091
- Learning half-spaces on general infinite spaces equipped with a distance function
- scientific article; zbMATH DE number 1966611
- On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes
- scientific article; zbMATH DE number 1827092
Cited In (23)
- On the perceptron's compression
- Kernels as features: on kernels, margins, and low-dimensional mappings
- Effective feature construction by maximum common subgraph sampling
- Learning Theory
- On the properties of concept classes induced by multivalued Bayesian networks
- An algorithmic theory of learning: robust concepts and random projection
- An algorithmic theory of learning: Robust concepts and random projection
- VC dimension and inner product space induced by Bayesian networks
- Lipschitz representations of subsets of the cube
- Sign rank versus Vapnik-Chervonenkis dimension
- Upper and lower bounds on the power of advice
- Estimating the optimal margins of embeddings in Euclidean half spaces
- A little advice can be very helpful
- VE dimension induced by Bayesian networks over the Boolean domain
- Quantum machine learning: a classical perspective
- Fast learning of relational kernels
- A Borsuk-Ulam lower bound for sign-rank and its applications
- Title not available (Why is that?)
- Learning half-spaces on general infinite spaces equipped with a distance function
- Title not available (Why is that?)
- On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes
- Learning complexity vs communication complexity
- Theory of Classification: a Survey of Some Recent Advances
This page was built for publication: 10.1162/153244303321897681
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4825352)
