期刊文献+

基于非负约束的谱聚类方法 被引量:1

A Spectral Clustering Method with the Nonnegative Constraint
下载PDF
导出
摘要 聚类问题一直是模式识别和机器学习领域一个比较活跃而且极负挑战性的研究方向。谱聚类是近年来兴起的一类较流行的聚类方法。该文将非负约束引入到传统的谱聚类方法中,提出了一种基于非负约束的谱聚类方法。非负约束已在许多应用领域被证明是一种有用的性质。文中对比实验表明,基于非负约束的谱聚类方法在整体上明显优于传统的谱聚类方法。 Clustering is a challenging and active research topic in pattern recognition and machine learning.Spectral clustering is a new method for clustering.In this paper,the nonnegative constraint is introduced into the traditional spectral clustering.The NMF-based is proposed.The advantage of the nonnegative constrain has been conformed in many application fields.The results of the experiments in the paper evaluate the proposed method.
出处 《电脑知识与技术(过刊)》 2011年第6X期4165-4167,共3页 Computer Knowledge and Technology
基金 海南省教育厅高校科研项目(hjkj2010_50)
关键词 谱聚类 非负约束 聚类 非负矩阵分解 spectral clustering nonnegative constraint clustering nonnegative matrix factorization
  • 相关文献

参考文献2

  • 1Lee DD,Seung H.Learning the parts of objects by non-negative matrix factorization. Nature . 1999
  • 2蔡晓妍,戴冠中,杨黎斌.谱聚类算法综述[J].计算机科学,2008,35(7):14-18. 被引量:187

二级参考文献28

  • 1Jain A, Murty M, Flynn P. Data clustering.. A Review[J]. ACM Computing Surveys, 1999,31 (3) : 264-323.
  • 2Fiedler M. Algebraic connectivity of graphs. Czech, Math. J. , 1973,23: 298-305.
  • 3Malik J,Belongie S,Leung T, et al. Contour and texture analysis for image segmentation In Perceptual Organization for Artificial Vision Systems. Kluwer, 2000.
  • 4Weiss Y. Segmentation using eigenvectors: A unified view//International Conference on Computer Vision 1999.
  • 5Shi J,Malik J. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2000,22 (8) : 888-905.
  • 6Wu Z, Leahy R. An optimal graph theoretic approach to data clustering: theory and its application to image segmentation [J]. IEEE Trans on PAMI,1993, 15(11):1101-1113.
  • 7Hagen L, Kahng A 13. New spectral methods for ratio cut partitioning and clustering. IEEE Trans. Computer-Aided Design, 1992,11 (9) : 1074-1085.
  • 8Sarkar S, Soundararajan P. Supervised learning of large perceptual organization: Graph spectral partitioning and learning automata. IEEE Transaction on Pattern Analysis and Machine Intelligence, 2000,22(5) : 504- 525.
  • 9Ding C, He X, Zha H, et al. Spectral Min Max cut for Graph Partitioning and Data Clustering[C]//Proc. of the IEEE Intl Conf. on Data Mining. 2001 : 107-114.
  • 10Meila M , Xu L. Multiway cuts and spectral clustering. U. Washington Tech Report. 2003.

共引文献187

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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