模式识别与人工智能
Monday, Apr. 7, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2008, Vol. 21 Issue (3): 406-409    DOI:
Researches and Applications Current Issue| Next Issue| Archive| Adv Search |
An Algorithm for Adaptive Neighborhood Selection
WEI Lai, WANG Shou-Jue, XU Fei-Fei
Department of Computer Science and Technology, Tongji University, Shanghai 200092

Download: PDF (467 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  An automatic neighborhood selection algorithm for manifold learning is proposed. It is suitable for all the manifold learning algorithms which need select the neighbors to get locally linear information. Through the algorithm, the proper neighborhood size of a dataset can be determined even under different data density and curvature. By adopting this method, the locally multidimensional scaling can reduce the dimensionality of data based on the suitable neighborhood, and the low-dimensional representations of the data can be get through global alignment. The experiment shows the algorithm can recover the sophisticated geometry structure of the data sets.
Key wordsManifold Learning      Nonlinear Dimensionality Reduction      Locally Multidimensional Scaling (LMDS)     
Received: 25 June 2007     
ZTFLH: TP181  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
WEI Lai
WANG Shou-Jue
XU Fei-Fei
Cite this article:   
WEI Lai,WANG Shou-Jue,XU Fei-Fei. An Algorithm for Adaptive Neighborhood Selection[J]. , 2008, 21(3): 406-409.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2008/V21/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