arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1807.07830cs.DS
收藏

基于改进矩阵带宽最小化和生物地理学优化的双聚类算法

Biclustering Using Modified Matrix Bandwidth Minimization and Biogeography-based Optimization

Briti Deb, Indrajit Mukherjee

摘要:

在数据矩阵的行和列中具有不同的实体集合的数据矩阵被称为双模式数据或隶属关系数据。许多实际问题需要通过同时聚类行和列来找到两种模式之间的关系,这一问题通常称为双聚类。我们提出了一种新的biclustering算法,通过使用矩阵重排的方法引入Cuthill-McKee的带宽最小化算法,并适应它的操作非方形和非二进制矩阵,而不需要先验地知道自然发生的biclusters的数量。这将双模式矩阵变换为几乎块对角,其中块指示矩阵的两个模式之间的簇。为了优化带宽最小化问题,我们采用了基于生物地理学的优化算法,使用逻辑斯蒂方程来建模其迁移率。初步研究表明,该技术可以揭示数据中潜在的双聚类,并有潜力进一步研究的双模式数据分析。

英文摘要:

Data matrix having different sets of entities in its rows and columns are known as two mode data or affiliation data. Many practical problems require to find relationships between the two modes by simultaneously clustering the rows and columns, a problem commonly known as biclustering. We propose a novel biclustering algorithm by using matrix reordering approach introduced by Cuthill-McKee's bandwidth minimization algorithm, and adapting it to operate on non-square and non-binary matrices, without the need to know apriori the number of naturally occurring biclusters. This transforms a two-mode matrix into almost block diagonals, where the blocks indicate the clusters between the two modes of the matrix. To optimize the bandwidth minimization problem, we adapted the Biogeography-based Optimization algorithm using logistic equation to model its migration rates. Preliminary studies indicate that this technique can reveal the underlying biclusters in the data and has potential of further research for two-mode data analysis.

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

↑