期刊文献+

机器学习中谱聚类方法的研究 被引量:31

Research on Spectral Clustering in Machine Learning
下载PDF
导出
摘要 最近几年,谱聚类方法在模式识别中得到了广泛的应用。与传统的聚类方法比较,它具有能在任意形状的样本空间上聚类,且收敛于全局最优解的优点。本文着重介绍了谱方法的基本原理、相应的算法、研究状况及其在模式识别领域中的应用,同时指出了它的关键问题与未来的研究方向。 Recently spectral clustering has wide application in pattern recognition. Comparing with traditional clustering methods, it has "global" optima solution. This paper introduces the principle, algorithms of spectral clustering, and the application in pattern recognition. And also it points out the key problems and future direction.
出处 《计算机科学》 CSCD 北大核心 2007年第2期201-203,共3页 Computer Science
基金 国家自然科学基金重点项目(60234030)
关键词 谱聚类 机器学习 图划分 Spectral clustering,Machine learning,Graph partition
  • 相关文献

参考文献30

  • 1Hagen L, Kahng A B. New spectral methods for ratio cut partitioning and clustering. IEEE Trans. Computer-Aided Design,1992, 11 (9):1074-1085
  • 2Shi J, Malik J. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence,2000,22(8) :888-905
  • 3Ng A; Jordan M, Weiss Y. On spectral clustering: Analysis and an algorithm. Advances in Neural Information Processing Systems 14. MIT Press, 2001
  • 4Meila M, Shi J. A random walks view of spectral segmentation.In: 8^th International Workshop on Artificial Intelligence and Statistics, 2001
  • 5Zha H, He X, Ding C, Gu M, Simon H D. Bipartite Graph Partitioning and Data clustering. In: Proc. of ACM 10th Int'l Conf.Information and Knowledge Management (CIKM 2001), Atlanta,2001.25-31
  • 6Dhillon I S. Co-clustering documents and words using Bipartite Spectral Graph Partitioning. KDD 2001 San Francisco, California, USA
  • 7Ding H Q. Unsupervised feature selection via two-way orderign in gene expression analysis, http://bioinformatics, oupjoumals.org/cgi/reprint/19/10/1259
  • 8Ding C, He X, Zha H, Gu Ming, Simon H. Spectral Min-Max Cut for Graph Partitioning and Data Clustering. In: Proc. of 1st IEEE Int'l Conf. Data Mining. San Jose,CA,2001
  • 9Fieder M. Algebraic connectivity of graphs. Czechoslovak Math,J. 1973,22:298-305
  • 10Ding C, He X,Zha H. A spectral method to separate disconnected and nearly-disconnected Web graph components. KDD '01,San Francisco, California, USA

同被引文献331

引证文献31

二级引证文献105

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部