Sciweavers

3050 search results - page 212 / 610
» On-line Algorithms in Machine Learning
Sort
View
135
Voted
ECML
2004
Springer
15 years 9 months ago
A Boosting Approach to Multiple Instance Learning
In this paper we present a boosting approach to multiple instance learning. As weak hypotheses we use balls (with respect to various metrics) centered at instances of positive bags...
Peter Auer, Ronald Ortner
IUI
2005
ACM
15 years 9 months ago
Active preference learning for personalized calendar scheduling assistance
We present PLIANT, a learning system that supports adaptive assistance in an open calendaring system. PLIANT learns user preferences from the feedback that naturally occurs during...
Melinda T. Gervasio, Michael D. Moffitt, Martha E....
ICML
2010
IEEE
15 years 5 months ago
Online Learning for Group Lasso
We develop a novel online learning algorithm for the group lasso in order to efficiently find the important explanatory factors in a grouped manner. Different from traditional bat...
Haiqin Yang, Zenglin Xu, Irwin King, Michael R. Ly...
ICML
2006
IEEE
16 years 5 months ago
Qualitative reinforcement learning
When the transition probabilities and rewards of a Markov Decision Process are specified exactly, the problem can be solved without any interaction with the environment. When no s...
Arkady Epshteyn, Gerald DeJong
ICML
2003
IEEE
16 years 5 months ago
Learning Mixture Models with the Latent Maximum Entropy Principle
We present a new approach to estimating mixture models based on a new inference principle we have proposed: the latent maximum entropy principle (LME). LME is different both from ...
Shaojun Wang, Dale Schuurmans, Fuchun Peng, Yunxin...