Spectral clustering with limited independence

  title={Spectral clustering with limited independence},
  author={Anirban Dasgupta and John E. Hopcroft and Ravi Kannan and Pradipta Mitra},
This paper considers the well-studied problem of clustering a set of objects under a probabilistic model of data in which each object is represented as a vector over the set of features, and there are only k different types of objects. In general, earlier results (mixture models and "planted" problems on graphs) often assumed that all coordinates of all objects are independent random variables. They then appeal to the theory of random matrices in order to infer spectral properties of the… CONTINUE READING