Abstract
Analysis of ranking data is often required in various fields of study, for example politics, market research and psychology. Over the years, many statistical models for ranking data have been developed. Among them, distance-based ranking models postulate that the probability of observing a ranking of items depends on the distance between the observed ranking and a modal ranking. The closer to the modal ranking, the higher the ranking probability is. However, such a model assumes a homogeneous population, and the single dispersion parameter in the model may not be able to describe the data well. To overcome these limitations, we formulate more flexible models by considering the recently developed weighted distance-based models which can allow different weights for different ranks. The assumption of a homogeneous population can be relaxed by an extension to mixtures of weighted distance-based models. The properties of weighted distance-based models are also discussed. We carry out simulations to test the performance of our parameter estimation and model selection procedures. Finally, we apply the proposed methodology to analyze synthetic ranking datasets and a real world ranking dataset about political goals priority.
Original language | English |
---|---|
Pages (from-to) | 2486-2500 |
Number of pages | 15 |
Journal | Computational Statistics and Data Analysis |
Volume | 56 |
Issue number | 8 |
DOIs | |
Publication status | Published - 1 Aug 2012 |
Externally published | Yes |
Keywords
- Distance-based models
- Mixtures models
- Ranking data
ASJC Scopus subject areas
- Statistics and Probability
- Computational Mathematics
- Computational Theory and Mathematics
- Applied Mathematics