模式识别与人工智能
Thursday, Apr. 3, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2013, Vol. 26 Issue (4): 392-401    DOI:
Orignal Article Current Issue| Next Issue| Archive| Adv Search |
Adaptive Kernel Feature Subspace Method for Efficient Feature Extraction
ZHANG Zhao-Yang,TIAN Zheng
School of Natural and Applied Sciences,Northwest Polytechnical University,Xian 710129

Download: PDF (1018 KB)   HTML (0 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  Kernel principal component analysis(KPCA) can extract nonlinear features of datasets. However,its efficiency is inversely proportional to the size of the training sample set. In this paper,an adaptive kernel feature subspace method is proposed to extract features efficiently. This method is methodologically consistent with KPCA,and it improves the efficiency by adaptively selecting the spanning vectors of the KPCA without losing accuracy. Experimental results on two-dimensional data and MNIST datasets show that the proposed method is better than the one associated with KPCA and reference methods.
Key wordsKernel Principal Component Analysis (KPCA)      Feature Extraction      Kernel Feature Subspace      Spanning Vector     
Received: 14 November 2011     
ZTFLH: TP391.4  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
ZHANG Zhao-Yang
TIAN Zheng
Cite this article:   
ZHANG Zhao-Yang,TIAN Zheng. Adaptive Kernel Feature Subspace Method for Efficient Feature Extraction[J]. , 2013, 26(4): 392-401.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2013/V26/I4/392
Copyright © 2010 Editorial Office of Pattern Recognition and Artificial Intelligence
Address: No.350 Shushanhu Road, Hefei, Anhui Province, P.R. China Tel: 0551-65591176 Fax:0551-65591176 Email: bjb@iim.ac.cn
Supported by Beijing Magtech  Email:support@magtech.com.cn