@inproceedings{aslam:scalable,
    author = {Jay Aslam and Fred Reiss and Daniela Rus},
    title = {Scalable Information Organization},
    booktitle = {Proceedings of RIAO 2000 (Content-based information access)},
    year = {2000},
    month = {April},
    pages = {1128--1138},
    publisher = {CID-CASIS},
    copyright = {CID-CASIS},
    address = {Paris, France},
    group = {actcomm,coabs},
    url = {http://agent.cs.dartmouth.edu/papers/aslam:scalable.ps.gz},
    urlpdf = {http://agent.cs.dartmouth.edu/papers/aslam:scalable.pdf},
    keyword = {information retrieval},
    abstract = {We present three scalable extensions of the star algorithm for
information organization that use sampling. The star algorithm organizes a
document collection into clusters that are naturally induced by the topic
structure of collection, via a computationally efficient cover by dense
subgraphs. We also provide supporting data from extensive experiments.}
}