Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
AdaRank

The basic idea of AdaRank is constructing “weak rankers” repeatedly based on reweighted training queries and linearly combining the weak rankers for making ranking predictions. In learning, AdaRank minimizes a loss function directly defined on performance measures. The details of AdaRank can be found in the paper “AdaRank: A Boosting Algorithm for Information Retrieval.”

Details

TypeDownload
File NameAdaRank.zip
Version1.0
Date Published11 April 2011
Download Size0.89 MB

Note By installing, copying, or otherwise using this software, you agree to be bound by the terms of its license. Read the license.