2014 ◽  
Vol 533 ◽  
pp. 247-251
Author(s):  
Hai Bing Xiao ◽  
Xiao Peng Xie

This paper deals with the study of Locally Linear Embedding (LLE) and Hessian LLE nonlinear feature extraction for high dimensional data dimension reduction. LLE and Hessian LLE algorithm which reveals the characteristics of nonlinear manifold learning were analyzed. LLE and Hessian LLE algorithm simulation research was studied through different kinds of sample for dimensionality reduction. LLE and Hessian LLE algorithm’s classification performance was compared in accordance with MDS. The simulation experimental results show that LLE and Hessian LLE are very effective feature extraction method for nonlinear manifold learning.


2011 ◽  
Vol 339 ◽  
pp. 571-574
Author(s):  
Xing Zhu Liang ◽  
Jing Zhao Li ◽  
Yu E Lin

Several orthogonal feature extraction algorithms based on local preserving projection have recently been proposed. However, these methods still are linear techniques in nature. In this paper, we present nonlinear feature extraction method called Kernel Orthogonal Neighborhood Preserving Discriminant Analysis (KONPDA). A major advantage of the proposed method is that it is regarded every column of the kernel matrix as a corresponding sample. Then running KONPDA in kernel matrix, nonlinear features can be extracted. Experimental results on ORL database indicate that the proposed KONPDA method achieves higher recognition rate than the ONPDA method and other kernel-based learning algorithms.


Author(s):  
FENG ZHANG

In this article we propose a polygonal principal curve based nonlinear feature extraction method, which achieves statistical redundancy elimination without loss of information and provides more robust nonlinear pattern identification for high-dimensional data. Recognizing the limitations of linear statistical methods, this article integrates local principal component analysis (PCA) with a polygonal line algorithm to approximate the complicated nonlinear data structure. Experimental results demonstrate that the proposed algorithm can be implemented to reduce the computation complexity for nonlinear feature extraction in multivariate cases.


Author(s):  
MATÍAS A. BUSTOS ◽  
MANUEL A. DUARTE-MERMOUD ◽  
NICOLÁS H. BELTRÁN

In this paper the problem of nonlinear feature extraction based on the optimization of the Fisher criterion is analyzed. A new nonlinear feature extraction method is proposed. The method does not make use of numerical algorithms and it has an analytical (closed-form) solution. Moreover, no assumptions on the class probability distribution functions are imposed. The proposed method is applied to some standard pattern recognition problems and compared with other classical methodologies already proposed in the literature. The performance of the proposed method turned out to be superior when compared with the other methods studied.


Sign in / Sign up

Export Citation Format

Share Document