Incremental Manifold Learning Algorithm Using PCA on Overlapping Local Neighborhoods for Dimensionality Reduction

Author(s):  
Yubin Zhan ◽  
Jianping Yin ◽  
Guomin Zhang ◽  
En Zhu
2013 ◽  
Vol 645 ◽  
pp. 192-195 ◽  
Author(s):  
Xiao Zhou Chen

Dimension reduction is an important issue to understand microarray data. In this study, we proposed a efficient approach for dimensionality reduction of microarray data. Our method allows to apply the manifold learning algorithm to analyses dimensionality reduction of microarray data. The intra-/inter-category distances were used as the criteria to quantitatively evaluate the effects of data dimensionality reduction. Colon cancer and leukaemia gene expression datasets are selected for our investigation. When the neighborhood parameter was effectivly set, all the intrinsic dimension numbers of data sets were low. Therefore, manifold learning is used to study microarray data in the low-dimensional projection space. Our results indicate that Manifold learning method possesses better effects than the linear methods in analysis of microarray data, which is suitable for clinical diagnosis and other medical applications.


As a member of many dimensionalityreduction algorithms, manifold learning is the hotspot ofrecent dimensionality reduction algorithm. Despite it isgood at retaining the original space structure, there is nodenying that its effect of classifying still has room forimprovement. Based on Laplacian Eigenmap, which is oneof the manifold learning algorithm, this paper committed tooptimize the algorithm combined with a semi-supervisedlearning ideas, which can improve the recognition rate.Finally, the better method of two forms is tested in thesurface electromyography system and plant leafidentification system. The experimental results show thatthis semi-supervised method does well in classifying.


2014 ◽  
Vol 39 (12) ◽  
pp. 2077-2089
Author(s):  
Min YUAN ◽  
Lei CHENG ◽  
Ran-Gang ZHU ◽  
Ying-Ke LEI

2013 ◽  
Vol 32 (6) ◽  
pp. 1670-1673
Author(s):  
Xue-yan ZHOU ◽  
Jian-min HAN ◽  
Yu-bin ZHAN

2016 ◽  
Vol 2016 ◽  
pp. 1-5 ◽  
Author(s):  
Chuanlei Zhang ◽  
Shanwen Zhang ◽  
Weidong Fang

Manifold learning based dimensionality reduction algorithms have been payed much attention in plant leaf recognition as the algorithms can select a subset of effective and efficient discriminative features in the leaf images. In this paper, a dimensionality reduction method based on local discriminative tangent space alignment (LDTSA) is introduced for plant leaf recognition based on leaf images. The proposed method can embrace part optimization and whole alignment and encapsulate the geometric and discriminative information into a local patch. The experiments on two plant leaf databases, ICL and Swedish plant leaf datasets, demonstrate the effectiveness and feasibility of the proposed method.


2015 ◽  
Vol 45 (5) ◽  
pp. 703-712
Author(s):  
QingSong XU ◽  
Liang SHEN ◽  
DongSheng CAO ◽  
Xin HUANG

Sign in / Sign up

Export Citation Format

Share Document