DocumentCode :
2850384
Title :
A polygonal line algorithm based nonlinear feature extraction method
Author :
Zhang, Feng
Author_Institution :
Texas A&M Univ., College Station, TX, USA
fYear :
2004
fDate :
1-4 Nov. 2004
Firstpage :
281
Lastpage :
288
Abstract :
We propose a polygonal line based principal curve algorithm for nonlinear feature extraction, in which the nonlinearities among the multivariable data can be described by a set of local linear models. The proposed algorithm integrates the linear PCA approach with the polygonal line algorithm to represent complicated nonlinear data structure. Statistical redundancy elimination for high dimensional data is also discussed for describing the underlying principal curves without much loss of information among the original data sets. The polygonal line algorithm can produce robust and accurate nonlinear curve estimation for different multivariate data types, and it is helpful in reducing the computation complexity for existing principal curve approaches when the sample size is large.
Keywords :
computational complexity; computational geometry; curve fitting; feature extraction; polynomial approximation; principal component analysis; nonlinear curve estimation; nonlinear data structure; polygonal line algorithm based nonlinear feature extraction; principal component analysis; principal curve algorithm; statistical redundancy elimination; Convergence; Covariance matrix; Data structures; Eigenvalues and eigenfunctions; Euclidean distance; Feature extraction; Nonlinear distortion; Principal component analysis; Robustness; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Mining, 2004. ICDM '04. Fourth IEEE International Conference on
Print_ISBN :
0-7695-2142-8
Type :
conf
DOI :
10.1109/ICDM.2004.10113
Filename :
1410295
Link To Document :
بازگشت