@misc{aslam:clustering,
    author = {Javed Aslam and Katya Pelekhov and Daniela Rus},
    title = {A Practical Clustering Algorithm for Static and Dynamic Information
Organization},
    booktitle = {{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A
Conference on Theoretical and Experimental Analysis of Discrete Algorithms)},
    year = {1999},
    copyright = {the authors},
    group = {actcomm},
    url = {http://agent.cs.dartmouth.edu/papers/aslam:clustering.ps.gz},
    keyword = {information retrieval, clustering},
    abstract = {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 organize a document collection
into a number of clusters that is 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 efficient (running times roughly linear
in the size of the problem). Finally, we provide data from a number of
experiments.}
}