On the Equivalence of Nonnegative Matrix Factorization and Spectral Clustering
暂无分享,去创建一个
[1] Chris Ding. A Tutorial on Spectral Clustering , 2004, ICML 2004.
[2] Ulrike von Luxburg,et al. A tutorial on spectral clustering , 2007, Stat. Comput..
[3] Tao Li,et al. IFD: Iterative Feature and Data Clustering , 2004, SDM.
[4] Tao Li,et al. The Relationships Among Various Nonnegative Matrix Factorization Methods for Clustering , 2006, Sixth International Conference on Data Mining (ICDM'06).
[5] Andrew B. Kahng,et al. New spectral methods for ratio cut partitioning and clustering , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[6] C. Ding,et al. Spectral relaxation models and structure analysis for K-way graph clustering and bi-clustering , 2001 .
[7] Martine D. F. Schlag,et al. Spectral K-Way Ratio-Cut Partitioning and Clustering , 1993, 30th ACM/IEEE Design Automation Conference.
[8] Stan Z. Li,et al. Learning spatially localized, parts-based representation , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.
[9] Michael W. Berry,et al. Text Mining Using Non-Negative Matrix Factorizations , 2004, SDM.
[10] Daniel D. Lee,et al. Multiplicative Updates for Nonnegative Quadratic Programming in Support Vector Machines , 2002, NIPS.
[11] H. Sebastian Seung,et al. Learning the parts of objects by non-negative matrix factorization , 1999, Nature.
[12] Jitendra Malik,et al. Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[13] Chris H. Q. Ding,et al. Spectral Relaxation for K-means Clustering , 2001, NIPS.
[14] Chris H. Q. Ding,et al. A min-max cut algorithm for graph partitioning and data clustering , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[15] Xin Liu,et al. Document clustering based on non-negative matrix factorization , 2003, SIGIR.