627 search results - page 39 / 126 » Learning from Logged Implicit Exploration Data |
ESSMAC
2003
Springer
15 years 5 months ago
2003
Springer
We apply a constrained Hidden Markov Model architecture to the problem of simultaneous localization and surveying from sensor logs of mobile agents navigating in unknown environmen...
111
click to vote
WSDM
2009
ACM
15 years 7 months ago
2009
ACM
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
113
click to vote
EMNLP
2008
15 years 2 months ago
2008
A human annotator can provide hints to a machine learner by highlighting contextual "rationales" for each of his or her annotations (Zaidan et al., 2007). How can one ex...
114
click to vote
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
115
Voted
ICANN
2010
Springer
15 years 23 days ago
2010
Springer
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...