Labelwise versus Pairwise Decomposition in Label Ranking

@inproceedings{Cheng2013LabelwiseVP,
  title={Labelwise versus Pairwise Decomposition in Label Ranking},
  author={Weiwei Cheng and Sascha Henzgen and Eyke H{\"u}llermeier},
  booktitle={LWA},
  year={2013}
}
Label ranking is a specific type of preference learning problem, namely the problem of learning a model that maps instances to rankings over a finite set of predefined alternatives (labels). State-of-the-art approaches to label ranking include decomposition techniques that reduce the original problem to binary classification; ranking by pairwise comparison (RPC), for example, constructs one binary problem for each pair of alternatives. In general, each classification example refers to the… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Busing . Salient goals direct and energise students ’ actions in the classroom

K. Smit, A. F.M.T.
Applied Psychology : An International Review • 2012

Salient goals direct and energise students’ actions in the classroom

M. Boekaerts, K. Smit, F.M.T.A. Busing
Applied Psychology: An International Review, 4(S1):520–539 • 2012
View 1 Excerpt

Learning from Partial Labels

Journal of Machine Learning Research • 2011

editors

J. Fürnkranz, E. Hüllermeier
Preference Learning. Springer-Verlag • 2011

Label Ranking Algorithms: A Survey

Preference Learning • 2010
View 1 Excerpt

The Hungarian Method for the Assignment Problem

50 Years of Integer Programming • 2010
View 1 Excerpt

M

R. E. Burkard
Dell’Amico, and S. Martello. Assignment Problems. SIAM • 2009
View 1 Excerpt

Similar Papers

Loading similar papers…