Scholarlink

Ranking data are used in many fields to analyze preferences, but noise in the data—such as random or inconsistent rankings—can make interpretation tricky. This paper tackles the issue by introducing a boosting-based approach to improve the Mallows-Bradley-Terry model, making it more resistant to noise. The method works by iteratively adjusting weights based on how well individual rankings align with an estimated consensus. Through Monte Carlo simulations, we show that this approach leads to clearer, more consistent probabilities, even when the data contains a high percentage of noise.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Tackling Noise in Ranking Models with the Boosting Paradigm

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Giuseppe Gismondi,
  • Luca Coraggio,
  • Antonio D’Ambrosio

摘要

Ranking data are used in many fields to analyze preferences, but noise in the data—such as random or inconsistent rankings—can make interpretation tricky. This paper tackles the issue by introducing a boosting-based approach to improve the Mallows-Bradley-Terry model, making it more resistant to noise. The method works by iteratively adjusting weights based on how well individual rankings align with an estimated consensus. Through Monte Carlo simulations, we show that this approach leads to clearer, more consistent probabilities, even when the data contains a high percentage of noise.