跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要聚焦通用贝叶斯聚类与混合核错设,未明确对应所列经济计量细分。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
David B. Dunson

通过融合局部密度进行贝叶斯聚类

研究问题
当混合模型的核分布轻微错设就把一个真实群组拆成多个成分时,如何形成更有意义的聚类并量化聚类不确定性?
方法与思路
作者提出局部密度融合方法 FOLD,利用核的后验信息合并混合成分,以贝叶斯决策论支持聚类,并可作为混合模型 MCMC 的附加步骤。
材料陈述的贡献
摘要称,FOLD 支持不确定性量化并具有核错设下的聚类最优性理论;模拟与真实数据展示了较少且具有意义的群组划分。
阅读关注点
核对聚类损失、融合规则与调节选择,区分混合成分和最终群组,并检查核错设下最优性的具体对象与适用条件。
阅读边界
所给为 OpenAlex 索引摘要,稿件版本未注明。摘要未说明损失函数和最优性条件,较少群组本身不能保证恢复真实结构。

原文摘要

Bayesian clustering typically relies on mixture models, with each component interpreted as a different cluster. After defining a prior for the component parameters and weights, Markov chain Monte Carlo (MCMC) algorithms are commonly used to produce samples from the posterior distribution of the component labels. The data are then clustered by minimizing the expectation of a clustering loss function that favors similarity to the component labels. Unfortunately, although these approaches are routinely implemented, clustering results are highly sensitive to kernel misspecification. For example, if Gaussian kernels are used but the true density of data within a cluster is even slightly non-Gaussian, then clusters will be broken into multiple Gaussian components. To address this problem, we develop Fusing of Localized Densities (FOLD), a novel clustering method that melds components together using the posterior of the kernels. FOLD has a fully Bayesian decision theoretic justification, naturally leads to uncertainty quantification, can be easily implemented as an add-on to MCMC algorithms for mixtures, and favors a small number of distinct clusters. We provide theoretical support for FOLD including clustering optimality under kernel misspecification. In simulated experiments and real data, FOLD outperforms competitors by minimizing the number of clusters while inferring meaningful group structure. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work.

笔记与分组
相关领域论文