A generative model for rank data based on an insertion sorting algorithm

Christophe Biernacki (1) , Julien Jacques (1)

1 LPP - Laboratoire Paul Painlevé - UMR 8524

An original and meaningful probabilistic generative model for full rank data modelling is proposed. Rank data arise from a sorting mechanism which is generally unobservable for statisticians. Assuming that this process relies on paired comparisons, the insertion sort algorithm is known as being the best candidate in order to minimize the number of potential paired misclassifications for a moderate number of objects to be ordered. Combining this optimality argument with a Bernoulli event during paired comparison step, a model that possesses desirable theoretical properties, among which are unimodality, symmetry and identifiability is obtained. Maximum likelihood estimation can also be performed easily through an EM or a SEM-Gibbs algorithm (depending on the number of objects to be ordered) by involving the latent initial presentation order of the objects. Finally, the practical relevance of the proposal is illustrated through its adequacy with several real data sets and a comparison with a standard rank data model.

Mots clés: Full rank data; sorting process; insertion sort algorithm; EM algorithm; quiz data

Domaines: Statistiques [math.ST]; Théorie [stat.TH]

Christophe Biernacki, Julien Jacques. A generative model for rank data based on an insertion sorting algorithm. Computational Statistics and Data Analysis, 2013, 58, pp.162-176. ⟨10.1016/j.csda.2012.08.008⟩. ⟨hal-00441209v3⟩