Kernelized design of experiments
This paper describes an approach for selecting instances in regression problems in the cases where observations x are readily available, but obtaining labels y is hard. Given a database of observations, an algorithm inspired by statistical design of experiments and kernel methods is presented that selects a set of k instances to be chosen in order to maximize the prediction performance of a support vector machine. It is shown that the algorithm significantly outperforms related approaches on a number of real-world datasets.
Year of publication: |
2009
|
---|---|
Authors: | Rüping, Stefan ; Weihs, Claus |
Institutions: | Institut für Wirtschafts- und Sozialstatistik, Universität Dortmund |
Saved in:
freely available
Saved in favorites
Similar items by person
-
D-optimal plans in observational studies
Pumplün, Constanze, (2005)
-
Determination of hyper-parameters for kernel based classification and regression
Marin-Galiano, Marcos, (2005)
-
A Simple Method For Estimating Conditional Probabilities For SVMs
Rüping, Stefan, (2004)
- More ...