J4 ›› 2010, Vol. 45 ›› Issue (7): 55-59.

• Articles • Previous Articles     Next Articles

A local linear emedding agorithm based on harmonicmean geodesic kernel

ZENG Weng-fu1, HUANG Tian-qiang1,2, LI Kai1, YU YANG-qiang1, GUO Gong-de1,2   

  1. 1.School of Mathematics and Computer Science, Fujian Normal University, Fuzhou 350007, Fujian, China;
    2. Key Laboratory of Network Security and Cryptology, Fujian Normal University, Fuzhou 350007,Fujian, China
  • Received:2010-04-02 Online:2010-07-16 Published:2010-09-06

Abstract:

An improved algorithm was proposed to overcome the shortcomings of the existing local linear embedding algorithm that was not suitable for the nonuniform distribution data and not use the information of distant points. First, to improv the accuracy of the algorithm the geodesic-distance was introduced into the new algorithm in order to take advantage of the information of distant points, and then the harmonic-mean geodesic-kernel matrix was constructed by using the harmonic-mean standardization,which could process robustly non-uniform distribution data. The results of the experiments on UCI data sets showed that the improved algorithm could obtain better performance than the classical local linear embedding algorithm on dimension reduction.

Key words: local linear embedding; harmonic mean; kernel trick; geodesic; manifold learning

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!