Random projections for support vector machines

Journal of Machine Learning Research

Volumn 31, Issue , 2013, Pages 498-506

  Paul, Saurabh ^a   Boutsidis, Christos ^b   Magdon Ismail, Malik ^a   Drineas, Petros ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b IBM RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; MATRIX ALGEBRA;

D-DIMENSIONAL SPACES; DIMENSION REDUCTION TECHNIQUES; HIGH PROBABILITY; LINEAR SUPPORT VECTOR MACHINES; MINIMUM ENCLOSING BALL; RANDOM PROJECTIONS; RELATIVE ERRORS; SYNTHETIC DATA;

SUPPORT VECTOR MACHINES;

EID: 84954208045     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (21)

1. D. Achlioptas. Database-friendly random projections: Johnson-Lindenstrauss with binary coins. Journal of Computer and System Sciences, 66(4): 671-687, 2003.
2. N. Ailon and B. Chazelle. Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pages 557-563, 2006.
3. N. Ailon and E. Liberty. Fast dimension reduction using Rademacher series on dual BCH codes. In Pro- ceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1-9, 2008.
4. J.L. Balcazar, Y. Dai, and O. Watanabe. A Random Sampling Technique for Training Support Vector Machines. In Proceedings of the 12th Interna- tional Conference on Algorithmic Learning Theory, pages 119-134, 2001.
5. C-C. Chang and C-J. Lin. Libsvm: A library for support vector machines. ACM Transactions on Intel- ligent Systems and Technology, 2: 27: 1-27: 27, 2011. Software available at http://www.csie.ntu.edu. tw/~cjlin/libsvm.
6. K.L. Clarkson and D.W. Woodru. Low Rank Approximation and Regression in Input Sparsity Time. In Proceedings of the 45th ACM Symposium on the Theory of Computing (To appear), 2013.
7. N. Cristianini and J. Shawe-Taylor. Support Vector Machines and other kernel-based learning methods. Cambridge University Press, 2000.
8. S. Dasgupta and A. Gupta. An elementary proof of a theorem of Johnson and Lindenstrauss. Random Structures and Algorithms, 22(1): 60-65, 2003.
9. D. Davidov, E. Gabrilovich, and S. Markovitch. Parameterized generation of labeled datasets for text categorization based on a hierarchical directory. In Proceedings of the 27th Annual Interna- tional ACM SIGIR Conference on Research and Development in Information Retrieval, pages 250-257, 2004. http://techtc.cs.technion.ac.il/techtc300/techtc300.html.
10. P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 604-613, 1998.
11. S. Krishnan, C. Bhattacharya, and R. Hariharan. A Randomized Algorithm for Large Scale Support Vector Learning. In Advances in 20th Neural Infor- mation Processing Systems, pages 793-800, 2008.
12. J.Z. Li, D.M. Absher, H. Tang, A.M. Southwick, A.M. Casto, S. Ramachandran, H.M. Cann, G.S. Barsh, M. Feldman, L.L. Cavalli-Sforza, and R.M. Myers. Worldwide human relationships inferred from genome-wide patterns of variation. Science, 319 (5866): 1100-1104, 2008.
13. P. Li, T.J. Hastie, and W.K. Church. Very sparse random projections. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 287-296, 2006.
14. A. Magen and A. Zouzias. Low rank matrix-valued Cherno bounds and approximate matrix multiplication. In Proceedings of the 22nd Annual ACM- SIAM Symposium on Discrete Algorithms, pages 1422-1436, 2011.
15. P. Paschou, J. Lewis, A. Javed, and P. Drineas. Ancestry informative markers for fine-scale individual assignment to worldwide populations. Journal of Medical Genetics, 47(12): 835-47, 2010.
16. S. Paul, C. Boutsidis, M. Magdon-Ismail, and P. Drineas. Random Projections for Support Vector Machines. abs/1211.6085, 2012. http://arxiv. org/abs/1211.6085.
17. Q. Shi, J. Petterson, G. Dror, J. Langford, A. Smola, and S.V.N. Vishwanathan. Hash kernels for structured data. Journal of Machine Learning Research, 10: 2615-2637, 2009.
18. Q. Shi, C. Shen, R. Hill, and A.V.D Hengel. Is margin preserved after random projection ? In Proceed- ings of 29th International Conference on Machine Learning, pages 591-598, 2012.
19. V. N. Vapnik. Statistical Learning Theory. Theory of Probability and its Applications, 16: 264-280, 1998.
20. V.N. Vapnik and A. Chervonenkis. On the Uniform Convergence of Relative Frequencies of Events to their Probabilities. Theory of Probability and its Ap- plications, 16: 264-280, 1971.
21. L. Zhang, M. Mahdavi, R. Jin, and T. Yang. Recovering Optimal Solution by Dual Random Projection. abs/1211.3046, 2012. http://arxiv.org/abs/1211.3046.