Kernel k-means: spectral clustering and normalized cuts
暂无分享,去创建一个
Inderjit S. Dhillon | Brian Kulis | Yuqiang Guan | I. Dhillon | B. Kulis | Yuqiang Guan | Brian Kulis
[1] Jitendra Malik,et al. Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[2] Bernhard Schölkopf,et al. Nonlinear Component Analysis as a Kernel Eigenvalue Problem , 1998, Neural Computation.
[3] Nello Cristianini,et al. An Introduction to Support Vector Machines and Other Kernel-based Learning Methods , 2000 .
[4] Santosh S. Vempala,et al. On clusterings-good, bad and spectral , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[5] Chris H. Q. Ding,et al. Spectral Relaxation for K-means Clustering , 2001, NIPS.
[6] Inderjit S. Dhillon,et al. Efficient Clustering of Very Large Document Collections , 2001 .
[7] Michael I. Jordan,et al. On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.
[8] Mark A. Girolami,et al. Mercer kernel-based clustering in feature space , 2002, IEEE Trans. Neural Networks.
[9] Inderjit S. Dhillon,et al. Iterative clustering of high dimensional text data augmented by local search , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[10] Michael I. Jordan,et al. Learning Spectral Clustering , 2003, NIPS.
[11] Inderjit S. Dhillon,et al. Diametrical clustering for identifying anti-correlated gene clusters , 2003, Bioinform..
[12] Jianbo Shi,et al. Multiclass spectral clustering , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.
[13] Inderjit S. Dhillon,et al. Clustering with Bregman Divergences , 2005, J. Mach. Learn. Res..