Sciweavers

1750 search results - page 204 / 350
» Abduction in Classification Tasks
Sort
View
ICML
2007
IEEE
16 years 6 months ago
On learning with dissimilarity functions
We study the problem of learning a classification task in which only a dissimilarity function of the objects is accessible. That is, data are not represented by feature vectors bu...
Liwei Wang, Cheng Yang, Jufu Feng
ICML
2006
IEEE
16 years 6 months ago
Kernelizing the output of tree-based methods
We extend tree-based methods to the prediction of structured outputs using a kernelization of the algorithm that allows one to grow trees as soon as a kernel can be defined on the...
Florence d'Alché-Buc, Louis Wehenkel, Pierr...
ICML
2005
IEEE
16 years 6 months ago
Predictive low-rank decomposition for kernel methods
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
Francis R. Bach, Michael I. Jordan
ICML
2004
IEEE
16 years 6 months ago
Multi-task feature and kernel selection for SVMs
We compute a common feature selection or kernel selection configuration for multiple support vector machines (SVMs) trained on different yet inter-related datasets. The method is ...
Tony Jebara
ICML
2000
IEEE
16 years 6 months ago
Less is More: Active Learning with Support Vector Machines
We describe a simple active learning heuristic which greatly enhances the generalization behavior of support vector machines (SVMs) on several practical document classification ta...
Greg Schohn, David Cohn