Finite sample performance of the E-M algorithm for ranks data modelling

Authors

  • Angela D'Elia Università degli Studi di Napoli Federico II

DOI:

https://doi.org/10.6092/issn.1973-2201/337

Abstract

We check the finite sample performance of the maximum likelihood estimators of the parameters of a mixture distribution recently introduced for modelling ranks/preference data. The estimates are derived by the E-M algorithm and the performance is evaluated both from an univariate and bivariate points of view. While the results are generally acceptable as far as it concerns the bias, the Monte Carlo experiment shows a different behaviour of the estimators efficiency for the two parameters of the mixture, mainly depending upon their location in the admissible parametric space. Some operative suggestions conclude the paer.

Downloads

Published

2007-10-19

How to Cite

D’Elia, A. (2003). Finite sample performance of the E-M algorithm for ranks data modelling. Statistica, 63(1), 41–51. https://doi.org/10.6092/issn.1973-2201/337

Issue

Section

Articles