Comment

DOI10.1214/088342306000000475MaRDI QIDQ5965645zbMATH OpenOpenAlexFDO

Authors Peter L. Bartlett, Michael Jordan, Jon D. McAuliffe

Publication date 1 September 2012

Published in Statistical Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0612821, https://projecteuclid.org/euclid.ss/1166642437

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Abstract: Comment on "Support Vector Machines with Applications" [math.ST/0612817]

Recommendations

• Comment
• Comment
• Comment
• Comment
• Comment
• Comment
• Comment
• Comment
• Comment

Cites work

• 10.1162/153244303768966085
• 10.1162/1532443041827925
• Boosting the margin: a new explanation for the effectiveness of voting methods
• Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
• Convex analysis and nonlinear optimization. Theory and examples
• Convexity, Classification, and Risk Bounds
• scientific article; zbMATH DE number 2089352 (Why is no real title available?)
• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• scientific article; zbMATH DE number 1220060 (Why is no real title available?)
• scientific article; zbMATH DE number 472970 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Improved boosting algorithms using confidence-rated predictions
• Kernel dimension reduction in regression
• Kernel methods for measuring independence
• Learning Theory
• Local Rademacher complexities
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• Statistical performance of support vector machines
• Structural risk minimization over data-dependent hierarchies
• Support vector machines are universally consistent
• The hardness of approximate optima in lattices, codes, and systems of linear equations
• The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network

Cited in

(4)

• Comment
• Comment
• Comment
• Comment

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)