Hessian Eigenmaps: new locally linear embedding techniques for high-dimensional data
نویسندگان
چکیده
We describe a method to recover the underlying parametrization of scattered data (mi) lying on a manifold M embedded in high-dimensional Euclidean space. The method, Hessian-based Locally Linear Embedding (HLLE), derives from a conceptual framework of Local Isometry in which the manifold M , viewed as a Riemannian submanifold of the ambient Euclidean space Rn, is locally isometric to an open, connected subset Θ of Euclidean space Rd. Since Θ does not have to be convex, this framework is able to handle a significantly wider class of situations than the original Isomap algorithm. The theoretical framework revolves around a quadratic formH(f) = ∫ M ||Hf (m)|| 2 Fdm defined on functions f : M 7→ R. Here Hf denotes the Hessian of f , and H(f) averages the Frobenius norm of the Hessian over M . To define the Hessian, we use orthogonal coordinates on the tangent planes of M . The key observation is that, if M truly is locally isometric to an open connected subset of Rd, then H(f) has a (d+1)-dimensional nullspace, consisting of the constant functions and a d-dimensional space of functions spanned by the original isometric coordinates. Hence, the isometric coordinates can be recovered up to a linear isometry. Our method may be viewed as a modification of the Locally Linear Embedding and our theoretical framework as a modification of the Laplacian Eigenmaps framework, where we substitute a quadratic form based on the Hessian in place of one based on the Laplacian.
منابع مشابه
Hessian eigenmaps: locally linear embedding techniques for high-dimensional data.
We describe a method for recovering the underlying parametrization of scattered data (m(i)) lying on a manifold M embedded in high-dimensional Euclidean space. The method, Hessian-based locally linear embedding, derives from a conceptual framework of local isometry in which the manifold M, viewed as a Riemannian submanifold of the ambient Euclidean Space R(n), is locally isometric to an open, c...
متن کاملNonlinear Manifold Learning Part II 6.454 Summary
Manifold learning addresses the problem of finding low–dimensional structure within collections of high–dimensional data. Recent interest in this problem was motivated by the development of a pair of algorithms, locally linear embedding (LLE) [6] and isometric feature mapping (IsoMap) [8]. Both methods use local, linear relationships to derive global, nonlinear structure, although their specifi...
متن کاملDiscrete Hessian Eigenmaps method for dimensionality reduction
For a given set of data points lying on a low-dimensional manifold embedded in a high-dimensional space, the dimensionality reduction is to recover a low-dimensional parametrization from the data set. The recently developed Hessian Eigenmaps is a mathematically rigorous method that also sets a theoretical framework for the nonlinear dimensionality reduction problem. In this paper, we develop a ...
متن کاملRobust Hessian Locally Linear Embedding Techniques for High-Dimensional Data
Recently manifold learning has received extensive interest in the community of pattern recognition. Despite their appealing properties, most manifold learning algorithms are not robust in practical applications. In this paper, we address this problem in the context of the Hessian locally linear embedding (HLLE) algorithm and propose a more robust method, called RHLLE, which aims to be robust ag...
متن کاملNon-linear Dimensionality Reduction by Locally Linear Isomaps
Algorithms for nonlinear dimensionality reduction (NLDR) find meaningful hidden low-dimensional structures in a high-dimensional space. Current algorithms for NLDR are Isomaps, Local Linear Embedding and Laplacian Eigenmaps. Isomaps are able to reliably recover lowdimensional nonlinear structures in high-dimensional data sets, but suffer from the problem of short-circuiting, which occurs when t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003