Ranking with Ordered Weighted Pairwise Classiﬁcation
published: Aug. 26, 2009, recorded: June 2009, views: 4958
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
In ranking with the pairwise classiﬁcation approach, the loss associated to a predicted ranked list is the mean of the pairwise classiﬁca- tion losses. This loss is inadequate for tasks such as 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, 88) of the classiﬁcation 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 an OWA aggregation of margin-based classiﬁcation losses has good generalization properties. Experiments on the Letor 3.0 benchmark dataset for information retrieval validate our approach.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !