IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v175y2021ics016771522100064x.html
   My bibliography  Save this article

On uniform concentration bounds for Bi-clustering by using the Vapnik–Chervonenkis theory

Author

Listed:
  • Chakraborty, Saptarshi
  • Das, Swagatam

Abstract

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.

Suggested Citation

  • Chakraborty, Saptarshi & Das, Swagatam, 2021. "On uniform concentration bounds for Bi-clustering by using the Vapnik–Chervonenkis theory," Statistics & Probability Letters, Elsevier, vol. 175(C).
  • Handle: RePEc:eee:stapro:v:175:y:2021:i:c:s016771522100064x
    DOI: 10.1016/j.spl.2021.109102
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S016771522100064X
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.spl.2021.109102?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gallegos, María Teresa & Ritter, Gunter, 2013. "Strong consistency of k-parameters clustering," Journal of Multivariate Analysis, Elsevier, vol. 117(C), pages 14-31.
    2. Eric C. Chi & Genevera I. Allen & Richard G. Baraniuk, 2017. "Convex biclustering," Biometrics, The International Biometric Society, vol. 73(1), pages 10-19, March.
    3. Mihee Lee & Haipeng Shen & Jianhua Z. Huang & J. S. Marron, 2010. "Biclustering via Sparse Singular Value Decomposition," Biometrics, The International Biometric Society, vol. 66(4), pages 1087-1095, December.
    4. Yoshikazu Terada, 2014. "Strong Consistency of Reduced K-means Clustering," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 41(4), pages 913-931, December.
    5. Yoshikazu Terada, 2015. "Strong consistency of factorial $$K$$ K -means clustering," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 67(2), pages 335-357, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Pi, J. & Wang, Honggang & Pardalos, Panos M., 2021. "A dual reformulation and solution framework for regularized convex clustering problems," European Journal of Operational Research, Elsevier, vol. 290(3), pages 844-856.
    2. Li, Gen, 2020. "Generalized Co-clustering Analysis via Regularized Alternating Least Squares," Computational Statistics & Data Analysis, Elsevier, vol. 150(C).
    3. Gong, Tingnan & Zhang, Weiping & Chen, Yu, 2023. "Uncovering block structures in large rectangular matrices," Journal of Multivariate Analysis, Elsevier, vol. 198(C).
    4. Gautier Marti & Frank Nielsen & Philippe Donnat & S'ebastien Andler, 2016. "On clustering financial time series: a need for distances between dependent random variables," Papers 1603.07822, arXiv.org.
    5. Hu, Jianhua & Liu, Xiaoqian & Liu, Xu & Xia, Ningning, 2022. "Some aspects of response variable selection and estimation in multivariate linear regression," Journal of Multivariate Analysis, Elsevier, vol. 188(C).
    6. Jie Chen & Joe Suzuki, 2021. "An Efficient Algorithm for Convex Biclustering," Mathematics, MDPI, vol. 9(23), pages 1-18, November.
    7. Gautier Marti & Sébastien Andler & Frank Nielsen & Philippe Donnat, 2016. "Clustering Financial Time Series: How Long is Enough?," Post-Print hal-01400395, HAL.
    8. Kun Chen & Kung-Sik Chan & Nils Chr. Stenseth, 2014. "Source-Sink Reconstruction Through Regularized Multicomponent Regression Analysis-With Application to Assessing Whether North Sea Cod Larvae Contributed to Local Fjord Cod in Skagerrak," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 109(506), pages 560-573, June.
    9. Yoshikazu Terada, 2015. "Strong consistency of factorial $$K$$ K -means clustering," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 67(2), pages 335-357, April.
    10. Binhuan Wang & Lanqiu Yao & Jiyuan Hu & Huilin Li, 2023. "A New Algorithm for Convex Biclustering and Its Extension to the Compositional Data," Statistics in Biosciences, Springer;International Chinese Statistical Association, vol. 15(1), pages 193-216, April.
    11. Matteo Farnè & Angelos T. Vouldis, 2021. "Banks’ business models in the euro area: a cluster analysis in high dimensions," Annals of Operations Research, Springer, vol. 305(1), pages 23-57, October.
    12. Jiangtao Duan & Wei Gao & Hao Qu & Hon Keung Tony, 2019. "Subspace Clustering for Panel Data with Interactive Effects," Papers 1909.09928, arXiv.org, revised Feb 2021.
    13. Eric C. Chi & Genevera I. Allen & Richard G. Baraniuk, 2017. "Convex biclustering," Biometrics, The International Biometric Society, vol. 73(1), pages 10-19, March.
    14. Hongtu Zhu & Dan Shen & Xuewei Peng & Leo Yufeng Liu, 2017. "MWPCR: Multiscale Weighted Principal Component Regression for High-Dimensional Prediction," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 112(519), pages 1009-1021, July.
    15. Shen, Dan & Shen, Haipeng & Marron, J.S., 2013. "Consistency of sparse PCA in High Dimension, Low Sample Size contexts," Journal of Multivariate Analysis, Elsevier, vol. 115(C), pages 317-333.
    16. María Teresa Gallegos & Gunter Ritter, 2018. "Probabilistic clustering via Pareto solutions and significance tests," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(2), pages 179-202, June.
    17. Aaditya V Rangan & Caroline C McGrouther & John Kelsoe & Nicholas Schork & Eli Stahl & Qian Zhu & Arjun Krishnan & Vicky Yao & Olga Troyanskaya & Seda Bilaloglu & Preeti Raghavan & Sarah Bergen & Ande, 2018. "A loop-counting method for covariate-corrected low-rank biclustering of gene-expression and genome-wide association study data," PLOS Computational Biology, Public Library of Science, vol. 14(5), pages 1-29, May.
    18. Hung-Chia Chen & Wen Zou & Tzu-Pin Lu & James J Chen, 2014. "A Composite Model for Subgroup Identification and Prediction via Bicluster Analysis," PLOS ONE, Public Library of Science, vol. 9(10), pages 1-14, October.
    19. Gautier Marti & S'ebastien Andler & Frank Nielsen & Philippe Donnat, 2016. "Clustering Financial Time Series: How Long is Enough?," Papers 1603.04017, arXiv.org, revised Apr 2016.
    20. Matteo Barigozzi, 2023. "Quasi Maximum Likelihood Estimation of High-Dimensional Factor Models: A Critical Review," Papers 2303.11777, arXiv.org, revised Dec 2023.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:175:y:2021:i:c:s016771522100064x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.