[1] WANG L, REGE M, DONG M, et al. Low-rank kernel matrix factorization for large-scale evolutionary clustering[J]. IEEE Transactions on Knowledge and Data Engineering, 2012, 24(6):1036-1050. [2] WILLIAMS C K I, SEEGER M. Using the Nyström method to speed up kernel machines[C]//NIPS'00:Proceedings of the 13th International Conference on Neural Information Processing Systems. Cambridge, MA:MIT Press, 2000:661-667. [3] TALWALKAR A, KUMAR S, MOHRI M, et al. Large-scale SVD and manifold learning[J]. Journal of Machine Learning Research, 2013, 14(1):3129-3152. [4] WANG S, ZHANG Z, ZHANG T. Towards more efficient SPSD matrix approximation and CUR matrix decomposition[J]. Journal of Machine Learning Research, 2016, 17(1):7329-7377. [5] ZHANG K, KWOK J T. Clustered Nyström method for large scale manifold learning and dimension reduction[J]. IEEE Transactions on Neural Networks, 2010, 21(10):1576-1587. [6] ZHANG X, ZONG L, YOU Q, et al. Sampling for Nyström extension-based spectral clustering:incremental perspective and novel analysis[J]. ACM Transactions on Knowledge Discovery from Data, 2016, 11(1):Article No. 7. [7] IOSIFIDIS A, GABBOUJ M. Nyström-based approximate kernel sub-space learning[J]. Pattern Recognition, 2016, 57(C):190-197. [8] CORTES C, MOHRI M, TALWALKAR A. On the impact of kernel approximation on learning accuracy[J]. Journal of Machine Learning Research, 2010, 9(9):113-120. [9] 方玲,陈松灿.基于特征偏好的聚类研究[J].计算机科学,2015,42(5):57-61.(FANG L, CHEN S C. Research on clustering with feature preferences[J]. Computer Science, 2015, 42(5):57-61.) [10] TONG H, PAPADIMITRIOU S, SUN J, et al. Colibri:fast mining of large static and dynamic graphs[C]//KDD'08:Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York:ACM, 2008:686-694. [11] DING C H Q, LI T, JORDAN M I. Convex and semi-nonnegative matrix factorizations[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2010, 32(1):45-55. [12] CAI D, HE X, WU X, et al. Non-negative matrix factorization on manifold[C]//ICDM'08:Proceedings of the 20088th IEEE International Conference on Data Mining. Washington, DC:IEEE Computer Society, 2008:63-72. [13] GITTENS A, MAHONEY M W. Revisiting the Nyström method for improved large-scale machine learning[EB/OL].[2017-12-20]. https://www.stat.berkeley.edu/~mmahoney/pubs/nystrom-icml13.pdf. [14] 丁世飞,贾洪杰,史忠植.基于自适应Nyström采样的大数据谱聚类算法[J].软件学报,2014,25(9):2037-2049.(DING S F, JIA H J, SHI Z Z. Spectral clustering algorithm based on adaptive Nyström sampling for big data analysis[J]. Journal of Software, 2014, 25(9):2037-2049.) [15] SUN S, ZHAO J, ZHU J. A review of Nyström methods for large-scale machine learning[J]. Information Fusion, 2015, 26(C):36-48. [16] KUMAR S, MOHRI M, TALWALKAR A. Sampling methods for the Nyström method[J]. Journal of Machine Learning Research, 2012, 13(1):981-1006. [17] BACH F R, JORDAN M I. Predictive low-rank decomposition for kernel methods[C]//ICML'05:Proceedings of the 22nd International Conference on Machine Learning. New York:ACM, 2005:33-40. [18] BELKIN M, NIYOGI P. Laplacian eigenmaps for dimensionality reduction and data representation[J]. Neural Computation, 2003, 15(6):1373-1396. [19] BUCIU I. Non-negative matrix factorization, a new tool for feature extraction:theory and applications[J]. International Journal of Computers, Communications and Control, 2008, 3(1):67-74. [20] ZHANG K, KWOK J T. Density-weighted Nyström method for computing large kernel eigensystems[J]. Neural Computation, 2009, 21(1):121-146. [21] WANG S, LUO L, ZHANG Z. The modified Nyström method:theories, algorithms, and extension[EB/OL].[2017-12-22]. http://bcmi.sjtu.edu.cn/~luoluo/paper/nystrom3.pdf. [22] WANG S, ZHANG Z. Efficient algorithms and error analysis for the modified Nyström method[EB/OL].[2017-12-22]. http://proceedings.mlr.press/v33/wang14c.pdf. [23] DESHPANDE A, RADEMACHER L, VEMPALA S, et al. Matrix approximation and projective clustering via volume sampling[C]//SODA'06:Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm. Philadelphia, PA:Society for Industrial and Applied Mathematics, 2006:1117-1126. [24] LI M, BI W, KWOK J T. Large-scale Nyström kernel matrix approximation using randomized SVD[J]. IEEE Transactions on Neural Networks and Learning Systems, 2015, 26(1):152-164. [25] KIM B, JEONG Y S, TONG S H, et al. A regularized singular value decomposition-based approach for failure pattern classification on fail bit map in a DRAM wafer[J]. IEEE Transactions on Semiconductor Manufacturing, 2015, 28(1),41-49. [26] WANG L, DONG M. Exemplar-based low-rank matrix decomposition for data clustering[J]. Data Mining and Knowledge Discovery, 2015, 29(2):324-357. [27] CHAZAL F, GUIBAS L J, OUDOT S Y, et al. Persistence-based clustering in Riemannian manifolds[J]. Journal of the ACM, 2013, 60(6):Article No. 41. |