Improved distributed principal component analysis

Advances in Neural Information Processing Systems

Volumn 4, Issue January, 2014, Pages 3113-3121

  Balcan, Maria Florina ^a   Kanchanapally, Vandana ^b   Liang, Yingyu ^c   Woodruff, David ^d  

^a Carnegie Mellon University   (United States)

^b Georgia Institute of Technology   (United States)

^c Princeton University   (United States)

^d IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL EFFICIENCY; COST BENEFIT ANALYSIS; DISTRIBUTED COMPUTER SYSTEMS; GEOMETRY; INFORMATION SCIENCE; PROBABILITY;

COMMUNICATION COST; COMPUTATIONAL COSTS; DOWNSTREAM APPLICATIONS; EMPIRICAL STUDIES; K-MEANS CLUSTERING; LOW RANK APPROXIMATIONS; LOW-DIMENSIONAL SUBSPACE; ORDERS OF MAGNITUDE;

PRINCIPAL COMPONENT ANALYSIS;

EID: 84937837293     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. K. Bache and M. Lichman. UCI machine learning repository, 2013.
2. M.-F. Balcan, S. Ehrlich, and Y. Liang. Distributed k-means and k-median clustering on general communication topologies. In Advances in Neural Information Processing Systems, 2013.
3. D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent dirichlet allocation. the Journal of machine Learning research, 2003.
4. C. Boutsidis, A. Zouzias, M. W. Mahoney, and P. Drineas. Stochastic dimensionality reduction for k-means clustering. CoRR, abs/1110.2897, 2011.
5. K. L. Clarkson and D. P. Woodruff. Low rank approximation and regression in input sparsity time. In Proceedings of the 45th Annual ACM Symposium on Theory of Computing, 2013.
6. M. Cohen, S. Elder, C. Musco, C. Musco, and M. Persu. Dimensionality reduction for k-means clustering and low rank approximation. arXiv preprint arXiv: 1410.6801, 2014.
7. J. C. Corbett, J. Dean, M. Epstein, A. Fikes, C. Frost, J. Furman, S. Ghemawat, A. Gubarev, C. Heiser, P. Hochschild, et al. Spanner: Googles globally-distributed database. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation, 2012.
8. D. Feldman and M. Langberg. A unified framework for approximating and clustering data. In Proceedings of the Annual ACM Symposium on Theory of Computing, 2011.
9. D. Feldman, M. Schmidt, and C. Sohler. Turning big data into tiny data: Constant-size core-sets for k-means, pca and projective clustering. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2013.
10. M. Ghashami and J. M. Phillips. Relative errors for deterministic low-rank matrix approximations. In ACM-SIAM Symposium on Discrete Algorithms, 2014.
11. N. Halko, P.-G. Martinsson, and J. A. Tropp. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM review, 2011.
12. R. Kannan, S. S. Vempala, and D. P. Woodruff. Principal component analysis and higher correlations for distributed data. In Proceedings of the Conference on Learning Theory, 2014.
13. N. Karampatziakis and P. Mineiro. Combining structured and unstructured randomness in large scale pca. CoRR, abs/1310.6304, 2013.
14. Y.-A. Le Borgne, S. Raybaud, and G. Bontempi. Distributed principal component analysis for wireless sensor networks. Sensors, 2008.
15. D. D. Lee and H. S. Seung. Algorithms for non-negative matrix factorization. Advances in Neural Information Processing Systems, 2001.
16. S. V. Macua, P. Belanovic, and S. Zazo. Consensus-based distributed principal component analysis in wireless sensor networks. In Proceedings of the IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2010.
17. X. Meng and M. W. Mahoney. Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression. In Proceedings of the Annual ACM symposium on Symposium on theory of computing, 2013.
18. S. Mitra, M. Agrawal, A. Yadav, N. Carlsson, D. Eager, and A. Mahanti. Characterizing web-based video sharing workloads. ACM Transactions on the Web, 2011.
19. J. Nelson and H. L. Nguyên. Osnap: Faster numerical linear algebra algorithms via sparser subspace embeddings. In IEEE Annual Symposium on Foundations of Computer Science, 2013.
20. C. Olston, J. Jiang, and J. Widom. Adaptive filters for continuous queries over distributed data streams. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 2003.
21. Y. Qu, G. Ostrouchov, N. Samatova, and A. Geist. Principal component analysis for dimension reduction in massive distributed data sets. In Proceedings of IEEE International Conference on Data Mining, 2002.
22. T. Sarlós. Improved approximation algorithms for large matrices via random projections. In IEEE Symposium on Foundations of Computer Science, 2006.