Sciweavers

2816 search results - page 341 / 564
» Submodular function minimization
Sort
View
ICML
2006
IEEE
15 years 12 months ago
A DC-programming algorithm for kernel selection
We address the problem of learning a kernel for a given supervised learning task. Our approach consists in searching within the convex hull of a prescribed set of basic kernels fo...
Andreas Argyriou, Raphael Hauser, Charles A. Micch...
70
Voted
ICML
2005
IEEE
15 years 12 months ago
Active learning for sampling in time-series experiments with application to gene expression analysis
Many time-series experiments seek to estimate some signal as a continuous function of time. In this paper, we address the sampling problem for such experiments: determining which ...
Rohit Singh, Nathan Palmer, David K. Gifford, Bonn...
ICML
2004
IEEE
15 years 12 months ago
Learning with non-positive kernels
In this paper we show that many kernel methods can be adapted to deal with indefinite kernels, that is, kernels which are not positive semidefinite. They do not satisfy Mercer...
Alexander J. Smola, Cheng Soon Ong, Stéphan...
TCC
2009
Springer
133views Cryptology» more  TCC 2009»
15 years 11 months ago
Composing Quantum Protocols in a Classical Environment
We propose a general security definition for cryptographic quantum protocols that implement classical non-reactive two-party tasks. The definition is expressed in terms of simple q...
Serge Fehr, Christian Schaffner
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
15 years 11 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney