arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1206.6927stat.MEmath.STstat.MLstat.TH
收藏

个人资料Likestive Biclustering

Profile Likelihood Biclustering

Cheryl J. Flynn, Patrick O. Perry

摘要:

双聚类是同时对数据矩阵的行和列进行聚类的过程,是在高维数据集中发现结构的一种流行而有效的工具。许多biclustering程序在实践中似乎工作得很好,但大多数没有相关的一致性保证。为了解决这个缺点,我们提出了一个新的双聚类过程的基础上配置文件的可能性。该程序适用于广泛的数据模式,包括二进制,计数和连续观测。我们证明,该过程恢复真正的行和列类时,数据矩阵的维度趋于无穷大,即使数据分布的函数形式是错误的。该过程需要计算组合搜索,这在实践中可能是昂贵的。而不是直接执行此搜索,我们提出了一个新的启发式优化过程的基础上的Kernighan-Lin启发式,它具有良好的计算性能,并在模拟中表现良好。我们展示了我们的程序与应用程序国会投票记录,和微阵列分析。

英文摘要:

Biclustering, the process of simultaneously clustering the rows and columns of a data matrix, is a popular and effective tool for finding structure in a high-dimensional dataset. Many biclustering procedures appear to work well in practice, but most do not have associated consistency guarantees. To address this shortcoming, we propose a new biclustering procedure based on profile likelihood. The procedure applies to a broad range of data modalities, including binary, count, and continuous observations. We prove that the procedure recovers the true row and column classes when the dimensions of the data matrix tend to infinity, even if the functional form of the data distribution is misspecified. The procedure requires computing a combinatorial search, which can be expensive in practice. Rather than performing this search directly, we propose a new heuristic optimization procedure based on the Kernighan-Lin heuristic, which has nice computational properties and performs well in simulations. We demonstrate our procedure with applications to congressional voting records, and microarray analysis.

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

↑