Author:
Sun Shiliang,Zhao Jing,Zhu Jiang
Funder
National Natural Science Foundation of China
Shanghai Knowledge Service Platform
Subject
Hardware and Architecture,Information Systems,Signal Processing,Software
Reference72 articles.
1. A. Frieze, R. Kannan, S. Vempala, Fast Monte-Carlo algorithms for finding low-rank approximations, in: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, 1998, pp. 370–378.
2. Efficient SVM training using low-rank kernel representations;Fine;J. Machine Learn. Res.,2001
3. M.W. Mahoney, P. Drineas, CUR matrix decompositions for improved data analysis, in: Proceedings of the National Academy of Sciences, 2009, pp. 697–702.
4. Using the Nyström method to speed up kernel machines;Williams;Adv. Neural Inform. Process. Syst.,2001
5. A. Deshpande, L. Rademacher, S. Vempala, G. Wang, Matrix approximation and projective clustering via volume sampling, in: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 2006, pp. 1117–1126.
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献