On Approzimate Balanced Bi-clustering

摘要：

We consider the balanced bi-clustering problem for a given data set, where the number of entities in each cluster is bounded, and its special case where the number of entities in each cluster is fixed. Several algorithms to attack these problems are proposed. In particular, a novel and efficient heuristic, in which we first reformulate the constrained bi-clustering problem into a quadratic programming(QP) problem and then try to solve it by optimization technique, is proposed. We prove that our algorithm can provide a 2-approximate solution to the original problem. Promising numerical results are reported.

作者: Guoxuan Ma Jiming Peng Yu Wei

作者单位: Department of Computing and Software McMaster University-Hamilton, Ontario L8S 4K1, Canada

会议类型: 国际会议

会议名称: The 11th Annual International Computing and Combinatorics Conference COCOON 2005(第11届国际计算和组合会议)

会议地点: 昆明

会议语种:英文

页码: 661-670

在线出版日期: 2005-08-01（万方平台首次上网日期，不代表论文的发表时间）