Spectral algorithms

Foundations and Trends in Theoretical Computer Science

Volumn 4, Issue 3-4, 2009, Pages 157-288

  Kannan, Ravindran ^a   Vempala, Santosh ^b  

^a MICROSOFT RESEARCH   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLIED MATHEMATICS; COMBINATORIAL OPTIMIZATION PROBLEMS; EIGENVALUES; EIGENVECTORS; ERROR BOUND; INPUT DATAS; LOW RANK APPROXIMATIONS; MATRIX; MATRIX COMPUTATION; MODERN APPLICATIONS; NOVEL ALGORITHM; ON THE FLIES; SAMPLING METHOD; SINGULAR VALUES; SINGULAR VECTORS; SPECTRAL ALGORITHM; SPECTRAL METHODS; SPECTRAL PARAMETERS;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTER APPLICATIONS; EIGENVALUES AND EIGENFUNCTIONS; PARAMETER ESTIMATION; SPECTROSCOPY;

MATRIX ALGEBRA;

EID: 70350649112     PISSN: 1551305X     EISSN: 15513068     Source Type: Journal    
DOI: 10.1561/0400000025     Document Type: Article

References (67)

1. D. Achlioptas and F. McSherry, " On Spectral Learning of Mixtures of Distributions" , in Proceedings of COLT, 2005.
2. D. Achlioptas and F. McSherry, " Fast computation of low-rank matrix approximations" , Journal of the ACM, vol. 54, no. 2, 2007.
3. D. Aloise, A. Deshpande, P. Hansen, and P. Popat, " NP-hardness of Euclidean sum-of-squares clustering" , Machine Learning, vol. 75, no. 2, pp. 245-248, 2009.
4. N. Alon, W. De La Vega, R. Kannan, and M. Karpinski, " Random sub-problems of Max-SNP problems" , Proceedings of the 34th Annual ACM Symposium on Theory on Computing, pp. 668-677, 2002.
5. N. Alon, M. Krivelevich, and B. Sudakov, " Finding a large hidden clique in a random graph" , Random Structures and Algorithms, vol. 13, pp. 457-466, 1998.
6. S. Arora and R. Kannan, " Learning mixtures of arbitrary Gaussians" , Annals of Applied Probability, vol. 15, no. 1A, pp. 69-92, 2005.
7. S. Arora, D. Karger, and M. Karpinski, " Polynomial time approximationschemes for dense instances of NP-hard problems" , Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pp. 284-293, 1995.
8. S. Arora, S. Rao, and U. Vazirani, " Expander flows, geometric embeddings and graph partitioning" , in STOC'04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pp. 222-231, 2004.
9. D. Arthur and S. Vassilvitskii, " k-means++: The Advantages of Careful Seeding" , in Proceedings of SODA, 2007.
10. Y. Azar, A. Fiat, A. Karlin, and F. McSherry, " Spectral analysis of data" , in Proceedings of STOC, pp. 619-626, 2001.
11. R. Bhatia, " Matrix factorizations and their perturbations" , Linear Algebra and its applications, vol. 197, 198, pp. 245-276, 1994.
12. R. Bhatia, Matrix Analysis. Springer, 1997.
13. R. Boppana, " Eigenvalues and graph bisection: An average-case analysis" , in Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pp. 280-285, 1987.
14. S. C. Brubaker, " Robust PCA and Clustering on Noisy Mixtures" , in Proceedings of SODA, 2009.
15. S. C. Brubaker and S. Vempala, " Isotropic PCA and affine-invariant clustering" , in Building Bridges Between Mathematics and Computer Science, 19, (M. Grötschel and G. Katona, eds.), Bolyao Society Mathematical Studies, 2008.
16. M. Charikar, S. Guha, Éva Tardos, and D. B. Shmoys, " A constant-factor approximation algorithm for the k-median problem" , in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 1-10, 1999.
17. K. Chaudhuri and S. Rao, " Beyond Gaussians: Spectral Methods for Learning Mixtures of Heavy-Tailed Distributions" , in Proceedings of COLT, 2008.
18. K. Chaudhuri and S. Rao, " Learning mixtures of product distributions using correlations and independence" , in Proceedings of COLT, 2008.
19. D. Cheng, R. Kannan, S. Vempala, and G. Wang, " A divide-and-merge methodology for clustering" , ACM Transactions on Database Systems, vol. 31, no. 4, pp. 1499-1525, 2006.
20. A. Dasgupta, J. Hopcroft, R. Kannan, and P. Mitra, " Spectral clustering with limited independence" , in Proceedings of SODA, pp. 1036-1045, Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, 2007.
21. A. Dasgupta, J. Hopcroft, J. Kleinberg, and M. Sandler, " On learning mixtures of heavy-tailed distributions" , in Proceedings of FOCS, 2005.
22. S. DasGupta, " Learning mixtures of Gaussians" , in Proceedings of FOCS, 1999.
23. S. DasGupta and L. Schulman, " A two-round variant of EM for Gaussian mixtures" , in Proceedings of UAI, 2000.
24. W. F. de-la Vega, " MAX-CUT has a randomized approximation scheme in dense graphs" , Random Structures and Algorithms, vol. 8, pp. 187-199, 1996.
25. W. F. de la Vega, M. Karpinski, R. Kannan, and S. Vempala, " Tensor decomposition and approximation schemes for constraint satisfaction problems" , in STOC'05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pp. 747-754, 2005.
26. W. F. de la Vega, M. Karpinski, and C. Kenyon, " Approximation schemes for metric bisection and partitioning" , in Proceedings of 15th ACM-SIAM SODA, pp. 499-508, 2004.
27. W. F. de la Vega, M. Karpinski, C. Kenyon, and Y. Rabani, " Approximation schemes for clustering problems" , in Proceedings of 35th ACM STOC, pp. 50-58, 2003.
28. W. F. de la Vega and C. Kenyon, " A randomized approximation scheme for metric MAX-CUT" , Journal of Computer and System Sciences, vol. 63, pp. 531-541, 2001.
29. A. Deshpande, L. Rademacher, S. Vempala, and G. Wang, " Matrix approximation and projective clustering via volume sampling" , Theory of Computing, vol. 2, no. 1, pp. 225-247, 2006.
30. A. Deshpande and S. Vempala, " Adaptive sampling and fast low-rank matrix approximation" , in APPROX-RANDOM, pp. 292-303, 2006. (Pubitemid 44577539)
31. P. Drineas and R. Kannan, " Fast Monte-Carlo algorithms for approximate matrix multiplication" , in Proceedings of the 42nd Annual IEEE Symposiumon Foundations of Computer Science, pp. 452-459, 2001.
32. P. Drineas and R. Kannan, " Pass efficient algorithms for approximating large matrices" , in SODA'03: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 223-232, 2003.
33. P. Drineas, R. Kannan, A. Frieze, S. Vempala, and V. Vinay, " Clustering large graphs via the singular value decomposition" , Machine Learning, vol. 56, pp. 9-33, 2004.
34. P. Drineas, R. Kannan, and M. Mahoney, " Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix" , SIAM Journal on Computing, vol. 36, pp. 132-157, 2006. (Pubitemid 46374021)
35. P. Drineas, R. Kannan, and M. Mahoney, " Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix" , SIAM Journal on Computing, vol. 36, pp. 158-183, 2006. (Pubitemid 46374022)
36. P. Drineas, R. Kannan, and M. Mahoney, " Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix" , SIAM Journal on Computing, vol. 36, pp. 184-206, 2006. (Pubitemid 46374023)
37. P. Drineas, I. Kerenidis, and P. Raghavan, " Competitive recommendation systems" , Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 82-90, 2002.
38. R. O. Duda, P. Hart, and D. Stork, Pattern Classification. John Wiley & Sons, 2001.
39. J. Feldman, R. A. Servedio, and R. O'Donnell, " PAC learning axis-aligned mixtures of Gaussians with no separation assumption" , in Proceedings of COLT, pp. 20-34, 2006.
40. A. Frieze and R. Kannan, " The regularity lemma and approximation schemes for dense problems" , Proceedings of the 37th Annual IEEE Symposium on Foundations of Computing, pp. 12-20, 1996.
41. A. Frieze and R. Kannan, " MAX-CUT has a randomized approximation scheme in dense graphs" , Quick Approximation to matrices and applications, vol. 19, no. 2, pp. 175-200, 1999.
42. A. Frieze, R. Kannan, and S. Vempala, " Fast Monte-Carlo algorithms for finding low-rank approximations" , in Proceedings of FOCS, pp. 370-378, 1998.
43. A. Frieze, R. Kannan, and S. Vempala, " Fast Monte-Carlo algorithms for finding low-rank approximations" , Journal of the ACM, vol. 51, no. 6, pp. 1025-1041, 2004.
44. K. Fukunaga, Introduction to Statistical Pattern Recognition. Academic Press, 1990.
45. Z. Füredi and J. Komlós, " The eigenvalues of random symmetric matrices" , Combinatorica, vol. 1, no. 3, pp. 233-241, 1981.
46. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
47. O. Goldreich, S. Goldwasser, and D. Ron, " Property testing and its connection to learning and approximation" , Journal of the ACM, vol. 5, no. 4, pp. 653-750, 1998.
48. G. H. Golub and C. F. van Loan, Matrix Computations. Johns Hopkins University Press, 3rd ed., 1996.
49. S. Har-Peled and K. R. Varadarajan, " Projective clustering in high dimensions using core-sets" , in Symposium on Computational Geometry, pp. 312-318, 2002.
50. P. Indyk, " A sublinear time approximation scheme for clustering in metric spaces" , in Proceedings of 40th IEEE FOCS, pp. 154-159, 1999.
51. R. Kannan, H. Salmasian, and S. Vempala, " The spectral method for general mixture models" , SIAM Journal on Computing, vol. 38, no. 3, pp. 1141-1156, 2008.
52. R. Kannan, S. Vempala, and A. Vetta, " On clusterings: Good, bad and spectral" , Journal of ACM, vol. 51, no. 3, pp. 497-515, 2004.
53. J. A. Kelner, " Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus" , SIAM Journal on Computing, vol. 35, no. 4, pp. 882-902, 2006.
54. F. T. Leighton and S. Rao, " Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms" , Journal of the ACM, vol. 46, no. 6, pp. 787-832, 1999.
55. L. Lovász and S. Vempala, " The geometry of logconcave functions and sampling algorithms" , Random Structures and Algorithms, vol. 30, no. 3, pp. 307-358, 2007.
56. p (1 < p > ∞ )" , Comptes Rendus de l'Académie des sciences, Paris, vol. 303, pp. 289-292, 1986.
57. F. McSherry, " Spectral partitioning of random graphs" , in FOCS, pp. 529-537, 2001.
58. N. Megiddo and A. Tamir, " On the complexity of locating facilities in the plane" , Operations Research Letters, vol. I, pp. 194-197, 1982.
59. C. Papadimitriou, P. Raghavan, H. Tamaki, and S. Vempala, " Latent semantic indexing: A probabilistic analysis" , in Proceedings of PODS, 1998.
60. M. Rudelson, " Random vectors in the isotropic position" , Journal of Functional Analysis, vol. 164, pp. 60-72, 1999.
61. T. Sarlós, " Improved approximation algorithms for large matrices via random projections" , in FOCS, pp. 143-152, 2006.
62. A. Sinclair and M. Jerrum, " Approximate counting, uniform generationand rapidly mixing Markov chains" , Information and Computation, vol. 82, pp. 93-133, 1989.
63. D. A. Spielman and S.-H. Teng, " Spectral partitioning works: Planar graphs and finite element meshes" , Linear Algebra and its Applications, vol. 421, no. 2-3, pp. 284-305, 2007.
64. G. Strang, Linear Algebra and Its Applications. Brooks Cole, 1988.
65. S. Vempala and G. Wang, " A spectral algorithm for learning mixtures of distributions" , Journal of Computer and System Sciences, vol. 68, no. 4, pp. 841-860, 2004.
66. V. H. Vu, " Spectral norm of random matrices" , in Proceedings of STOC, pp. 423-430, 2005.
67. J. Wilkinson, The algebraic eigenvalue problem (paperback ed.). Oxford: Clarendon Press, 1988.