Where academic tradition
meets the exciting future

An efficient algorithm for learning to rank from preference graphs

Tapio Pahikkala, Evgeni Tsivtsivadze, Antti Airola, Jouni Järvinen, Jorma Boberg, An efficient algorithm for learning to rank from preference graphs . Machine Learning 75(1), 129–165, 2009.

Abstract:

In this paper, we introduce a framework for regularized least-squares (RLS) type of ranking cost functions and we propose three such cost functions. Further, we propose a kernel-based preference learning algorithm, which we call RankRLS, for minimizing these functions. It is shown that RankRLS has many computational advantages compared to the ranking algorithms that are based on minimizing other types of costs, such as the hinge cost. In particular, we present efficient algorithms for training, parameter selection, multiple output learning, cross-validation, and large-scale learning. Circumstances under which these computational benefits make RankRLS preferable to RankSVM are considered. We evaluate RankRLS on four different types of ranking tasks using RankSVM and the standard RLS regression as the baselines. RankRLS outperforms the standard RLS regression and its performance is very similar to that of RankSVM, while RankRLS has several computational benefits over RankSVM.

Files:

Full publication in PDF-format

BibTeX entry:

@ARTICLE{jPaTsAiJaBo09a,
  title = {An efficient algorithm for learning to rank from preference graphs },
  author = {Pahikkala, Tapio and Tsivtsivadze, Evgeni and Airola, Antti and Järvinen, Jouni and Boberg, Jorma},
  journal = {Machine Learning},
  volume = {75},
  number = {1},
  pages = {129–165},
  year = {2009},
  keywords = {Ranking, Preference learning, Preference graph, Regularized least-squares, Kernel methods},
}

Belongs to TUCS Research Unit(s): Algorithmics and Computational Intelligence Group (ACI), Turku BioNLP Group

Publication Forum rating of this publication: level 3

Edit publication