Web: http://arxiv.org/abs/2009.04550

Jan. 31, 2022, 2:11 a.m. | Nicolas Fraiman, Zichao Li

cs.LG updates on arXiv.org arxiv.org

Biclustering is the task of simultaneously clustering the rows and columns of
the data matrix into different subgroups such that the rows and columns within
a subgroup exhibit similar patterns. In this paper, we consider the case of
producing block-diagonal biclusters. We provide a new formulation of the
biclustering problem based on the idea of minimizing the empirical clustering
risk. We develop and prove a consistency result with respect to the empirical
clustering risk. Since the optimization problem is combinatorial …


More from arxiv.org / cs.LG updates on arXiv.org

Director, Data Science (Advocacy & Nonprofit)

@ Civis Analytics | Remote

Data Engineer

@ Rappi | [CO] Bogotá

Data Scientist V, Marketplaces Personalization (Remote)

@ ID.me | United States (U.S.)

Product OPs Data Analyst (Flex/Remote)

@ Scaleway | Paris

Big Data Engineer

@ Risk Focus | Riga, Riga, Latvia

Internship Program: Machine Learning Backend

@ Nextail | Remote job