On uniform concentration bounds for Bi-clustering by using the Vapnik–Chervonenkis theory
Saptarshi Chakraborty and
Statistics & Probability Letters, 2021, vol. 175, issue C
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 investigating the statistical guarantees behind the sparse bi-clustering algorithm by using the Vapnik–Chervonenkis (VC) theory.
Keywords: Bi-clustering; VC theory; Strong consistency (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
Full text for ScienceDirect subscribers only
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:175:y:2021:i:c:s016771522100064x
Ordering information: This journal article can be ordered from
https://shop.elsevie ... _01_ooc_1&version=01
Access Statistics for this article
Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul
More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().