Comments on: Support vector machines maximizing geometric margins for multi-class classification
From MaRDI portal
Publication:5965492
DOI10.1007/s11750-014-0340-1zbMath1336.62180MaRDI QIDQ5965492
Publication date: 23 May 2016
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-014-0340-1
62H30: Classification and discrimination; cluster analysis (statistical aspects)
90C29: Multi-objective and goal programming
68T05: Learning and adaptive systems in artificial intelligence
Cites Work
- Multicategory classification by support vector machines
- Efficient distribution-free learning of probabilistic concepts
- Toward efficient agnostic learning
- Entropy and the combinatorial dimension
- Combining discriminant models with new multi-class SVMs
- Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions
- Local Rademacher complexities
- 10.1162/15324430260185628
- Scale-sensitive dimensions, uniform convergence, and learnability
- The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
- The Generic Chaining
- Multicategory Support Vector Machines
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item