Sciweavers

2190 search results - page 227 / 438
» Learning with the Set Covering Machine
Sort
View
ICML
2009
IEEE
13 years 8 months ago
Accelerated sampling for the Indian Buffet Process
We often seek to identify co-occurring hidden features in a set of observations. The Indian Buffet Process (IBP) provides a nonparametric prior on the features present in each obs...
Finale Doshi-Velez, Zoubin Ghahramani
ALT
2010
Springer
13 years 7 months ago
A Spectral Approach for Probabilistic Grammatical Inference on Trees
We focus on the estimation of a probability distribution over a set of trees. We consider here the class of distributions computed by weighted automata - a strict generalization of...
Raphaël Bailly, Amaury Habrard, Franço...
ML
2010
ACM
147views Machine Learning» more  ML 2010»
13 years 5 months ago
An ensemble uncertainty aware measure for directed hill climbing ensemble pruning
This paper proposes a new measure for ensemble pruning via directed hill climbing, dubbed Uncertainty Weighted Accuracy (UWA), which takes into account the uncertainty of the decis...
Ioannis Partalas, Grigorios Tsoumakas, Ioannis P. ...
ALT
2011
Springer
12 years 10 months ago
Deviations of Stochastic Bandit Regret
This paper studies the deviations of the regret in a stochastic multi-armed bandit problem. When the total number of plays n is known beforehand by the agent, Audibert et al. (2009...
Antoine Salomon, Jean-Yves Audibert
ECML
2007
Springer
14 years 5 months ago
Weighted Kernel Regression for Predicting Changing Dependencies
Abstract. Consider the online regression problem where the dependence of the outcome yt on the signal xt changes with time. Standard regression techniques, like Ridge Regression, d...
Steven Busuttil, Yuri Kalnishkan