首页> 美国卫生研究院文献>BMC Bioinformatics >Shrinkage Clustering: a fast and size-constrained clustering algorithm for biomedical applications
【2h】

Shrinkage Clustering: a fast and size-constrained clustering algorithm for biomedical applications

机译:收缩聚类:用于生物医学应用的快速且受大小限制的聚类算法

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

摘要

BackgroundMany common clustering algorithms require a two-step process that limits their efficiency. The algorithms need to be performed repetitively and need to be implemented together with a model selection criterion. These two steps are needed in order to determine both the number of clusters present in the data and the corresponding cluster memberships. As biomedical datasets increase in size and prevalence, there is a growing need for new methods that are more convenient to implement and are more computationally efficient. In addition, it is often essential to obtain clusters of sufficient sample size to make the clustering result meaningful and interpretable for subsequent analysis.
机译:背景技术许多常见的聚类算法需要两步过程来限制其效率。这些算法需要重复执行,并且需要与模型选择标准一起实施。这两个步骤是必需的,以便确定数据中存在的簇数和相应的簇成员资格。随着生物医学数据集规模和患病率的增加,对新方法的需求不断增长,这些新方法更易于实施且计算效率更高。此外,获得足够样本量的聚类通常对于使聚类结果有意义且可解释以进行后续分析至关重要。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号