Efficient and Effective Optimal Transport-Based Biclustering

Chakib Fettal · lazhar labiod · Mohamed NADIF

Hall J #409

Keywords: [ Biclustering ] [ optimal transport ]


Bipartite graphs can be used to model a wide variety of dyadic information such as user-rating, document-term, and gene-disorder pairs. Biclustering is an extension of clustering to the underlying bipartite graph induced from this kind of data. In this paper, we leverage optimal transport (OT) which has gained momentum in the machine learning community to propose a novel and scalable biclustering model that generalizes several classical biclustering approaches. We perform extensive experimentation to show the validity of our approach compared to other OT biclustering algorithms along both dimensions of the dyadic datasets.

Chat is not available.