期刊文献+

基于密度刻画的降维算法 被引量:2

Dimensionality Reduction Algorithm Based on Density Portrayal
下载PDF
导出
摘要 针对LLE算法在数据密度变化较大时很难降维的问题,提出一种基于密度刻画的降维算法。采用cam分布寻找数据点的近邻,并在低维局部重建时对数据点加入密度信息。对手写体数字图像进行字符特征的降维,再对降维后的特征进行分类识别。实验结果表明,该方法能区分字符,具有较好的识别率,能够发现高维空间的低维嵌入流形。 In order to improve the correctness of dimensionality reduction algorithms based on Locally Linear Embedding(LLE) caused by data density change,a novel approach based on density is proposed in this paper.It adapts cam distribute to find the data’s nearest neighbor,meanwhile,adds the data’s density information during the low dimensional local reconstruction.The proposed algorithm is used to reduce the dimensionality of input feature,and the reduced feature is classified by simple classifier.Experimental result indicates that the method can effectively improve the recognition rate of handwritten digits and can dig the manifold embedded in the high dimensional space.
出处 《计算机工程》 CAS CSCD 北大核心 2011年第21期138-140,共3页 Computer Engineering
基金 辽宁省教育厅高等学校科学研究基金资助项目(2008344) 中国科学院自动化研究所复杂系统与智能科学重点实验室开放课题基金资助项目(20070101)
关键词 流形学习 降维 密度信息 手写体识别 cam分布 manifold learning dimensionality reduction density information handwriting recognition cam distribution
  • 相关文献

参考文献5

  • 1姜伟,杨炳儒.基于流形学习的维数约简算法[J].计算机工程,2010,36(12):25-27. 被引量:9
  • 2Pavlenko T. Curse of Dimensionality and Error Probability in Discriminant Analysis[J]. Journal of Statistical Planning and Inference, 2003, 115(2): 565-584.
  • 3高小方,梁吉业.基于采样密度和流形弯曲度的动态邻域算法[J].计算机工程,2010,36(12):17-18. 被引量:2
  • 4Zhou Changyin, Chen Yanqin. Improving Nearest Neighbor Classification with Cam Weighted Distance[J]. Pattern Recogni- tion, 2006, 39(4): 635-645.
  • 5Pan Yaozhang, Ge S S, Mamum A A. Weighted Locally Linear Embedding for Dimension Reduction[J]. Pattern Recognition, 2009, 42(5): 798-811.

二级参考文献13

  • 1Tenenbaum J,Silva D D,Langford J.A Global Geometric Framework for Nonlinear Dimensionality Reduction[J].Science,2000,290(5500):2319-2323.
  • 2Roweis S,Saul L.Nonlinear Dimensionality Reduction by Locally Linear Embedding[J].Science,2000,290(5500):2323-2326.
  • 3Wang Jing,Zhang Zhenyue,Zha Hongyuan.Adaptive Manifold Learning[C] //Proc.of the 18th Neural Information Processing Systems.Cambridge,England:[s.n.] ,2004.
  • 4Zapi'en K,Gasso G,Canu S.Estimation of Tangent Planes for Neighborhood Graph Correction[C] //Proc.of the 15th European Symposium on Artificial Neural Networks Advances in Computational Intelligence and Learning.Bruges,Belgium:[s.n.] ,2007.
  • 5Mekuz N,Tsotsos J K.Parameterless ISOMAP with Adaptive Neighborhood Selection[C] //Proc.of the 28th Annual Symposium of the German Association for Pattern Recognition.Berlin,Germany:[s.n.] ,2006.
  • 6Sergios T,Konstantinos K.Pattern Recognition[M].3rd ed.[S.l.] :Academic Press,2007.
  • 7Tenenbaum J B,Silva V D,Langford J C.A Global Geometric Framework for Nonlinear Dimensionality Reduction[J].Science,2000,290(5550):2319-2323.
  • 8Roweis S T,Saul L K.Nonlinear Dimensionality Reduction by Locally Linear Embedding[J].Science,2000,290(5550):2324-2326.
  • 9Cox M.Multidimensional Scaling[M].London,UK:Chapman & Hall,1994.
  • 10Belkin M,Niyogi P.Laplacian Eigenmaps for Dimensionality Reduction and Data Representation[J].Neural Computation,2003,15(6):1373-1396.

共引文献9

同被引文献9

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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