The Star Clustering Algorithm for Information Organization

  • J.A. Aslam
  • E. Pelekhov
  • D. Rus


We present the star clustering algorithm for static and dynamic information organization. The offline star algorithm can be used for clustering static information systems, and the online star algorithm can be used for clustering dynamic information systems. These algorithms organize a data collection into a number of clusters that are naturally induced by the collection via a computationally efficient cover by dense subgraphs. We further show a lower bound on the accuracy of the clusters produced by these algorithms as well as demonstrate that these algorithms are computationally efficient. Finally, we discuss a number of applications of the star clustering algorithm and provide results from a number of experiments with the Text Retrieval Conference data.


Random Graph Online Algorithm Vector Space Model Star Center Information Organization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • J.A. Aslam
    • 1
  • E. Pelekhov
    • 2
  • D. Rus
    • 3
  1. 1.College of Computer and Information ScienceNortheastern UniversityBostonUSA
  2. 2.Department of Computer ScienceDartmouth CollegeHanoverUSA
  3. 3.Computer Science and Artificial Intelligence LaboratoryMassachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations