Detecting the end of agreement between two long ranked lists

DOI10.1002/sam.11205OpenAlexW1825190487MaRDI QIDQ2870751

Srinath Sampath, Joseph S. Verducci

Publication date: 21 January 2014

Published in: Statistical Analysis and Data Mining (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/sam.11205

zbMATH Keywords

maximum likelihood estimationconsensusrank aggregationpartial rankingsmultistage modeltop-\(K\) rank list

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Related Items (3)

Comparing boosting and bagging for decision trees of rankings ⋮ A novel method for estimating the common signals for consensus across multiple ranked lists ⋮ Median constrained bucket order rank aggregation

Uses Software

• R

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generative model for rank data based on insertion sort algorithm
• The tau-path test for monotone association in an unspecified subpopulation: application to chemogenomic data mining
• Metric methods for analyzing partially ranked data
• Probability models and statistical analyses for ranking data. Papers presented at the AMS-IMS-SIAM conference, Amherst, MA, USA, June 1990
• NON-NULL RANKING MODELS. I
• Integration of Ranked Lists via Cross Entropy Monte Carlo with Applications to mRNA and microRNA Studies
• An Inference and Integration Approach for the Consolidation of Ranked Lists
• Moderate-Deviation-Based Inference for Random Degeneration in Paired Rank Lists
• Multistage Ranking Models

This page was built for publication: Detecting the end of agreement between two long ranked lists