Large margin vs. large volume in transductive learning
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5957380 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 2243369 (Why is no real title available?)
- 10.1162/153244302760200704
- A constrained eigenvalue problem
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Matrix multiplication via arithmetic progressions
- On the Stationary Values of a Second-Degree Polynomial on the Unit Sphere
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
- Support vector machine active learning with applications to text classification
- Transductive Rademacher Complexity and Its Applications
Cited in
(3)
This page was built for publication: Large margin vs. large volume in transductive learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2036258)