Sciweavers

131 search results - page 8 / 27
» Pairwise Preference Learning and Ranking
Sort
View
IJON
2010
112views more  IJON 2010»
13 years 8 months ago
Efficient voting prediction for pairwise multilabel classification
The pairwise approach to multilabel classification reduces the problem to learning and aggregating preference predictions among the possible labels. A key problem is the need to qu...
Eneldo Loza Mencía, Sang-Hyeun Park, Johann...
ICML
2004
IEEE
14 years 4 months ago
Active learning of label ranking functions
The effort necessary to construct labeled sets of examples in a supervised learning scenario is often disregarded, though in many applications, it is a time-consuming and expensi...
Klaus Brinker
AAAI
2006
14 years 9 days ago
Improved Bounds for Computing Kemeny Rankings
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
CHI
2009
ACM
14 years 5 months ago
Matchin: eliciting user preferences with an online game
Eliciting user preferences for large datasets and creating rankings based on these preferences has many practical applications in community-based sites. This paper gives a new met...
Severin Hacker, Luis von Ahn
ECML
2006
Springer
14 years 2 months ago
Case-Based Label Ranking
Label ranking studies the problem of learning a mapping from instances to rankings over a predefined set of labels. We approach this setting from a case-based perspective and propo...
Klaus Brinker, Eyke Hüllermeier