• DocumentCode
    419548
  • Title

    Sammon´s nonlinear mapping using geodesic distances

  • Author

    Yang, Li

  • Author_Institution
    Dept. of Comput. Sci., Western Michigan Univ., Kalamazoo, MI, USA
  • Volume
    2
  • fYear
    2004
  • fDate
    23-26 Aug. 2004
  • Firstpage
    303
  • Abstract
    Sammon´s nonlinear mapping (NLM) is an iterative procedure to project high dimensional data into low dimensional configurations. This paper discusses NLM using geodesic distances and proposes a mapping method GeoNLM. We compare its performance through experiments to the performances of NLM and Isomap. It is found that both GeoNLM and Isomap can unfold data manifolds better than NLM. GeoNLM outperforms Isomap when the short-circuit problem occurs in computing the neighborhood graph of data points. In turn, Isomap outperforms GeoNLM if the neighborhood graph is correctly constructed. These observations are discussed to reveal the features of geodesic distance estimation by graph distances.
  • Keywords
    data models; differential geometry; iterative methods; Isomap; Sammons nonlinear mapping; data manifold; geodesic distance; graph distance; neighborhood graph; Computer science; Covariance matrix; Data mining; Eigenvalues and eigenfunctions; Geophysics computing; Indexing; Information retrieval; Optimization methods; Pattern analysis; Principal component analysis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on
  • ISSN
    1051-4651
  • Print_ISBN
    0-7695-2128-2
  • Type

    conf

  • DOI
    10.1109/ICPR.2004.1334180
  • Filename
    1334180