使用K-means聚类转换的组成数据,并应用于基因表达和自行车共享系统数据
Clustering transformed compositional data using K-means, with applications in gene expression and bicycle sharing system data
摘要:
虽然在文献中提出的聚类算法并不缺乏,但是用于聚类组合数据的最相关策略(即,由其行属于单纯形的轮廓组成的数据)在一个或多个样本的观测的观测值等于或接近于零的情况下,仍然在很大程度上未被探索。这项工作的动机是分析两组组成数据,这两组数据都集中在谱的分类上,但产生于相当不同的应用:(1)从高通量RNA测序数据中鉴定共表达基因组,其中给定的基因可能在一个或多个实验条件下完全沉默;以及(2)在法国巴黎的Velib自行车共享系统中,在一周的过程中发现站点使用的模式。对于这两个应用程序,我们专注于使用适当选择的数据转换,包括中心对数比和一个新的扩展,我们提出了所谓的对数中心对数比,结合K-means算法。我们使用一个非渐近惩罚标准,其惩罚是校准的斜率线性,选择数据中存在的集群的数量。最后,我们说明了这种聚类策略的性能,这是在Bioconductor包coseq,基因表达和自行车共享系统的数据。
英文摘要:
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 made up of profiles, whose rows belong to the simplex) remains largely unexplored in cases where the observed value of an observation is equal or close to zero for one or more samples. This work is motivated by the analysis of two sets of compositional data, both focused on the categorization of profiles but arising from considerably different applications: (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 focus on the use of appropriately chosen data transformations, including the Centered Log Ratio and a novel extension we propose called the Log Centered Log Ratio, in conjunction with the K-means algorithm. We use a nonasymptotic penalized criterion, whose penalty is calibrated with the slope heuristics, to select the number of clusters present in the data. 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。