Article Dans Une Revue Advances in Data Analysis and Classification Année : 2024

A sparse exponential family latent block model for co-clustering

Saeid Hoseinipour
Adel Mohammadpour
Mohamed Nadif

Résumé

Over the last decades, co-clustering models have spawned a number of algorithms showing the advantages that co-clustering can have over clustering. This is especially true for sparse high-dimensional data such as document-word matrices, which are our focus here. This proposal uses Latent Block Models (LBMs), rigorous statistical models that offer a variety of benefits in terms of flexibility, parsimony, and effectiveness. LBMs have been proposed in relation to different data types. This paper aims to embed existing and new models in a unified framework, focusing on exponential family LBM (ELBM) and the classification maximum likelihood approach. We then extend these models to include sparse versions, known as SELBM, taking into account the sparsity of datasets. The matrix formulations that we propose lead to simplified algorithms capable of addressing various types of data effectively.
Fichier sous embargo
Fichier sous embargo
0 3 6
Année Mois Jours
Avant la publication
samedi 26 avril 2025
Fichier sous embargo
samedi 26 avril 2025
Connectez-vous pour demander l'accès au fichier

Dates et versions

hal-04855166 , version 1 (14-01-2025)

Identifiants

Citer

Saeid Hoseinipour, Mina Aminghafari, Adel Mohammadpour, Mohamed Nadif. A sparse exponential family latent block model for co-clustering. Advances in Data Analysis and Classification, 2024, ⟨10.1007/s11634-024-00608-3⟩. ⟨hal-04855166⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More