Model-based clustering is widely-used in a variety of application areas.
However, fundamental concerns remain about robustness. In particular, results
can be sensitive to the choice of kernel representing the within-cluster data
density. Leveraging on properties of pairwise differences between data points,
we propose a class of Bayesian distance clustering methods, which rely on
modeling the likelihood of the pairwise distances in place of the original
data. Although some information in the data is discarded, we gain substantial
robustness to modeling assumptions. The proposed approach represents an
appealing middle ground between distance- and model-based clustering, drawing
advantages from each of these canonical approaches. We illustrate dramatic
gains in the ability to infer clusters that are not well represented by the
usual choices of kernel. A simulation study is included to assess performance
relative to competitors, and we apply the approach to clustering of brain
genome expression data.
Keywords: Distance-based clustering; Mixture model; Model-based clustering;
Model misspecification; Pairwise distance matrix; Partial likelihood;
Robustness.

提出了一种贝叶斯距离聚类方法，它使用基于数据点之间成对差异的先验知识以取得更强的鲁棒性，可以在距离聚类和模型聚类之间找到一个平衡点，并通过其在脑基因表达数据的聚类应用中展示了其性能