loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Third IEEE International Conference on Data Mining (ICDM'03)
Efficient Nonlinear Dimension Reduction for Clustered Data Using Kernel Functions
Melbourne, Florida
November 19-November 22
ISBN: 0-7695-1978-4
Cheong Hee Park, University of Minnesota, Minneapolis
Haesun Park, University of Minnesota, Minneapolis
In this paper, we propose a nonlinear feature extraction method which is based on centroids and kernel functions. The dimension reducing nonlinear transformation is obtained by implicitly mapping the input data into a feature space using a kernel function, and then finding a linear mapping based on an orthonormal basis of centroids in the feature space that maximally separates the between-class relationship. The proposed method utilizes an efficient algorithm to compute an orthonormal basis of centroids in the feature space transformed by a kernel function and achieves dramatic computational savings. The experimental results demonstrate that our method is capable of extracting non-linear features effectively so that competitive performance of classification can be obtained in the reduced dimensional space.
Citation:
Cheong Hee Park, Haesun Park, "Efficient Nonlinear Dimension Reduction for Clustered Data Using Kernel Functions," icdm, pp.243, Third IEEE International Conference on Data Mining (ICDM'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.