1106 search results - page 111 / 222 » On regularization algorithms in learning theory |
145
click to vote
COLT
1993
Springer
15 years 8 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
217
click to vote
PAKDD
2011
ACM
14 years 7 months ago
2011
ACM
A structural similarity kernel is presented in this paper for SVM learning, especially for learning with imbalanced datasets. Kernels in SVM are usually pairwise, comparing the sim...
141
click to vote
DAGM
2004
Springer
15 years 10 months ago
2004
Springer
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
143
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
The field of machine learning (ML) is concerned with the question of how to construct algorithms that automatically improve with experience. In recent years many successful ML app...
112
click to vote
COLT
2003
Springer
15 years 10 months ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...