A Bayesian approximation method for online ranking
From MaRDI portal
Recommendations
Cited in
(15)- Stagewise learning for noisy \(k\)-ary preferences
- Robust Plackett-Luce model for k-ary crowdsourced preferences
- Real-time Bayesian parameter estimation for item response models
- Learning modulo theories for constructive preference elicitation
- A note on ranking in the Plackett-Luce model for multiple comparisons
- Ranking features on psychological dynamics of cooperative team work through Bayesian networks
- Skill rating for multiplayer games. Introducing hypernode graphs and their spectral theory
- Online mental fatigue monitoring via indirect brain dynamics evaluation
- Stochastic multichannel ranking with brain dynamics preferences
- Online Ranking by Projecting
- Moment-Matching-Based Conjugacy Approximation for Bayesian Ranking and Selection
- Sampling from a neural network
- Rate-Optimal Rank Aggregation with Private Pairwise Rankings
- Estimating robot strengths with application to selection of alliance members in FIRST Robotics Competitions
- Expansions for multivariate densities
This page was built for publication: A Bayesian approximation method for online ranking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5396609)