Non-negative Laplacian Embedding
暂无分享,去创建一个
Chris H. Q. Ding | Heng Huang | Tao Li | Dijun Luo | C. Ding | Heng Huang | Dijun Luo | Tao Li
[1] Kenneth M. Hall. An r-Dimensional Quadratic Placement Algorithm , 1970 .
[2] M. Fiedler. Algebraic connectivity of graphs , 1973 .
[3] Alex Pothen,et al. PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .
[4] Chung-Kuan Cheng,et al. An improved two-way partitioning algorithm with stable performance [VLSI] , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[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] Andy Harter,et al. Parameterisation of a stochastic model for human face identification , 1994, Proceedings of 1994 IEEE Workshop on Applications of Computer Vision.
[7] Martine D. F. Schlag,et al. Spectral K-way ratio-cut partitioning and clustering , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[8] Andrew B. Kahng,et al. Recent directions in netlist partitioning: a survey , 1995, Integr..
[9] Jitendra Malik,et al. Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[10] H. Sebastian Seung,et al. Learning the parts of objects by non-negative matrix factorization , 1999, Nature.
[11] J. Tenenbaum,et al. A global geometric framework for nonlinear dimensionality reduction. , 2000, Science.
[12] H. Sebastian Seung,et al. Algorithms for Non-negative Matrix Factorization , 2000, NIPS.
[13] S T Roweis,et al. Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.
[14] Chris H. Q. Ding,et al. Spectral Relaxation for K-means Clustering , 2001, NIPS.
[15] 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.
[16] Mikhail Belkin,et al. Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering , 2001, NIPS.
[17] Michael I. Jordan,et al. On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.
[18] Chris H. Q. Ding,et al. K-means clustering via principal component analysis , 2004, ICML.
[19] 张振跃,et al. Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment , 2004 .
[20] Chris H. Q. Ding,et al. On the Equivalence of Nonnegative Matrix Factorization and Spectral Clustering , 2005, SDM.
[21] Chris H. Q. Ding,et al. Nonnegative Matrix Factorization and Probabilistic Latent Semantic Indexing: Equivalence Chi-Square Statistic, and a Hybrid Method , 2006, AAAI.
[22] Tao Li,et al. The Relationships Among Various Nonnegative Matrix Factorization Methods for Clustering , 2006, Sixth International Conference on Data Mining (ICDM'06).
[23] Chris H. Q. Ding,et al. Orthogonal nonnegative matrix t-factorizations for clustering , 2006, KDD '06.
[24] Michael W. Berry,et al. Algorithms and applications for approximate nonnegative matrix factorization , 2007, Comput. Stat. Data Anal..
[25] Chris H. Q. Ding,et al. A learning framework using Green's function and kernel regularization with application to recommender system , 2007, KDD '07.
[26] Chris H. Q. Ding,et al. Convex and Semi-Nonnegative Matrix Factorizations , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.