Computing Dense Clusters On-line for Information Organization

@inproceedings{Rus1999ComputingDC,
  title={Computing Dense Clusters On-line for Information Organization},
  author={Javed Aslam Katya Pelekhov Daniela Rus},
  year={1999}
}
We present and analyze the o -line star algorithm for clustering static information systems and the online 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 (V +E). Finally, we provide data… CONTINUE READING
1 Citations
22 References
Similar Papers

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…