arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.11487stat.MEstat.CO
收藏

改进分类中的模型选择:一种基于协方差矩阵聚类的方法

Improving Model Choice in Classification: An Approach Based on Clustering of Covariance Matrices

David Rodríguez-Vítores, Carlos Matrán

AI总结:

本文通过按谱相似准则聚类协方差矩阵并改进 CEM 算法,在十四种经典简约高斯混合模型之间引入中间模型,以减少参数并增强可解释性。

摘要:

本工作介绍了对用于拟合高斯混合模型的 Parsimonious Model(简约模型)的一种改进。该改进基于依据某种准则对所涉及的协方差矩阵进行聚类,例如共享主方向。这一准则以及由矩阵谱分解产生的其他相似性准则,构成了 Parsimonious Model 的基础。我们表明,只需对 CEM(Classification Expectation Maximization,分类期望最大化)算法进行简单修改,即可实现协方差矩阵的此类分组。我们的方法由此提出了用于基于模型聚类和判别分析的高斯混合模型,其中协方差矩阵按照简约准则进行聚类,从而在十四种广为人知的简约模型之间创建中间步骤。新增的灵活性不仅使我们能够获得参数更少、用于拟合数据的模型,还提供了更强的可解释性。我们展示了其在基于模型聚类和判别分析中的实用性,给出了用于寻找满足适当尺寸、形状和方向约束的近似解的算法,并将其应用于模拟数据和真实数据示例。

英文摘要:

This work introduces a refinement of the Parsimonious Model for fitting a Gaussian Mixture. The improvement is based on the consideration of clusters of the involved covariance matrices according to a criterion, such as sharing Principal Directions. This and other similarity criteria that arise from the spectral decomposition of a matrix are the bases of the Parsimonious Model. We show that such groupings of covariance matrices can be achieved through simple modifications of the CEM (Classification Expectation Maximization) algorithm. Our approach leads to propose Gaussian Mixture Models for model-based clustering and discriminant analysis, in which covariance matrices are clustered according to a parsimonious criterion, creating intermediate steps between the fourteen widely known parsimonious models. The added versatility not only allows us to obtain models with fewer parameters for fitting the data, but also provides greater interpretability. We show its usefulness for model-based clustering and discriminant analysis, providing algorithms to find approximate solutions verifying suitable size, shape and orientation constraints, and applying them to both simulation and real data examples.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑