arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.03223stat.MLcs.LGstat.ME
收藏

联合Dirichlet过程

Conjoined Dirichlet Process

University of California at Irvine(加州大学欧文分校);University of California at Santa Barbara(加州大学圣巴巴拉分校)

Michelle N. Ngo, Dustin S. Pluta, Alexander N. Ngo, Babak Shahbaba

摘要:

双聚类是一类同时聚类矩阵的行和列以将异构数据排序到同质块中的技术。虽然已经提出了许多算法来找到biclusters,现有的方法遭受的预规范的biclusters的数量或地方的模型结构上的限制。为了解决这些问题,我们开发了一种新的,非参数的概率双聚类方法的基础上狄利克雷过程,以确定双聚类具有很强的共生在行和列。所提出的方法利用双Dirichlet过程混合模型来学习行和列聚类,得到的聚类数由数据确定,而不是预先指定。通过对行簇和列簇之间的相互依赖进行建模来识别概率双簇。我们将我们的方法应用于两个不同的应用程序,文本挖掘和基因表达分析,并证明我们的方法在许多设置相比,现有的方法提高了双聚类提取。

英文摘要:

Biclustering is a class of techniques that simultaneously clusters the rows and columns of a matrix to sort heterogeneous data into homogeneous blocks. Although many algorithms have been proposed to find biclusters, existing methods suffer from the pre-specification of the number of biclusters or place constraints on the model structure. To address these issues, we develop a novel, non-parametric probabilistic biclustering method based on Dirichlet processes to identify biclusters with strong co-occurrence in both rows and columns. The proposed method utilizes dual Dirichlet process mixture models to learn row and column clusters, with the number of resulting clusters determined by the data rather than pre-specified. Probabilistic biclusters are identified by modeling the mutual dependence between the row and column clusters. We apply our method to two different applications, text mining and gene expression analysis, and demonstrate that our method improves bicluster extraction in many settings compared to existing approaches.

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

↑