Skip to main navigation Skip to search Skip to main content

Diagonal co-clustering algorithm for document-word partitioning

  • Université de Paris

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

We propose a novel diagonal co-clustering algorithm built upon the double Kmeans to address the problem of document-word coclustering. At each iteration, the proposed algorithm seeks for a diagonal block structure of the data by minimizing a criterion based on the variance within and the centroid effect. In addition to be easy-to-interpret and efficient on sparse binary and continuous data, Diagonal Double Kmeans (DDKM) is also faster than other state-of-the art clustering algorithms. We illustrate our contribution using real datasets commonly used in document clustering.

Original languageEnglish
Title of host publicationAdvances in Intelligent Data Analysis XIV - 14th International Symposium, IDA 2015, Proceedings
EditorsElisa Fromont, Tijl De Bie, Matthijs van Leeuwen
PublisherSpringer Verlag
Pages170-180
Number of pages11
ISBN (Print)9783319244648
DOIs
Publication statusPublished - 1 Jan 2015
Externally publishedYes
Event14th International Symposium on Intelligent Data Analysis, IDA 2015 - Saint Etienne, France
Duration: 22 Oct 201524 Oct 2015

Publication series

NameLecture Notes in Computer Science
Volume9385
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Symposium on Intelligent Data Analysis, IDA 2015
Country/TerritoryFrance
CitySaint Etienne
Period22/10/1524/10/15

Fingerprint

Dive into the research topics of 'Diagonal co-clustering algorithm for document-word partitioning'. Together they form a unique fingerprint.

Cite this