Co-Clustering Under the Maximum Norm - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Co-Clustering Under the Maximum Norm

Résumé

Co-clustering, that is, partitioning a matrix into " homogeneous " submatrices, has many applications ranging from bioinformatics to election analysis. Many interesting variants of co-clustering are NP-hard. We focus on the basic variant of co-clustering where the homogeneity of a submatrix is defined in terms of minimizing the maximum distance between two entries. In this context, we spot several NP-hard as well as a number of relevant polynomial-time solvable special cases, thus charting the border of tractability for this challenging data clustering problem. For instance, we provide polynomial-time solvability when having to partition the rows and columns into two subsets each (meaning that one obtains four submatrices). When partitioning rows and columns into three subsets each, however, we encounter NP-hardness even for input matrices containing only values from {0, 1, 2}.
Fichier principal
Vignette du fichier
BFHN-isaac14.pdf (437.92 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01260592 , version 1 (22-01-2016)

Identifiants

Citer

Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier. Co-Clustering Under the Maximum Norm. ISAAC, 2014, Jeonju, South Korea. ⟨10.1007/978-3-319-13075-0_24⟩. ⟨hal-01260592⟩
20 Consultations
70 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More