Sciweavers

364 search results - page 28 / 73
» On the generalization of soft margin algorithms
Sort
View
ML
2000
ACM
15 years 5 months ago
Maximizing Theory Accuracy Through Selective Reinterpretation
Existing methods for exploiting awed domain theories depend on the use of a su ciently large set of training examples for diagnosing and repairing aws in the theory. In this paper,...
Shlomo Argamon-Engelson, Moshe Koppel, Hillel Walt...
152
Voted
COLT
2000
Springer
15 years 10 months ago
Entropy Numbers of Linear Function Classes
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
Robert C. Williamson, Alex J. Smola, Bernhard Sch&...
ICASSP
2010
IEEE
15 years 5 months ago
A comparison of approximate Viterbi techniques and particle filtering for data estimation in digital communications
We consider trellis-based algorithms for data estimation in digital communication systems. We present a general framework which includes approximate Viterbi algorithms like the M-...
Steffen Barembruch
DAGSTUHL
2007
15 years 7 months ago
Relevance Matrices in LVQ
Abstract. We propose a new matrix learning scheme to extend Generalized Relevance Learning Vector Quantization (GRLVQ). By introducing a full matrix of relevance factors in the dis...
Petra Schneider
ROCAI
2004
Springer
15 years 11 months ago
Optimizing Area Under Roc Curve with SVMs
For many years now, there is a growing interest around ROC curve for characterizing machine learning performances. This is particularly due to the fact that in real-world problems ...
Alain Rakotomamonjy