Graph Modularity Maximization as an Effective Method for Co-clustering Text Data - Laboratoire d'Informatique PAris DEscartes - EA 2517 Accéder directement au contenu
Article Dans Une Revue Knowledge-Based Systems Année : 2016

Graph Modularity Maximization as an Effective Method for Co-clustering Text Data

Melissa Ailem
  • Fonction : Auteur
  • PersonId : 981394
Mohamed Nadif
  • Fonction : Auteur
  • PersonId : 917201
François Role
  • Fonction : Auteur
  • PersonId : 981395

Résumé

In this paper we show how the modularity measure can serve as a useful criterion for co-clustering document-term matrices. We present and investigate the performance of CoClus, a novel, effective block-diagonal co-clustering algorithm which directly maximizes this modularity measure. The maximization is performed using an iterative alternating optimization procedure, in contrast to algorithms that use spectral relaxations of the discrete optimization problems. Extensive comparative experiments performed on various document-term datasets demonstrate that this approach is very effective, stable, and outperforms other block-diagonal co-clustering algorithms devoted to the same task. Another important advantage of using modularity in the co-clustering context is that it provides a novel, simple way of determining the appropriate number of co-clusters. Availability: an implementation of Coclus is available as part of the recently released coclust Python package which is available at:\\ https://pypi.python.org/pypi/coclust
Fichier non déposé

Dates et versions

hal-01343616 , version 1 (08-07-2016)

Identifiants

Citer

Melissa Ailem, Mohamed Nadif, François Role. Graph Modularity Maximization as an Effective Method for Co-clustering Text Data. Knowledge-Based Systems, 2016, ⟨10.1016/j.knosys.2016.07.002⟩. ⟨hal-01343616⟩
106 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More