Learning to Rank and Quadratic Assignment
In this paper we show that the optimization of several ranking-based performance measures, such as precision-at-k and average-precision, is intimately related to the solution of quadratic assignment problems. Both the task of test-time prediction of the best ranking and the task of constraint generation in estimators based on structured support vector machines can all be seen as special cases of quadratic assignment problems. Although such problems are in general NP-hard, we identify a...[Show more]
|Collections||ANU Research Publications|
|Source:||Learning to Rank and Quadratic Assignment|
|01_Mensink_Learning_to_Rank_and_Quadratic_2011.pdf||140.88 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.