Incremental clustering and dynamic information retrieval

Moses Charikar, Chandra Chekuri, Tomas Feder, Rajeev Motwani

Research output: Contribution to journalArticlepeer-review

Abstract

Motivated by applications such as document and image classification in information retrieval, we consider the problem of clustering dynamic point sets in a metric space. We propose a model called incremental clustering which is based on a careful analysis of the requirements of the information retrieval application, and which should also be useful in other applications. The goal is to efficiently maintain clusters of small diameter as new points are inserted. We analyze several natural greedy algorithms and demonstrate that they perform poorly. We propose new deterministic and randomized incremental clustering algorithms which have a provably good performance, and which we believe should also perform well in practice. We complement our positive results with lower bounds on the performance of incremental algorithms. Finally, we consider the dual clustering problem where the clusters are of fixed diameter, and the goal is to minimize the number of clusters.

Original languageEnglish (US)
Pages (from-to)1417-1440
Number of pages24
JournalSIAM Journal on Computing
Volume33
Issue number6
DOIs
StatePublished - 2004
Externally publishedYes

Keywords

  • Agglomerative clustering
  • Dynamic information retrieval
  • Incremental clustering
  • K-center
  • Minimum diameter clustering
  • Performance guarantee

ASJC Scopus subject areas

  • General Computer Science
  • General Mathematics

Fingerprint

Dive into the research topics of 'Incremental clustering and dynamic information retrieval'. Together they form a unique fingerprint.

Cite this