Skip to main content

Mixtures of Weighted Distance-Based Models for Ranking Data

  • Conference paper
  • First Online:
Proceedings of COMPSTAT'2010

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • CRITCHLOW, D. E. (1985): Metric methods for analyzing partially ranked data. Lecture Notes in Statistics, 34, Springer, Berlin.

    MATH  Google Scholar 

  • CRITCHLOW, D. E., FLIGNER, M. A. and VERDUCCI, J. S. (1991): Probability models on rankings. Journal of Mathematical Psychology 35, 294-318.

    Article  MathSciNet  MATH  Google Scholar 

  • CROON, M. A. (1989): Latent class models for the analysis of rankings. In: G. De Soete, H. Feger, K. C. Klauer (Eds.), New developments in psychological choice modeling, Elsevier Science, North-Holland, 99-121,.

    Chapter  Google Scholar 

  • DEMPSTER, A. P., LAIRD, N. M. and RUBIN, D. B. (1977): Maximum likelihood from incomplete data via the EM algorithm. Journal of Royal Statistical Society Series B, 39(1):1-38.

    MathSciNet  MATH  Google Scholar 

  • DIACONIS, P. (1988): Group representations in probability and statistics. Institute of Mathematical Statistics, Hayward.

    MATH  Google Scholar 

  • FLIGNER, M. A. and VERDUCCI, J. S. (1986): Distance based ranking models. Journal of Royal Statistical Society Series B 48(3), 359-369

    MathSciNet  MATH  Google Scholar 

  • MALLOWS, C. L. (1957): Non-null ranking models. I. Biometrika, 44, 114-130.

    MathSciNet  MATH  Google Scholar 

  • MARDEN, J. I. (1995): Analyzing and modeling rank data. Chapman and Hall.

    Google Scholar 

  • MURPHY, T. B. and MARTIN, D. (2003): Mixtures of distance-based models for ranking data. Computational Statistics and Data Andlysis, 41, 645-655.

    Article  MathSciNet  Google Scholar 

  • SHIEH, G. S. (1998): A weighted Kendall’s tau statistic. Statistics and Probability Letters, 39, 17-24.

    Article  MathSciNet  MATH  Google Scholar 

  • SHIEH, G. S., BAI, Z. and TSAI, W.-Y. (2000): Rank tests for independence - with a weighted contamination alternative. Statistica Sinica, 10, 577-593.

    MathSciNet  MATH  Google Scholar 

  • TARSITANO, A. (2009): Comparing the effectiveness of rank correlation statistics. Working Papers, Università della Calabria, Dipartimento di Economia e Statistica, 200906.

    Google Scholar 

  • YU, P. L. H., WAN, W. M., LEE. P. H. (2008): Analyzing Ranking Data Using Decision Tree. European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases.

    Google Scholar 

Download references

Acknowledgement

The research of Philip L. H. Yu was supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. HKU 7473/05H).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Paul H. Lee .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, P.H., Yu, P.L.H. (2010). Mixtures of Weighted Distance-Based Models for Ranking Data. In: Lechevallier, Y., Saporta, G. (eds) Proceedings of COMPSTAT'2010. Physica-Verlag HD. https://doi.org/10.1007/978-3-7908-2604-3_52

Download citation

Publish with us

Policies and ethics