1. A. Frieze, R. Kannan, S. Vempala, Fast Monte-Carlo algorithms for finding low-rank approximations, in: Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS), 1998, pp. 370–378.
2. Efficient SVM training using low-rank kernel representations;Fine;J. Mach. Learn. Res.,2002
3. S. Wang, Z. Zhang, Efficient algorithms and error analysis for the modified Nyström method, in: Proceedings of the 17th International Conference on Artificial Intelligence and Statistics (AISTATS), 2014, pp. 996–1004.
4. C. Williams, M. Seeger, Using the Nyström method to speed up kernel machines, in: Advances in Neural Information Processing Systems 13 (NIPS), 2001, pp. 682–688.
5. L. Ding, S. Liao, Nyström approximate model selection for LSSVM, in: Proceedings of the 16th Pacific-Asia Conference – Advances in Knowledge Discovery and Data Mining (PAKDD), 2012, pp. 282–293.