Skip to main content

Inference for the Top-k Rank List Problem

  • Conference paper
COMPSTAT 2008

Abstract

Consider a problem where N items (objects or individuals) are judged by assessors using their perceptions of a set of performance criteria, or alternatively by technical devices. In particular, two assessors might rank the items between 1 and N on the basis of relative performance, independently of each other. We aggregate the rank lists in that we assign one if the two assessors agree, and zero otherwise. How far can we continue into this sequence of 0’s and 1’s before randomness takes over? In this paper we suggest methods and algorithms for addressing this problem.

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

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

  • AMOSOVA, N.N. (1972): Limit theorems for the probabilities of moderate deviations. (In Russian). Vestnik Leningrad. Univ. 13, 5-14.

    MathSciNet  Google Scholar 

  • BRADLEY, R.A. and TERRY, M.A. (1952): Rank analysis of incomplete block designs. Biometrika 39, 324-345.

    MATH  MathSciNet  Google Scholar 

  • DECONDE, R.P., HAWLEY, S., FALCON, S., CLEGG, N., KNUDSEN, B., and ETZIONI, R. (2006): Combined results of microarray experiments: a rank aggregation approach. Statistical Applications in Genetics and Molecular Biology 5, 1, article 15.

    Google Scholar 

  • DONOHO, D.L. and JOHNSTONE, I. (1994): Ideal spatial adaptation by wavelet shrinkage. Biometrika 81, 425-455.

    Article  MATH  MathSciNet  Google Scholar 

  • DONOHO, D.L., JOHNSTONE, I.M., KERKYACHARIAN, G., and PICARD, D. (1995): Wavelet shrinkage: asymptopia? (With discussion). J. Roy. Statist. Soc. B 57, 301-369.

    MATH  MathSciNet  Google Scholar 

  • DWORK, C., KUMAR, R., NAOR, M., SIVAKUMAR, D. (2001): Rank aggregation methods for the Web. http://www10.org/cdrom/papers/577/

  • FAGIN, R., KUMAR, R. and SIVAKUMAR, D. (2003): Comparing top-k lists. SIAM J. Discrete Math. 17, 134-160.

    Article  MATH  MathSciNet  Google Scholar 

  • KENDALL, M. and GIBBONS, J.D. (1990): Rank Correlation Methods. Edward Arnold, London.

    MATH  Google Scholar 

  • LIN, S. and DING, J. (2008): Integration of ranked lists via Cross Entropy Monte Carlo with applications to mRNA and microRNA studies. Biometrics, to appear.

    Google Scholar 

  • R DEVELOPMENT CORE TEAM (2007): R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing. http://www.R-project.org

  • RUBIN, H. and SETHURAMAN, J. (1965): Probabilities of moderate deviations. Sankhya A 27, 325-346.

    MATH  MathSciNet  Google Scholar 

  • THURSTONE, L.L. (1931): Rank order as a psychological method. J. Exp. Psychol. 14, 187-201.

    Article  Google Scholar 

  • SØRLIE et al. (2001): Gene expression patterns of breast carcinomas distinguish tumor subclasses with clinical implications. PNAS 98, 10869-10874.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peter Hall .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Physica-Verlag Heidelberg

About this paper

Cite this paper

Hall, P., Schimek, M.G. (2008). Inference for the Top-k Rank List Problem. In: Brito, P. (eds) COMPSTAT 2008. Physica-Verlag HD. https://doi.org/10.1007/978-3-7908-2084-3_36

Download citation

Publish with us

Policies and ethics