On the modelling of ranking algorithms in probabilistic datalog

  • Authors:
  • Thomas Roelleke;Marco Bonzanini;Miguel Martinez-Alvarez

  • Affiliations:
  • Queen Mary University of London, London, United Kingdom;Queen Mary University of London, London, United Kingdom;Queen Mary University of London, London, United Kingdom

  • Venue:
  • Proceedings of the 7th International Workshop on Ranking in Databases
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

TF-IDF, BM25, language modelling (LM), and divergence-from-randomness (DFR) are popular ranking models. Providing logical abstraction for information search is important, but the implementation of ranking algorithms in logical abstraction layers such as probabilistic Datalog leads to many challenges regarding expressiveness and scalability. Though the ranking algorithms have probabilistic roots, the ranking score often is not probabilistic, leading to unsafe programs from a probabilistic point of view. In this paper, we describe the evolution of probabilistic Datalog to provide concepts required for modelling ranking algorithms.