期刊文献+

基于谱聚类的流形学习算法研究 被引量:1

Research of a manifold learning algorithm based on spectral clustering
在线阅读 下载PDF
导出
摘要 传统流形学习算法虽然是一种常用的有效降维方法,但由于其自身计算结构的限制,往往存在数据分析不足和计算时间较长等问题.为此提出一种基于谱聚类的流形学习算法(spectralclustering locally linear embedding,SCLLE),并对其机理以及优点给予了实例证明.在UCI和NCBI数据集上的实验结果表明,该算法具有较好的识别效果和计算性能. Although traditional manifold learning algorithms are common and effective dimension reduction methods, they still have calculating structure limits of their own, which lead to some problems such as inadequate data analyses and long calculation time. Therefore, on the basis of spectral clustering, a manifold learning algorithm named SCLLE (spectral clustering locally linear embedding) was proposed and its mechanisms as well as its advantages were demonstrated. Experiments with UCI and NCBI data sets show that the proposed algorithm has better recognition effect and computational performance.
作者 王洪波 罗贺
出处 《中国科学技术大学学报》 CAS CSCD 北大核心 2013年第1期79-86,共8页 JUSTC
基金 国家自然科学基金重点项目(71131002) 国家自然科学基金面上项目(71071045 71001032 70801024) 中国博士后科学基金项目(20110490831)资助
关键词 谱聚类 流形学习 SCLLE算法 spectral clustering manifold learning spectral clustering locally linear embedding algorithm
  • 相关文献

参考文献15

  • 1Tenenbaum J B,de Silva V,Langford J C. A global geometric framework for nonlinear dimensionality reduction[J].Science,2000,(5500):2319-2323.
  • 2Roweis S T,Saul L K. Nonlinear dimensionality reduction by locally linear embedding[J].Science,2000,(5500):2323-2326.
  • 3Belkin M,Niyogi P. Laplacian eigenmaps for dimensionality reduction and data representation[J].Neural Computation,2003,(06):1373-1396.doi:10.1162/089976603321780317.
  • 4李阳阳,石洪竺,焦李成,马文萍.基于流形距离的量子进化聚类算法[J].电子学报,2011,39(10):2343-2347. 被引量:16
  • 5公茂果,王爽,马萌,曹宇,焦李成,马文萍.复杂分布数据的二阶段聚类算法[J].软件学报,2011,22(11):2760-2772. 被引量:32
  • 6Faivishevsky L,Goldberger J. An unsupervised data projection that preserves the cluster structure[J].Pattern Recognition Letters,2012,(03):256-262.
  • 7Wang Y,Jiang Y,Wu Y. Spectral clustering on multiple manifolds[J].IEEE Transactions on Neural Networks,2011,(07):1149-1161.
  • 8Kouropteva O,Okun O,Pietik(a)inen M. Incremental locally linear embedding algorithm[J].Pattern Recognition,2005,(10):1764-1767.
  • 9朱明旱,罗大庸,易励群,王一军.基于正交迭代的增量LLE算法[J].电子学报,2009,37(1):132-136. 被引量:11
  • 10曾宪华,罗四维.动态增殖流形学习算法[J].计算机研究与发展,2007,44(9):1462-1468. 被引量:13

二级参考文献64

  • 1刘静,钟伟才,刘芳,焦李成.免疫进化聚类算法[J].电子学报,2001,29(z1):1868-1872. 被引量:43
  • 2J B Tenenbaum, V de Silva, et al. A global geometric framework for nonlinear dimensionality reduction[ J ]. Science, 2000,290(5500):2319 - 2323.
  • 3S T Roweis, L K Saul. Nonlinear dimensionality reduction by locally linear embedding [ J ]. Science, 2000, 290 (5500) : 2323 - 2326.
  • 4M Belkin, P Niyogi. Laplacian eigenmaps and spectral techniques for embedding and clustering [ A ]. Neural Information Processing Systems 14[ C]. Cambridge, MA: MIT Press, 2002, 585 - 591.
  • 5M H Law, N Zhang, et al. Nonlinear manifold learning for data stream[ A]. Proceedings of SIAM Data Mining[ C]. Florida: Orlando, 2004.33 - 44.
  • 6X He,S Yan,et al. Face recognition using Laplacianfaces[ J]. IEEE Transactions on Pattem Analysis and Machine Intelligence, 2005,27(3) : 328 - 340.
  • 7L K Saul, S T Rowels. Think globally, fit locally: unsupervised leaming of low dimensional manifolds[J ]. Journal of Machine Learning Research,2003,4(Jun): 119- 155.
  • 8Olga Kouropteva, Oleg Okun et al. Incremental locally linear embedding algorithm[ J ]. Pattern Recognition, 2005,38 (10) : 1764- 1767.
  • 9G H Golub, C F Van Loan. Matrix Computations[ M]. Baltimore: Johns Hopkins University Press, 1996.422 - 424.
  • 10Data sets for nonlinear dimensionality reduction[ OL ] http://isomap, stanford, edu/datasets, html.

共引文献94

同被引文献5

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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