Technical Report Number
We present and analyze the off-line star algorithm for clustering static information systems and the on-line star algorithm for clustering dynamic information systems. These algorithms partition a document collection into a number of clusters that is naturally induced by the collection. We show a lower bound on the accuracy of the clusters produced by these algorithms. We use the random graph model to show that both star algorithms produce correct clusters in time Theta(V + E). Finally, we provide data from extensive experiments.
Dartmouth Digital Commons Citation
Aslam, Javed; Pelekhov, Katya; and Rus, Daniela, "Computing Dense Clusters On-line for Information Organization" (1997). Computer Science Technical Report PCS-TR97-324. https://digitalcommons.dartmouth.edu/cs_tr/157