A generative model for rank data based on sorting algorithm - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2009

A generative model for rank data based on sorting algorithm

Christophe Biernacki
  • Fonction : Auteur
  • PersonId : 853117
Julien Jacques

Résumé

Rank data arise from a sorting mechanism which is generally unobservable for the statistician. Retaining the insertion sorting algorithm because of its well known optimality properties and combining it with a natural stochastic error in the pair comparison process allows to propose a parsimonious and meaningful parametric generative model for rank data. Its theoretical properties are studied like unimodality, symmetry and identifiability. In addition, maximum likelihood principle can be easily performed through an EM algorithm thanks to an unobserved latent variables interpretation of the model. Finally, an illustration of adequacy between the proposed model and rank data resulting from a general knowledge quiz suggests the relevance of our proposal.
Fichier principal
Vignette du fichier
Preprint-ISR.pdf (244.34 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00441209 , version 1 (15-12-2009)
hal-00441209 , version 2 (25-06-2010)
hal-00441209 , version 3 (13-10-2012)

Identifiants

  • HAL Id : hal-00441209 , version 1

Citer

Christophe Biernacki, Julien Jacques. A generative model for rank data based on sorting algorithm. 2009. ⟨hal-00441209v1⟩
219 Consultations
863 Téléchargements

Partager

Gmail Facebook X LinkedIn More