期刊文献+

Unsupervised Linear Discriminant Analysis

Unsupervised Linear Discriminant Analysis
下载PDF
导出
摘要 An algorithm for unsupervised linear discriminant analysis was presented. Optimal unsupervised discriminant vectors are obtained through maximizing covariance of all samples and minimizing covariance of local k-nearest neighbor samples. The experimental results show our algorithm is effective. An algorithm for unsupervised linear discriminant analysis was presented. Optimal unsupervised discriminant vectors arc obtained through maximizing covariancc of all samples and minimizing covariancc of local k-nearest neighbor samples. The experimental results show our algorithm is effective.
出处 《Journal of Shanghai Jiaotong university(Science)》 EI 2006年第1期40-42,共3页 上海交通大学学报(英文版)
基金 TheHighTechniqueProgramofChina(No.2001AA135091)andtheNationalNaturalScienceFoundationofChina(No.60275021)
关键词 linear discriminant analysis(LDA) unsupervised learning neighbor graph linear discriminant analysis (LDA) unsupervised learning neighbor graph
  • 相关文献

参考文献4

  • 1Liang Zhi-zheng,Shi Peng-fei.Kernel direct dis-criminant analysis and its theoretical foundation[].Pattern Recognition.2005
  • 2He Xiao-fei,Yan Shui-cheng,Hu Yu-xiao,et al.Face recognition using Laplacian faces[].IEEE Transaction on Pattern Analysis and Machine Intelli-gence.2005
  • 3Yang J,Frangi A F,Yang J Y,et al.KPCA plus LDA:A complete kernel Fisher discriminant frame-work for feature extraction and recognition[].IEEE Transactions on Pattern Analysis and Machine Intelligence.2005
  • 4Yu Hua,Yang Jie.A direct LDA algorithm for high-dimensional data:with application to face recog-nition[].Pattern Recognition.2001

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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