Author:
Awasthi Pranjal,Sheffet Or
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Kumar, A., Kannan, R.: Clustering with spectral norm and the k-means algorithm. In: FOCS (2010)
2. McSherry, F.: Spectral partitioning of random graphs. In: FOCS (2001)
3. Ostrovsky, R., Rabani, Y., Schulman, L.J., Swamy, C.: The effectiveness of lloyd-type methods for the k-means problem. In: FOCS, pp. 165–176 (2006)
4. Dasgupta, S.: Learning mixtures of gaussians. In: FOCS (1999)
5. Dasgupta, S., Schulman, L.: A probabilistic analysis of em for mixtures of separated, spherical gaussians. J. Mach. Learn. Res. (2007)
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献