arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.07196stat.MLcs.LG
收藏

草图子空间聚类

Sketched Subspace Clustering

University of Minnesota(明尼苏达大学)

Panagiotis A. Traganitis, Georgios B. Giannakis

摘要:

每天产生和传播的大量数据在处理方面提出了独特的挑战。聚类,即在不存在地面实况标签的情况下对数据进行分组,是从数据中得出推论的重要工具。子空间聚类(SC)是一个相对较新的方法,能够成功地分类非线性可分离的数据在众多的设置。尽管SC方法具有很高的聚类精度,但在处理大量高维数据时,其计算复杂度非常高。受随机草图降维方法的启发,本文介绍了一种随机方案SC,称为Sketch-SC,适合于大量的高维数据。Sketch-SC通过使用随机投影压缩两个维度的数据矩阵来加速最先进的SC方法的计算量大的部分,从而实现快速准确的大规模SC。对真实数据的性能分析以及广泛的数值测试证实了Sketch-SC的潜力及其相对于最先进的可扩展SC方法的竞争性能。

英文摘要:

The immense amount of daily generated and communicated data presents unique challenges in their processing. Clustering, the grouping of data without the presence of ground-truth labels, is an important tool for drawing inferences from data. Subspace clustering (SC) is a relatively recent method that is able to successfully classify nonlinearly separable data in a multitude of settings. In spite of their high clustering accuracy, SC methods incur prohibitively high computational complexity when processing large volumes of high-dimensional data. Inspired by random sketching approaches for dimensionality reduction, the present paper introduces a randomized scheme for SC, termed Sketch-SC, tailored for large volumes of high-dimensional data. Sketch-SC accelerates the computationally heavy parts of state-of-the-art SC approaches by compressing the data matrix across both dimensions using random projections, thus enabling fast and accurate large-scale SC. Performance analysis as well as extensive numerical tests on real data corroborate the potential of Sketch-SC and its competitive performance relative to state-of-the-art scalable SC approaches.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑