arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0712.2682cs.DSstat.ML
收藏

双聚类的一种逼近比

An Approximation Ratio for Biclustering

Kai Puolamäki, Sami Hanhijärvi, Gemma C. Garriga

摘要:

双聚类的问题包括矩阵的行和列的同时聚类,使得由一对行和列聚类引起的每个子矩阵尽可能均匀。在本文中,我们近似的最佳双聚类应用单向聚类算法独立的行和列的输入矩阵。我们证明了这样的解在0-1值矩阵的L1-范数下产生1+sqrt(2)的最坏情况逼近比,在实值矩阵的L2-范数下产生2的最坏情况逼近比。

英文摘要:

The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters is as uniform as possible. In this paper we approximate the optimal biclustering by applying one-way clustering algorithms independently on the rows and on the columns of the input matrix. We show that such a solution yields a worst-case approximation ratio of 1+sqrt(2) under L1-norm for 0-1 valued matrices, and of 2 under L2-norm for real valued matrices.

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

↑