分位数聚类
Quantile-based clustering
摘要:
介绍了一种新的聚类分析方法--分位数聚类法($K$ -quantiles clustering)。$K$ -分位数聚类可以通过用于$K$ -均值的经典Lloyd算法风格的简单贪婪算法来计算。它可以应用于大型和高维数据集。它允许基于群内变异的群内偏度和内部变量缩放。不同的版本允许不同程度的简约和计算效率。虽然$K$分位数聚类被认为是非参数的,它可以连接到一个固定的分区模型的广义非对称拉普拉斯分布。证明了$K$ -分位数聚类的一致性,并证明了$K$ -分位数聚类对应于非参数混合物中分离良好的混合成分.在一个模拟中,$K$分位数聚类与一些流行的聚类方法进行了比较,具有良好的效果。通过$K$分位数对高维微阵列数据集进行聚类。
英文摘要:
A new cluster analysis method, $K$-quantiles clustering, is introduced. $K$-quantiles clustering can be computed by a simple greedy algorithm in the style of the classical Lloyd's algorithm for $K$-means. It can be applied to large and high-dimensional datasets. It allows for within-cluster skewness and internal variable scaling based on within-cluster variation. Different versions allow for different levels of parsimony and computational efficiency. Although $K$-quantiles clustering is conceived as nonparametric, it can be connected to a fixed partition model of generalized asymmetric Laplace-distributions. The consistency of $K$-quantiles clustering is proved, and it is shown that $K$-quantiles clusters correspond to well separated mixture components in a nonparametric mixture. In a simulation, $K$-quantiles clustering is compared with a number of popular clustering methods with good results. A high-dimensional microarray dataset is clustered by $K$-quantiles.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。