首页> 美国卫生研究院文献>other >Cluster Analysis: Unsupervised Learning via Supervised Learning with a Non-convex Penalty
【2h】

Cluster Analysis: Unsupervised Learning via Supervised Learning with a Non-convex Penalty

机译:聚类分析:通过非凸罚分的有监督学习进行无监督学习

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Clustering analysis is widely used in many fields. Traditionally clustering is regarded as unsupervised learning for its lack of a class label or a quantitative response variable, which in contrast is present in supervised learning such as classification and regression. Here we formulate clustering as penalized regression with grouping pursuit. In addition to the novel use of a non-convex group penalty and its associated unique operating characteristics in the proposed clustering method, a main advantage of this formulation is its allowing borrowing some well established results in classification and regression, such as model selection criteria to select the number of clusters, a difficult problem in clustering analysis. In particular, we propose using the generalized cross-validation (GCV) based on generalized degrees of freedom (GDF) to select the number of clusters. We use a few simple numerical examples to compare our proposed method with some existing approaches, demonstrating our method's promising performance.
机译:聚类分析广泛应用于许多领域。传统上,聚类由于缺少类标签或定量响应变量而被视为无监督学习,而分类和回归等监督学习则存在聚类。在这里,我们将聚类表述为具有分组追求的惩罚回归。除了在拟议的聚类方法中新颖使用非凸群罚及其相关的独特操作特性外,此公式的主要优点还在于它可以在分类和回归中借鉴一些公认的结果,例如模型选择标准选择聚类数量,这是聚类分析中的难题。特别是,我们建议使用基于广义自由度(GDF)的广义交叉验证(GCV)选择聚类数。我们使用一些简单的数值示例将我们提出的方法与一些现有方法进行比较,证明我们的方法具有良好的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号