Sciweavers

120 search results - page 10 / 24
» Convex Principal Feature Selection
Sort
View
SLSFS
2005
Springer
14 years 1 months ago
Generalization Bounds for Subspace Selection and Hyperbolic PCA
We present a method which uses example pairs of equal or unequal class labels to select a subspace with near optimal metric properties in a kernel-induced Hilbert space. A represen...
Andreas Maurer
RAS
2007
113views more  RAS 2007»
13 years 7 months ago
Visual novelty detection with automatic scale selection
This paper presents experiments with an autonomous inspection robot, whose task was to highlight novel features in its environment from camera images. The experiments used two dif...
Hugo Vieira Neto, Ulrich Nehmzow
INTERSPEECH
2010
13 years 2 months ago
Dynamic model selection for spectral voice conversion
Statistical methods for voice conversion are usually based on a single model selected in order to represent a tradeoff between goodness of fit and complexity. In this paper we ass...
Pierre Lanchantin, Xavier Rodet
JMLR
2008
169views more  JMLR 2008»
13 years 7 months ago
Multi-class Discriminant Kernel Learning via Convex Programming
Regularized kernel discriminant analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. Its performance depends on the selection of kernel...
Jieping Ye, Shuiwang Ji, Jianhui Chen
ATAL
2006
Springer
13 years 11 months ago
Robust mechanisms for information elicitation
We study information elicitation mechanisms in which a principal agent attempts to elicit the private information of other agents using a carefully selected payment scheme based o...
Aviv Zohar, Jeffrey S. Rosenschein