Ranking Constraints
 - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Ranking Constraints


Résumé

We need to reason about rankings of objects in a wide variety of domains including information retrieval, sports tournaments, bibliometrics, and statistics. We propose a global constraint therefore for modeling rankings. One important application for rankings is in reasoning about the correlation or uncorrelation between sequences. For example, we might wish to have consecutive delivery sched- ules correlated to make it easier for clients and em- ployees, or uncorrelated to avoid predictability and complacence. We therefore also consider global correlation constraints between rankings. For both ranking and correlation constraints, we propose efficient filtering algorithms and decompositions, and report experimental results demonstrating the promise of our proposed approach.
Fichier principal
Vignette du fichier
bhkkw-ijcai16.pdf (374.32 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

lirmm-01374715 , version 1 (30-09-2016)

Licence

Paternité

Identifiants

  • HAL Id : lirmm-01374715 , version 1
  • PRODINRA : 406714

Citer

Christian Bessiere, Emmanuel Hébrard, George Katsirelos, Toby Walsh, Zeynep Kiziltan. Ranking Constraints
. IJCAI: International Joint Conference on Artificial Intelligence, Jul 2016, New York City, United States. pp.705-711. ⟨lirmm-01374715⟩
467 Consultations
219 Téléchargements

Partager

Gmail Facebook X LinkedIn More