2190 search results - page 221 / 438 » Learning with the Set Covering Machine |
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
In many applications, unlabelled examples are inexpensive and easy to obtain. Semisupervised approaches try to utilise such examples to reduce the predictive error. In this paper,...
82
Voted
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
In this paper we study a new framework introduced by Vapnik (1998) and Vapnik (2006) that is an alternative capacity concept to the large margin approach. In the particular case o...
80
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
We introduce a family of kernels on discrete data structures within the general class of decomposition kernels. A weighted decomposition kernel (WDK) is computed by dividing objec...
106
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
Classifiers that refrain from classification in certain cases can significantly reduce the misclassification cost. However, the parameters for such abstaining classifiers are ofte...
144
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...