模式识别与人工智能
Wednesday, Apr. 2, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2012, Vol. 25 Issue (3): 406-410    DOI:
Orignal Article Current Issue| Next Issue| Archive| Adv Search |
Neighbor Class Linear Discriminate Analysis
WANG Yan-Wei, DING Xiao-Qing, LIU Chang-Song
Department of Electronic Engineering,Tsinghua University,Beijing 100084

Download: PDF (499 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  A method of neighbor class linear discriminant analysis (NCLDA) is proposed. Linear discriminant analysis (LDA) is a special case of this method. LDA finds the optimal projections by maximum between-class scatter while by minimum within-class scatter. The between-class scatter is an average over divergences among all classes. In NCLDA,between-class scatter is defined as average divergences between one class and its k nearest neighbor classes. By selecting proper numbers of neighbor class, NCLDA alleviates overlaps among classes caused by LDA. The experimental results show that the proposed NCLDA is robust and outperforms LDA.
Key wordsLinear Discriminant Analysis (LDA)      Neighbor Class Linear Discriminant Analysis (NCLAD)      Chinese Handwriting Recognition     
Received: 25 October 2010     
ZTFLH: TP391  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
WANG Yan-Wei
DING Xiao-Qing
LIU Chang-Song
Cite this article:   
WANG Yan-Wei,DING Xiao-Qing,LIU Chang-Song. Neighbor Class Linear Discriminate Analysis[J]. , 2012, 25(3): 406-410.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2012/V25/I3/406
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