Abstract
When dealing with high dimensional sparse data, such as in recommender systems,co-clusteringturnsouttobemorebeneficialthanone-sidedclustering,even if one is interested in clustering along one dimension only. Thereby, co-clusterwise is a natural extension of clusterwise. Unfortunately, all of the existing approaches do not consider covariates on both dimensions of a data matrix. In this paper, we propose a Latent Block Regression Model (LBRM) overcoming this limit. For inference, we propose an algorithm performing simultaneously co-clustering and regression where a linear regression model characterizes each block. Placing the estimate of the model parameters under the maximum likelihood approach, we derive a Variational Expectation–Maximization (VEM) algorithm for estimating the model’s parameters. The finality of the proposed VEM-LBRM is illustrated through simulated datasets.
Chapter PDF
Similar content being viewed by others
References
Affeldt, S., Labiod, L., Nadif, M.: Regularized bi-directional co-clustering. Statistics and Computing, 31(3), 1-17 (2021)
Agarwal, D., and Merugu, S.: Predictive discrete latent factor models for large scale dyadic data. In: SIGKDD, pp. 26–35 (2007)
Dempster, A. P., Laird, N. M., Rubin, D. B.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society Series B (Methodological), 39(1), 1–22 (1977)
Deodhar, M., Ghosh, J.: A framework for simultaneous co-clustering and learning from complex data. In: SIGKDD, pp. 250–259 (2007)
DeSarbo, W. S., and Cron, W. L.: A maximum likelihood methodology for clusterwise linear regression. Journal of Classification, 5(2), 249–282 (1988)
Govaert, G., Nadif, M.: Clustering with block mixture models. Pattern Recognition, 36, 463-473, (2003)
Govaert, G., Nadif, M.: An EM algorithm for the block mixture model. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(4), 643–647 (2005)
Govaert, G., Nadif, M.: Block clustering with Bernoulli mixture models: Comparison of different approaches. Computational Statistics & Data Analysis, 3233–3245 (2008)
Govaert, G., Nadif, M.: Co-clustering: Models, Algorithms and Applications. John Wiley & Sons (2013)
Ingrassia, S., Minotti, S. C., Punzo, A.: Model-based clustering via linear cluster-weighted models. Computational Statistics & Data Analysis, 71, 159–182 (2014)
Ingrassia, S., Minotti, S. C., Vittadini, G.: Local statistical modeling via a cluster-weighted approach with elliptical distributions. In: Journal of Classification, 29(3), 363–401 (2012)
Neal, R. M., Hinton, G. E.: A view of the EM algorithm that justifies incremental, sparse, and other variants. In Learning in Graphical Models, pp. 355–368. Springer (1998)
Salah, A., Nadif, M.: Directional co-clustering. Advances in Data Analysis and Classification, 13(3), 591-620 (2019)
Späth, H.: Algorithm 39 clusterwise linear regression. Computing, 22(4), 367–373 (1979)
Steinley, D.: Properties of the Hubert–Arable Adjusted Rand Index. Psychological Methods, 9(3), 386 (2004)
Strehl, A., Ghosh, J.: Cluster ensembles—a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research, 3, 583–617 (2002)
Vu, D., Aitkin, M.: Variational algorithms for biclustering models. Computational Statistics & Data Analysis, 89, 12–24 (2015)
Acknowledgements
Our work is funded by the German Federal Ministry of Education and Research under Grant Agreement Number 01IS19084F (XAPS).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Copyright information
© 2023 The Author(s)
About this paper
Cite this paper
Boutalbi, R., Labiod, L., Nadif, M. (2023). Latent Block Regression Model. In: Brito, P., Dias, J.G., Lausen, B., Montanari, A., Nugent, R. (eds) Classification and Data Science in the Digital Age. IFCS 2022. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Cham. https://doi.org/10.1007/978-3-031-09034-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-031-09034-9_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-09033-2
Online ISBN: 978-3-031-09034-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)