Scholarlink

<p>We study the problem of unimodal density-based clustering based on Gaussian mixture models. In the proposed approach, clusters are thought of as regions of high probability density separated from other regions of low probability density, encouraging the creation of unimodal clusters. The problem of estimation of unimodal Gaussian mixtures has been solved only in the univariate case, while in this work we try to provide a solution for the multivariate setting. The unimodal density-based clustering works in two stages. First, a new merging algorithm based on the density definition of a cluster is used. This algorithm identifies which components should be merged in order to obtain a number of clusters less than or equal to the initial number of mixture components, on the basis of density similarities. Second, a penalized likelihood approach is adopted to induce unimodality in the merged set of components. We evaluate the performance of both methods on the basis of simulated samples and empirical applications.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

An algorithm aiming at unimodal density-based clustering using Gaussian mixture models

  • 期刊论文

  • 发表日期：

    2025年10月9日

查看全文
  • Daniele Tancini,
  • Luca Scrucca,
  • Francesco Bartolucci

摘要

We study the problem of unimodal density-based clustering based on Gaussian mixture models. In the proposed approach, clusters are thought of as regions of high probability density separated from other regions of low probability density, encouraging the creation of unimodal clusters. The problem of estimation of unimodal Gaussian mixtures has been solved only in the univariate case, while in this work we try to provide a solution for the multivariate setting. The unimodal density-based clustering works in two stages. First, a new merging algorithm based on the density definition of a cluster is used. This algorithm identifies which components should be merged in order to obtain a number of clusters less than or equal to the initial number of mixture components, on the basis of density similarities. Second, a penalized likelihood approach is adopted to induce unimodality in the merged set of components. We evaluate the performance of both methods on the basis of simulated samples and empirical applications.