返回
Regularization and optimization in model-based clustering
DOI:10.1016/j.patcog.2024.110310.png)
摘要
En 中文
Due to their conceptual simplicity, k -means algorithm variants have been extensively used for unsupervised cluster analysis. However, one main shortcoming of these algorithms is that they essentially fit a mixture of identical spherical Gaussians to data that vastly deviates from such a distribution. In comparison, general Gaussian Mixture Models (GMMs) can fit richer structures but require estimating a quadratic number of parameters per cluster to represent the covariance matrices. This poses two main issues: (i) the underlying optimization problems are challenging due to their larger number of local minima, and (ii) their solutions can overfit the data. In this work, we design search strategies that circumvent both issues. We develop more effective optimization algorithms for general GMMs, and we combine these algorithms with regularization strategies that avoid overfitting. Through extensive computational analyses, we observe that optimization or regularization in isolation does not substantially improve cluster recovery. However, combining these techniques permits a completely new level of performance previously unachieved by k -means algorithm variants, unraveling vastly different cluster structures. These results shed new light on the current status quo between GMM and k -means methods and suggest the more frequent use of general GMMs for data exploration. To facilitate such applications, we provide open -source code as well as Julia packages (UNSUPERVISEDCLUSTERING.JL and REGULARIZEDCOVARIANCEMATRICES.JL) implementing the proposed techniques.
Keyword:
Clustering
Gaussian Mixture Models
Regularization
Optimization
Hybrid Genetic Algorithm
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Obstructive sleep apnea classification based on spectrogram patterns in the electrocardiogram基于心电图谱图模式的阻塞性睡眠呼吸暂停分类

