Sciweavers

124 search results - page 7 / 25
» Preference Elicitation without Numbers
Sort
View

Publication
240views
12 years 6 months ago
Bayesian multitask inverse reinforcement learning
We generalise the problem of inverse reinforcement learning to multiple tasks, from multiple demonstrations. Each one may represent one expert trying to solve a different task, or ...
Christos Dimitrakakis, Constantin A. Rothkopf
WWW
2009
ACM
14 years 8 months ago
Learning consensus opinion: mining data from a labeling game
We consider the problem of identifying the consensus ranking for the results of a query, given preferences among those results from a set of individual users. Once consensus ranki...
Paul N. Bennett, David Maxwell Chickering, Anton M...
AAAI
2006
13 years 8 months ago
Forgetting and Conflict Resolving in Disjunctive Logic Programming
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
Thomas Eiter, Kewen Wang
22
Voted
UAI
2001
13 years 8 months ago
UCP-Networks: A Directed Graphical Representation of Conditional Utilities
We propose a directed graphical representation of utility functions, called UCP-networks, that combines aspects of two existing preference models: generalized additive models and ...
Craig Boutilier, Fahiem Bacchus, Ronen I. Brafman
ISPW
2008
IEEE
14 years 1 months ago
Accurate Estimates without Calibration?
Most process models calibrate their internal settings using historical data. Collecting this data is expensive, tedious, and often an incomplete process. Is it possible to make acc...
Tim Menzies, Oussama El-Rawas, Barry W. Boehm, Ray...