Distributed column subset selection on MapReduce

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2013, Pages 171-180

  Farahat, Ahmed K ^a   Elgohary, Ahmed ^a   Ghodsi, Ali ^a   Kamel, Mohamed S ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Big Data; Column Subset Selection; Distributed Computing; Greedy Algorithms; MapReduce

Indexed keywords

EID: 84894656842     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2013.155     Document Type: Conference Paper

References (29)

1. A. K. Jain and R. C. Dubes, Algorithms for Clustering Data. Upper Saddle River, NJ, USA: Prentice-Hall, Inc., 1988.
2. L. Kaufman and p. Rousseeuw, "Clustering by means of medoids," Technische Hogeschool, Delft (Netherlands). Department of Mathematics and Informatics, Tech. Rep., 1987.
3. S. Deerwester, S. Dumais, G. Furnas, T. Landauer, and R. Harshman, "Indexing by latent semantic analysis," Journal of the American Society for Information Science and Technology, vol. 41, no. 6, pp. 391-407, 1990.
4. C. Boutsidis, J. Sun, and N. Anerousis, "Clustered subset selection and its applications on it service metrics," in Proceedings of the Seventeenth ACM Conference on Information and Knowledge Management (CIKM'08), 2008, pp. 599-608.
5. C. Boutsidis, M. W. Mahoney, and p. Drineas, "An improved approximation algorithm for the column subset selection problem," in Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'09), 2009, pp. 968-977.
6. C. Boutsidis, p. Drineas, and M. Magdon-Ismail, "Near optimal column-based matrix reconstruction," in Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'11), 2011, pp. 305-314.
7. J. Dean and S. Ghemawat, "MapReduce: Simplified data processing on large clusters," Communications of the ACM, vol. 51, no. 1, pp. 107-113, 2008.
8. T. White, Hadoop: The Definitive Guide, 1st ed. O'Reilly Media, Inc., 2009.
9. A. Frieze, R. Kannan, and S. Vempala, "Fast Monte-Carlo algorithms for finding low-rank approximations," in Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS'98), 1998, pp. 370-378.
10. p. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay, "Clustering large graphs via the singular value decomposition," Machine Learning, vol. 56, no. 1-3, pp. 9-33, 2004.
11. 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, no. 1, pp. 158-183, 2007.
12. p. Drineas, M. Mahoney, and S. Muthukrishnan, "Subspace sampling and relative-error matrix approximation: Column-based methods," in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer Berlin/Heidelberg, 2006, pp. 316-326.
13. 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.
14. A. Çivril and M. Magdon-Ismail, "Column subset selection via sparse approximation of SVD," Theoretical Computer Science, vol. 421, no. 0, pp. 1-14, 2012.
15. A. K. Farahat, A. Ghodsi, and M. S. Kamel, "An efficient greedy method for unsupervised feature selection," in Proceedings of the Eleventh IEEE International Conference on Data Mining (ICDM'11), 2011, pp. 161-170.
16. -, "Efficient greedy feature selection for unsupervised learning," Knowledge and Information Systems, vol. 35, no. 2, pp. 285-310, 2013.
17. T. Elsayed, J. Lin, and D. W. Oard, "Pairwise document similarity in large collections with MapReduce," in Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (HLT'08), 2008, pp. 265-268.
18. A. Ene, S. Im, and B. Moseley, "Fast clustering using MapReduce," in Proceedings of the Seventeenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'11), 2011, pp. 681-689.
19. H. Karloff, S. Suri, and S. Vassilvitskii, "A model of computation for MapReduce," in Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'10), 2010, pp. 938-948.
20. S. Dasgupta and A. Gupta, "An elementary proof of a theorem of Johnson and Lindenstrauss," Random Structures and Algorithms, vol. 22, no. 1, pp. 60-65, 2003.
21. D. Achlioptas, "Database-friendly random projections: Johnson-Lindenstrauss with binary coins," Journal of computer and System Sciences, vol. 66, no. 4, pp. 671-687, 2003.
22. p. Li, T. J. Hastie, and K. W. Church, "Very sparse random projections," in Proceedings of the Twelfth ACM SIGKDD international conference on Knowledge Discovery and Data Mining (KDD'06), 2006, pp. 287-296.
23. G. Golub and C. Van Loan, Matrix Computations, 3rd ed. Johns Hopkins Univ Pr, 1996.
24. A. Deshpande and L. Rademacher, "Efficient volume sampling for row/column subset selection," in Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS'10), 2010, pp. 329-338.
25. V. Guruswami and A. K. Sinop, "Optimal column-based lowrank matrix reconstruction," in Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'12), 2012, pp. 1207-1214.
26. D. D. Lewis, Y. Yang, T. G. Rose, and F. Li, "Rcv1: A new benchmark collection for text categorization research," The Journal of Machine Learning Research, vol. 5, pp. 361-397, 2004.
27. W.-Y. Chen, Y. Song, H. Bai, C.-J. Lin, and E. Chang, "Parallel spectral clustering in distributed systems," Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol. 33, no. 3, pp. 568-586, 2011.
28. A. Torralba, R. Fergus, and W. Freeman, "80 million tiny images: A large data set for nonparametric object and scene recognition," Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol. 30, no. 11, pp. 1958-1970, 2008.
29. N. Halko, p. -G. Martinsson, Y. Shkolnisky, and M. Tygert, "An algorithm for the principal component analysis of large data sets," SIAM Journal on Scientific Computing, vol. 33, no. 5, pp. 2580-2594, 2011.