Incremental clustering for dynamic information processing

  • Authors:
  • Fazli Can

  • Affiliations:
  • Miami Univ., Oxford, OH

  • Venue:
  • ACM Transactions on Information Systems (TOIS)
  • Year:
  • 1993

Quantified Score

Hi-index 0.03

Visualization

Abstract

Clustering of very large document databases is useful for both searching and browsing. The periodic updating of clusters is required due to the dynamic nature of databases. An algorithm for incremental clustering is introduced. The complexity and cost analysis of the algorithm together with an investigation of its expected behavior are presented. Through empirical testing it is shown that the algorithm achieves cost effectiveness and generates statistically valid clusters that are compatible with those of reclustering. The experimental evidence shows that the algorithm creates an effective and efficient retrieval environment.