首页> 外文期刊>Journal of applied statistics >Clustering transformed compositional data using K-means, with applications in gene expression and bicycle sharing system data
【24h】

Clustering transformed compositional data using K-means, with applications in gene expression and bicycle sharing system data

机译:聚类使用K-means转化的组成数据,具有基因表达和自行车共享系统数据的应用

获取原文
获取原文并翻译 | 示例
       

摘要

Although there is no shortage of clustering algorithms proposed in the literature, the question of the most relevant strategy for clustering compositional data (i.e. data whose rows belong to the simplex) remains largely unexplored in cases where the observed value is equal or close to zero for one or more samples. This work is motivated by the analysis of two applications, both focused on the categorization of compositional profiles: (1) identifying groups of co-expressed genes from high-throughput RNA sequencing data, in which a given gene may be completely silent in one or more experimental conditions; and (2) finding patterns in the usage of stations over the course of one week in the Velib' bicycle sharing system in Paris, France. For both of these applications, we make use of appropriately chosen data transformations, including the Centered Log Ratio and a novel extension called the Log Centered Log Ratio, in conjunction with the K-means algorithm. We use a non-asymptotic penalized criterion, whose penalty is calibrated with the slope heuristics, to select the number of clusters. Finally, we illustrate the performance of this clustering strategy, which is implemented in the Bioconductor package coseq, on both the gene expression and bicycle sharing system data.
机译:虽然文献中提出的集群算法没有短缺,但是在观察值等于或接近零的情况下,群集组成数据的最相关策略(即,其行属于单纯x的数据)的问题在很大程度上是未开发的一个或多个样本。这项工作是通过对两个应用的分析,既集中于组成谱的分类:(1)从高通量RNA测序数据中鉴定Co表达基因的基团,其中给定基因在一个或一个或中可以完全沉默更实验条件; (2)在法国巴黎的丝状自行车共享系统中,在一周内使用车站的使用模式。 For both of these applications, we make use of appropriately chosen data transformations, including the Centered Log Ratio and a novel extension called the Log Centered Log Ratio, in conjunction with the K-means algorithm.我们使用非渐近惩罚标准,其惩罚与斜坡启发式校准,选择群集数量。最后,我们说明了这种聚类策略的性能,该策略在基因表达和自行车共享系统数据中在Biocuconduct封装COSEQ中实现。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号