Comment
From MaRDI portal
Publication:5965645
DOI10.1214/088342306000000475zbMATH Open1246.68178arXivmath/0612821OpenAlexW2155685018MaRDI QIDQ5965645FDOQ5965645
Authors: Peter L. Bartlett, Michael Jordan, Jon D. McAuliffe 
Publication date: 1 September 2012
Published in: Statistical Science (Search for Journal in Brave)
Abstract: Comment on "Support Vector Machines with Applications" [math.ST/0612817]
Full work available at URL: https://arxiv.org/abs/math/0612821
Recommendations
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- Title not available (Why is that?)
- Boosting the margin: a new explanation for the effectiveness of voting methods
- 10.1162/153244303768966085
- Title not available (Why is that?)
- Title not available (Why is that?)
- Kernel dimension reduction in regression
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Improved boosting algorithms using confidence-rated predictions
- Local Rademacher complexities
- Convexity, Classification, and Risk Bounds
- Title not available (Why is that?)
- Title not available (Why is that?)
- Structural risk minimization over data-dependent hierarchies
- Convex analysis and nonlinear optimization. Theory and examples
- Support vector machines are universally consistent
- The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
- Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
- Statistical performance of support vector machines
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- 10.1162/1532443041827925
- Kernel methods for measuring independence
- Learning Theory
Cited In (4)
This page was built for publication: Comment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5965645)
