Please use this identifier to cite or link to this item:
Rüping, Stefan
Weihs, Claus
Year of Publication: 
Series/Report no.: 
Technical Report 2009,02
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.
Document Type: 
Working Paper

Files in This Item:
125.82 kB

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.