Sciweavers

129 search results - page 15 / 26
» icml 2008
Sort
View
ICML
2008
IEEE
15 years 11 months ago
Multiple instance ranking
This paper introduces a novel machine learning model called multiple instance ranking (MIRank) that enables ranking to be performed in a multiple instance learning setting. The mo...
Charles Bergeron, Jed Zaretzki, Curt M. Breneman, ...
ICML
2008
IEEE
15 years 11 months ago
The projectron: a bounded kernel-based Perceptron
We present a discriminative online algorithm with a bounded memory growth, which is based on the kernel-based Perceptron. Generally, the required memory of the kernelbased Percept...
Francesco Orabona, Joseph Keshet, Barbara Caputo
ICML
2008
IEEE
15 years 11 months ago
Detecting statistical interactions with additive groves of trees
Discovering additive structure is an important step towards understanding a complex multi-dimensional function because it allows the function to be expressed as the sum of lower-d...
Daria Sorokina, Rich Caruana, Mirek Riedewald, Dan...
ICML
2008
IEEE
15 years 11 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...
ICML
2008
IEEE
15 years 11 months ago
The dynamic hierarchical Dirichlet process
The dynamic hierarchical Dirichlet process (dHDP) is developed to model the timeevolving statistical properties of sequential data sets. The data collected at any time point are r...
Lu Ren, David B. Dunson, Lawrence Carin