Revealing Subgroup Structure in Ranked Data Using a Bayesian WAND
利用贝叶斯 WAND 模型揭示排序数据的子群结构AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论通用排序数据与贝叶斯聚类,未明确研究离散选择行为或所列其他计量问题。
利用贝叶斯 WAND 模型揭示排序数据的子群结构AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Ranked data arise in many areas of application ranging from the ranking of up-regulated genes for cancer to the ranking of academic statistics journals. Complications can arise when rankers do not report a full ranking of all entities; for example, they might only report their top-M ranked entities after seeing some or all entities. It can also be useful to know whether rankers are equally informative, and whether some entities are effectively judged to be exchangeable. Revealing subgroup structure in the data may also be helpful in understanding the distribution of ranker views. In this paper, we propose a flexible Bayesian nonparametric model for identifying heterogeneous structure and ranker reliability in ranked data. The model is a weighted adapted nested Dirichlet (WAND) process mixture of Plackett–Luce models and inference proceeds through a simple and efficient Gibbs sampling scheme for posterior sampling. The richness of information in the posterior distribution allows us to infer many details of the structure both between ranker groups and between entity groups (within-ranker groups). Our modeling framework also facilitates a flexible representation of the posterior predictive distribution. This flexibility is important as we propose to use the posterior predictive distribution as the basis for addressing the rank aggregation problem, and also for identifying lack of model fit. The methodology is illustrated using several simulation studies and real data examples. Supplementary materials for this article are available online.