Mixtures of weighted distance-based models for ranking data

2Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Ranking data has applications in different fields of studies, like marketing, psychology and politics. Over the years, many models for ranking data have been developed. Among them, distance-based ranking models, which originate from the classical rank correlations, 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 basically assumes a homogeneous population, and the single dispersion parameter may not be able to describe the data very well. To overcome the limitations, we consider new weighted distance measures which allow different weights for different ranks in formulating more flexible distancebased models. The mixtures of weighted distance-based models are also studied for analyzing heterogeneous data. Simulations results will be included, and we will apply the proposed methodology to analyze a real world ranking dataset. © Springer-Verlag Berlin Heidelberg 2010.

Cite

CITATION STYLE

APA

Lee, P. H., & Yu, P. L. H. (2010). Mixtures of weighted distance-based models for ranking data. In Proceedings of COMPSTAT 2010 - 19th International Conference on Computational Statistics, Keynote, Invited and Contributed Papers (pp. 517–524). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-7908-2604-3_52

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free