Stagewise learning for noisy \(k\)-ary preferences

DOI10.1007/s10994-018-5716-2zbMath1473.62077OpenAlexW2803010599WikidataQ62039114 ScholiaQ62039114MaRDI QIDQ1631792

Ivor W. Tsang, Yuangang Pan, Bo Han

Publication date: 7 December 2018

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-018-5716-2

zbMATH Keywords

rank aggregationBayesian moment matchingnoisy preferencesonline rankingreliable Plackett-Luce model

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Statistical ranking and selection procedures (62F07) Approximation algorithms (68W25)

Related Items (1)

Scalable Bayesian preference learning for crowds

Uses Software

• trueskill
• ImageNet
• TrueSkill
• PRMLT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bayesian Plackett-Luce mixture models for partially ranked data
• Explaining all three-alternative voting outcomes
• Very weak expansions for sequentially designed experiments: Linear models
• Thurstonian modeling of ranking data via mean and covariance structure analysis
• Multi-step ranking of alternatives in a multi-criteria and multi-expert decision making environment
• Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence
• NON-NULL RANKING MODELS. I
• Graphical Models, Exponential Families, and Variational Inference
• Parameter Estimation in Large Dynamic Paired Comparison Experiments
• Rank Centrality: Ranking from Pairwise Comparisons

This page was built for publication: Stagewise learning for noisy \(k\)-ary preferences