2009 RankingwithOrderedWeightedPairw

• (Usunier et al., 2009) ⇒ Nicolas Usunier, David Buffoni, and Patrick Gallinari. (2009). “Ranking with Ordered Weighted Pairwise Classification.” In: Proceedings of the 26th Annual International Conference on Machine Learning. ISBN:978-1-60558-516-1 doi:10.1145/1553374.1553509

Subject Headings: Weighted Approximately Ranked Pairwise (WARP) Loss.

Cited By

• http://scholar.google.com/scholar?q=%222009%22+Ranking+with+Ordered+Weighted+Pairwise+Classification
• http://dl.acm.org/citation.cfm?id=1553374.1553509&preflayout=flat#citedby

Quotes

Abstract

In ranking with the pairwise classification approach, the loss associated to a predicted ranked list is the mean of the pairwise classification losses. This loss is inadequate for tasks like information retrieval where we prefer ranked lists with high precision on the top of the list. We propose to optimize a larger class of loss functions for ranking, based on an ordered weighted average (OWA) (Yager, 1988) of the classification losses. Convex OWA aggregation operators range from the max to the mean depending on their weights, and can be used to focus on the top ranked elements as they give more weight to the largest losses. When aggregating hinge losses, the optimization problem is similar to the SVM for interdependent output spaces. Moreover, we show that OWA aggregates of margin-based classification losses have good generalization properties. Experiments on the Letor 3.0 benchmark dataset for information retrieval validate our approach.

References

;

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2009 RankingwithOrderedWeightedPairw	Nicolas Usunier David Buffoni Patrick Gallinari			Ranking with Ordered Weighted Pairwise Classification				10.1145/1553374.1553509		2009