Sciweavers

385 search results - page 8 / 77
» Probabilistic ranking over relations
Sort
View
DAGSTUHL
2007
13 years 9 months ago
Learning Probabilistic Relational Dynamics for Multiple Tasks
The ways in which an agent’s actions affect the world can often be modeled compactly using a set of relational probabilistic planning rules. This paper addresses the problem of ...
Ashwin Deshpande, Brian Milch, Luke S. Zettlemoyer...
AI
2008
Springer
13 years 7 months ago
Label ranking by learning pairwise preferences
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
Eyke Hüllermeier, Johannes Fürnkranz, We...
ICML
2008
IEEE
14 years 8 months ago
Optimizing estimated loss reduction for active sampling in rank learning
Learning to rank is becoming an increasingly popular research area in machine learning. The ranking problem aims to induce an ordering or preference relations among a set of insta...
Pinar Donmez, Jaime G. Carbonell
NAACL
2007
13 years 9 months ago
Multiple Aspect Ranking Using the Good Grief Algorithm
We address the problem of analyzing multiple related opinions in a text. For instance, in a restaurant review such opinions may include food, ambience and service. We formulate th...
Benjamin Snyder, Regina Barzilay
ICML
2001
IEEE
14 years 8 months ago
Learning Probabilistic Models of Relational Structure
Most real-world data is stored in relational form. In contrast, most statistical learning methods work with "flat" data representations, forcing us to convert our data i...
Lise Getoor, Nir Friedman, Daphne Koller, Benjamin...