IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v39y2024i3d10.1007_s00180-023-01373-1.html
   My bibliography  Save this article

Fast and consistent algorithm for the latent block model

Author

Listed:
  • Vincent Brault

    (Univ. Grenoble Alpes, CNRS, Grenoble INP, LJK)

  • Antoine Channarond

    (Université de Rouen Normandie)

Abstract

The latent block model is used to simultaneously rank the rows and columns of a matrix to reveal a block structure. The algorithms used for estimation are often time consuming. However, recent work shows that the log-likelihood ratios are equivalent under the complete and observed (with unknown labels) models and the groups posterior distribution to converge as the size of the data increases to a Dirac mass located at the actual groups configuration. Based on these observations, the algorithm Largest Gaps is proposed in this paper to perform clustering using only the marginals of the matrix, when the number of blocks is very small with respect to the size of the whole matrix in the case of binary data. In addition, a model selection method is incorporated with a proof of its consistency. Thus, this paper shows that studying simplistic configurations (few blocks compared to the size of the matrix or very contrasting blocks) with complex algorithms is useless since the marginals already give very good parameter and classification estimates.

Suggested Citation

  • Vincent Brault & Antoine Channarond, 2024. "Fast and consistent algorithm for the latent block model," Computational Statistics, Springer, vol. 39(3), pages 1621-1657, May.
    • Handle: RePEc:spr:compst:v:39:y:2024:i:3:d:10.1007_s00180-023-01373-1
    DOI: 10.1007/s00180-023-01373-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00180-023-01373-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00180-023-01373-1?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Maria Iannario, 2010. "On the identifiability of a mixture model for ordinal data," Metron - International Journal of Statistics, Dipartimento di Statistica, Probabilità e Statistiche Applicate - University of Rome, vol. 0(1), pages 87-94.
    2. Timothée Tabouy & Pierre Barbillon & Julien Chiquet, 2020. "Variational Inference for Stochastic Block Models From Sampled Data," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 115(529), pages 455-466, January.
    3. Bhatia, Parmeet Singh & Iovleff, Serge & Govaert, Gérard, 2017. "blockcluster: An R Package for Model-Based Co-Clustering," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 76(i09).
    4. Pierre Barbillon & Sophie Donnet & Emmanuel Lazega & Avner Bar-Hen, 2017. "Stochastic block models for multiplex networks: an application to a multilevel network of researchers," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 180(1), pages 295-314, January.
    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. Blazquez-Soriano, Amparo & Ramos-Sandoval, Rosmery, 2022. "Information transfer as a tool to improve the resilience of farmers against the effects of climate change: The case of the Peruvian National Agrarian Innovation System," Agricultural Systems, Elsevier, vol. 200(C).
    2. Domenico Piccolo & Rosaria Simone, 2019. "The class of cub models: statistical foundations, inferential issues and empirical evidence," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 28(3), pages 389-435, September.
    3. Gennaro Punzo & Rosalia Castellano & Mirko Buonocore, 2018. "Job Satisfaction in the “Big Four” of Europe: Reasoning Between Feeling and Uncertainty Through CUB Models," Social Indicators Research: An International and Interdisciplinary Journal for Quality-of-Life Measurement, Springer, vol. 139(1), pages 205-236, August.
    4. Manisera, Marica & Zuccolotto, Paola, 2014. "Modeling rating data with Nonlinear CUB models," Computational Statistics & Data Analysis, Elsevier, vol. 78(C), pages 100-118.
    5. Selosse, Margot & Jacques, Julien & Biernacki, Christophe, 2020. "Model-based co-clustering for mixed type data," Computational Statistics & Data Analysis, Elsevier, vol. 144(C).
    6. Pavel N. Krivitsky & Laura M. Koehly & Christopher Steven Marcum, 2020. "Exponential-Family Random Graph Models for Multi-Layer Networks," Psychometrika, Springer;The Psychometric Society, vol. 85(3), pages 630-659, September.
    7. Zaheer Ahmed & Alberto Cassese & Gerard Breukelen & Jan Schepers, 2023. "E-ReMI: Extended Maximal Interaction Two-mode Clustering," Journal of Classification, Springer;The Classification Society, vol. 40(2), pages 298-331, July.
    8. Stefania Capecchi & Rosaria Simone, 2019. "A Proposal for a Model-Based Composite Indicator: Experience on Perceived Discrimination in Europe," Social Indicators Research: An International and Interdisciplinary Journal for Quality-of-Life Measurement, Springer, vol. 141(1), pages 95-110, January.
    9. Lorenzo Federico & Ayoub Mounim & Pierpaolo D’Urso & Livia De Giovanni, 2024. "Complex networks and deep learning for copper flow across countries," Annals of Operations Research, Springer, vol. 339(1), pages 937-963, August.
    10. C. Biernacki & J. Jacques & C. Keribin, 2023. "A Survey on Model-Based Co-Clustering: High Dimension and Estimation Challenges," Journal of Classification, Springer;The Classification Society, vol. 40(2), pages 332-381, July.
    11. Chabert-Liddell, Saint-Clair & Barbillon, Pierre & Donnet, Sophie & Lazega, Emmanuel, 2021. "A stochastic block model approach for the analysis of multilevel networks: An application to the sociology of organizations," Computational Statistics & Data Analysis, Elsevier, vol. 158(C).
    12. Todorov, Diman & Setchi, Rossi, 2014. "Time-efficient estimation of conditional mutual information for variable selection in classification," Computational Statistics & Data Analysis, Elsevier, vol. 72(C), pages 105-127.
    13. Rosaria Simone, 2021. "An accelerated EM algorithm for mixture models with uncertainty for rating data," Computational Statistics, Springer, vol. 36(1), pages 691-714, March.
    14. Iannario, Maria & Piccolo, Domenico, 2014. "A theorem on CUB models for rank data," Statistics & Probability Letters, Elsevier, vol. 91(C), pages 27-31.
    15. Evan Sadler, 2025. "Seeding a Simple Contagion," Econometrica, Econometric Society, vol. 93(1), pages 71-93, January.
    16. Stefania Capecchi & Maria Iannario & Rosaria Simone, 2018. "Well-Being and Relational Goods: A Model-Based Approach to Detect Significant Relationships," Social Indicators Research: An International and Interdisciplinary Journal for Quality-of-Life Measurement, Springer, vol. 135(2), pages 729-750, January.
    17. Federica Cugnata & Silvia Salini, 2014. "Model-based approach for importance–performance analysis," Quality & Quantity: International Journal of Methodology, Springer, vol. 48(6), pages 3053-3064, November.
    18. Romina Gambacorta & Maria Iannario, 2013. "Measuring Job Satisfaction with CUB Models," LABOUR, CEIS, vol. 27(2), pages 198-224, June.
    19. Fabio Ashtar Telarico, 2024. "A Network Approach to the Study of the Military–Industrial–Media Complex in Bulgaria," Economic Thought journal, Bulgarian Academy of Sciences - Economic Research Institute, issue 4, pages 442-463.
    20. Gaucher, Solenne & Klopp, Olga & Robin, Geneviève, 2021. "Outlier detection in networks with missing links," Computational Statistics & Data Analysis, Elsevier, vol. 164(C).

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:spr:compst:v:39:y:2024:i:3:d:10.1007_s00180-023-01373-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.