paper-with-me

홈 › Papers

Bayesian nonparametric Plackett-Luce models for the analysis of preferences for college degree programmes

2012-11-21 · François Caron, Yee Whye Teh, Thomas Brendan Murphy

In this paper we propose a Bayesian nonparametric model for clustering partial ranking data. We start by developing a Bayesian nonparametric extension of the popular Plackett-Luce choice model that can handle an infinite number of choice items. Our framework is based on the theory of random atomic measures, with the prior specified by a completely random measure. We characterise the posterior distribution given data, and derive a simple and effective Gibbs sampler for posterior simulation. We then develop a Dirichlet process mixture extension of our model and apply it to investigate the clustering of preferences for college degree programmes amongst Irish secondary school graduates. The existence of clusters of applicants who have similar preferences for degree programmes is established and we determine that subject matter and geographical location of the third level institution characterise these clusters.

📄 PDF Abstract BibTeX arXiv:1211.5037

Code (0)

등록된 구현이 없습니다.

Tasks

Clustering

Similar Papers 제목 키워드 기반

DATELINE: Deep Plackett-Luce Model with Uncertainty Measurements

2018-12-14 · Bo Han

The aggregation of k-ary preferences is a historical and important problem, since it has many real-world applications, such as peer grading, presidential elections and restaurant ranking. Meanwhile, variants of Plackett-…

Bayesian nonparametric models for ranked data

2012-12-01 · NeurIPS 2012 12 · Francois Caron, Yee W. Teh

We develop a Bayesian nonparametric extension of the popular Plackett-Luce choice model that can handle an infinite number of choice items. Our framework is based on the theory of random atomic measures, with the prior…

Preference Models assume Proportional Hazards of Utilities

2025-08-15 · Chirag Nagpal arxiv

Approaches for estimating preferences from human annotated data typically involves inducing a distribution over a ranked list of choices such as the Plackett-Luce model. Indeed, modern AI alignment tools such as Reward M…

Hierarchical Partial-Order Models for Ranking

2026-06-23 · Dongqing Li, Geoff K. Nicholls, Jeong Eun Lee, Chuxuan 외 arxiv

Rank aggregation combines information from ordered lists ranking items by preference. Classical parametric models for such data, including the Mallows and Plackett-Luce models, assume the orders concentrate around one or…

Bayesian Inference

Learning Mixtures of Plackett-Luce Models from Structured Partial Orders

2019-10-25 · NeurIPS 2019 12 · Zhibing Zhao, Lirong Xia

Mixtures of ranking models have been widely used for heterogeneous preferences. However, learning a mixture model is highly nontrivial, especially when the dataset consists of partial orders. In such cases, the parameter…

2kComputational Efficiency