Learning Theory and Kernel Machines
From MaRDI portal
Publication:5305862
DOI10.1007/b12006zbMath1274.68293OpenAlexW2492608700MaRDI QIDQ5305862
Publication date: 23 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b12006
Related Items (6)
Concentration Inequalities for Samples without Replacement ⋮ Learning the set covering machine by bound minimization and margin-sparsity trade-off ⋮ Speculate-correct error bounds for \(k\)-nearest neighbor classifiers ⋮ On the fusion of threshold classifiers for categorization and dimensionality reduction ⋮ Permutational Rademacher Complexity ⋮ Minimum description length revisited
This page was built for publication: Learning Theory and Kernel Machines