On Uniform Concentration Bounds For Bi-Clustering By Using The Vapnik-Chervonenkis Theory

Bi-clustering refers to the task of partitioning the rows and columns of a data matrix simultaneously. Although empirically useful, the theoretical aspects of bi-clustering techniques have not been studied in-depth. We present a framework for investigat-ing the statistical guarantees behind the sparse bi-clustering algorithm by using the Vapnik-Chervonenkis (VC) theory. (C) 2021 Published by Elsevier B.V.