Abstract
AbstractThe exploration and analysis of large high-dimensional data sets calls for well-thought techniques to extract the salient information from the data, such as co-clustering. Latent block models cast co-clustering in a probabilistic framework that extends finite mixture models to the two-way setting. Real-world data sets often contain anomalies which could be of interest per se and may make the results provided by standard, non-robust procedures unreliable. Also estimation of latent block models can be heavily affected by contaminated data. We propose an algorithm to compute robust estimates for latent block models. Experiments on both simulated and real data show that our method is able to resist high levels of contamination and can provide additional insight into the data by highlighting possible anomalies.
Funder
HORIZON EUROPE Non-nuclear direct actions of the Joint Research Centre
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,Statistics and Probability
Reference44 articles.
1. Ailem M, Role F, Nadif M (2015) Co-clustering document-term matrices by direct maximization of graph modularity. In: Proceedings of the 24th ACM international on conference on information and knowledge management, pp 1807–1810, New York, NY, USA, 2015. Association for Computing Machinery
2. Ailem M, Role F, Nadif M (2017) Sparse poisson latent block model for document clustering. IEEE Trans Knowl Data Eng 29(7):1563–1576
3. Biernacki C, Celeux G, Govaert G (2000) Assessing a mixture model for clustering with the integrated completed likelihood. IEEE Trans Pattern Anal Mach Intell 22(7):719–725
4. Biernacki C, Jacques J, Keribin C (2022) A survey on model-based co-clustering: high dimension and estimation challenges. https://hal.archives-ouvertes.fr/hal-03769727
5. Brault V, Lomet A (2015) Methods for co-clustering: a review. Journal de la Societe Française de Statistique 156(3):27–51