[论文解读] Algorithms for Internal Validation Clustering Measures in the Post Genomic Era

Filippo Utro|arXiv (Cornell University)|Feb 14, 2011

Gene expression and cancer classification参考文献 151被引用 5

一句话总结

本文提出了一种新颖的算法框架，用于内部聚类验证度量，强调在微阵列数据分析中的稳定性指标。该框架引入了快速近似算法，将最快与最准确度量之间的计算时间差距从两个数量级缩小至一个数量级，显著提升了效率，同时保持了预测准确性，并首次为微阵列聚类中的非负矩阵分解（NMF）提供了基准测试。

ABSTRACT

Inferring cluster structure in microarray datasets is a fundamental task for the -omic sciences. A fundamental question in Statistics, Data Analysis and Classification, is the prediction of the number of clusters in a dataset, usually established via internal validation measures. Despite the wealth of internal measures available in the literature, new ones have been recently proposed, some of them specifically for microarray data. In this dissertation, a study of internal validation measures is given, paying particular attention to the stability based ones. Indeed, this class of measures is particularly prominent and promising in order to have a reliable estimate the number of clusters in a dataset. For those measures, a new general algorithmic paradigm is proposed here that highlights the richness of measures in this class and accounts for the ones already available in the literature. Moreover, some of the most representative validation measures are also considered. Experiments on 12 benchmark datasets are performed in order to assess both the intrinsic ability of a measure to predict the correct number of clusters in a dataset and its merit relative to the other measures. The main result is a hierarchy of internal validation measures in terms of precision and speed, highlighting some of their merits and limitations not reported before in the literature. This hierarchy shows that the faster the measure, the less accurate it is. In order to reduce the time performance gap between the fastest and the most precise measures, the technique of designing fast approximation algorithms is systematically applied. The end result is a speed-up of many of the measures studied here that brings the gap between the fastest and the most precise within one order of magnitude in time, with no degradation in their prediction power. Prior to this work, the time gap was at least two orders of magnitude.

研究动机与目标

• 开发一种适用于微阵列数据中基于稳定性的内部验证度量的通用算法范式。
• 缩小最快与最准确的内部验证度量之间的计算时间差距。
• 首次对非负矩阵分解（NMF）作为微阵列数据集上的聚类算法进行基准测试。
• 评估多种聚类算法和数据集上内部验证度量的精确度与速度。
• 基于准确度与计算效率之间的权衡，建立验证度量的层次结构。

提出的方法

• 提出一种基于稳定性的内部验证度量的通用算法范式，支持系统性分析与优化。
• 应用快速近似算法，加速内部验证指标的计算，特别是针对基于稳定性的度量。
• 采用子采样和噪声注入作为数据扰动技术，以评估聚类的稳定性。
• 使用层次聚类和K均值聚类作为基础算法，评估不同聚类行为下验证度量的表现。
• 在十二个基准微阵列数据集上开展大量实验，比较验证度量的精确度与速度。
• 引入并评估非负矩阵分解（NMF）作为微阵列数据上下文中的聚类算法，评估其性能与计算需求。

实验结果

研究问题

• RQ1 如何在不牺牲预测准确性的情况下提升内部验证度量的计算效率？
• RQ2 基于稳定性的验证度量与其它内部指标相比，在精确度与速度方面的相对表现如何？
• RQ3 非负矩阵分解在微阵列数据集上的聚类表现如何，相较于传统方法？
• RQ4 不同内部验证度量之间在速度与准确度之间的权衡关系如何？
• RQ5 快速近似算法能否有效缩小最快与最精确验证度量之间的时间差距？

主要发现

• 本研究基于精确度与速度建立了内部验证度量的层次结构，揭示了更快的度量始终准确性较低。
• 通过快速近似算法，最快与最精确验证度量之间的时间差距从两个数量级缩小至一个数量级。
• 所提出的近似技术在显著加速计算的同时保持了预测能力，使高准确度度量更具实用性。
• 首次对微阵列聚类中的非负矩阵分解进行了基准测试，揭示了其高计算成本及潜在应用价值。
• 基于稳定性的度量在正确聚类数预测方面表现出强大的预测能力，尤其在结合高效算法后更为显著。
• 结果表明，算法优化能够有效平衡内部验证中的准确度与效率，从而在大规模基因组数据分析中实现更广泛的应用。