KiWi:一种用于基因表达分析的可扩展子空间聚类算法
KiWi: A Scalable Subspace Clustering Algorithm for Gene Expression Analysis
摘要:
子空间聚类在基因表达数据的分析中越来越受欢迎。在子空间聚类模型中,最近引入的保序子矩阵(OPSM)表现出很高的承诺。OPSM,本质上是一个基于模式的子空间聚类,是数据矩阵中的行和列的子集,其中所有行都诱导列的相同线性排序。现有的OPSM发现方法不能很好地扩展到越来越大的表达数据集。特别是,树枝集群有几个基因和许多实验引起爆炸性的计算成本,并完全修剪掉现有的方法。然而,它是特别感兴趣的,以确定在许多条件下紧密共调控的基因的小组。在本文中,我们提出了KiWi,OPSM子空间聚类算法,可扩展到大规模的数据集,能够发现树枝集群,并确定负相关和正相关。我们广泛验证KiWi使用相关的生物数据集,并表明KiWi正确分配冗余的探针到同一簇,组实验与常见的临床注释,区分真正的启动子序列从阴性对照序列,并显示良好的关联顺式调控基序预测。
英文摘要:
Subspace clustering has gained increasing popularity in the analysis of gene expression data. Among subspace cluster models, the recently introduced order-preserving sub-matrix (OPSM) has demonstrated high promise. An OPSM, essentially a pattern-based subspace cluster, is a subset of rows and columns in a data matrix for which all the rows induce the same linear ordering of columns. Existing OPSM discovery methods do not scale well to increasingly large expression datasets. In particular, twig clusters having few genes and many experiments incur explosive computational costs and are completely pruned off by existing methods. However, it is of particular interest to determine small groups of genes that are tightly coregulated across many conditions. In this paper, we present KiWi, an OPSM subspace clustering algorithm that is scalable to massive datasets, capable of discovering twig clusters and identifying negative as well as positive correlations. We extensively validate KiWi using relevant biological datasets and show that KiWi correctly assigns redundant probes to the same cluster, groups experiments with common clinical annotations, differentiates real promoter sequences from negative control sequences, and shows good association with cis-regulatory motif predictions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。