@TechReport{Dartmouth:TR97-324,
  author = {J. Aslam and K. Pelekhov and Daniela Rus},
  title = {{Computing Dense Clusters On-line for Information Organization}},
  institution = {Dartmouth College, Computer Science},
  address = {Hanover, NH},
  number = {PCS-TR97-324},
  year = {1997},
  month = {October},
  URL = {http://www.cs.dartmouth.edu/reports/TR97-324.ps.Z},
  comment = {
    Submitted to the 1998 SIGIR Conference.
  },
  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 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.
  }
}