lands High-dimensional data generated by a system with limited degrees of freedom are often constrained in low-dimensional manifolds in the orig-inal space. In this article, we investigate dimension-reduction methods for such intrinsically low-dimensional data through linear projections that preserve the manifold structure of the data. For intrinsically one-dimensional data, this implies projecting to a curve on the plane with as few intersections as possible. We are proposing a supervised projection pursuit method that can be regarded as an extension of the single-index model for nonparametric regression. We show results from a toy and two robotic applications.
We address the problem of fitting parametric curves on the Grassmann manifold for the purpose of int...
Based on CART, we introduce a recursive partitioning method for high dimensional space which partiti...
Abstract We propose a novel linear dimensionality reduction algorithm, namely Locally Regressive Pro...
peer reviewedHigh-dimensional data generated by a system with limited degrees of freedom are often c...
We propose a novel method for linear dimensionality reduction of manifold modeled data. First, we sh...
The problem of dimension reduction is introduced as a way to overcome the curse of the dimensionalit...
In the Data Science routine, we often face the curse of dimensionality, dealing with high-dimension...
High-dimensional regression problems are becoming more and more common with emerging technologies. H...
www.merl.com/people/brand/ We construct a nonlinear mapping from a high-dimensional sample space to ...
The applications of projection pursuit (PP) to some real data sets are described. Some applications ...
Recently the problem of dimensionality reduction has received a lot of interests in many fields of i...
This paper presents a framework for nonlinear dimensionality reduction methods aimed at projecting d...
Journal PaperMany types of data and information can be described by concise models that suggest each...
This paper discusses non-parametric regression between Riemannian manifolds. This learning problem a...
This paper discusses non-parametric regression between Riemannian manifolds. This learning problem a...
We address the problem of fitting parametric curves on the Grassmann manifold for the purpose of int...
Based on CART, we introduce a recursive partitioning method for high dimensional space which partiti...
Abstract We propose a novel linear dimensionality reduction algorithm, namely Locally Regressive Pro...
peer reviewedHigh-dimensional data generated by a system with limited degrees of freedom are often c...
We propose a novel method for linear dimensionality reduction of manifold modeled data. First, we sh...
The problem of dimension reduction is introduced as a way to overcome the curse of the dimensionalit...
In the Data Science routine, we often face the curse of dimensionality, dealing with high-dimension...
High-dimensional regression problems are becoming more and more common with emerging technologies. H...
www.merl.com/people/brand/ We construct a nonlinear mapping from a high-dimensional sample space to ...
The applications of projection pursuit (PP) to some real data sets are described. Some applications ...
Recently the problem of dimensionality reduction has received a lot of interests in many fields of i...
This paper presents a framework for nonlinear dimensionality reduction methods aimed at projecting d...
Journal PaperMany types of data and information can be described by concise models that suggest each...
This paper discusses non-parametric regression between Riemannian manifolds. This learning problem a...
This paper discusses non-parametric regression between Riemannian manifolds. This learning problem a...
We address the problem of fitting parametric curves on the Grassmann manifold for the purpose of int...
Based on CART, we introduce a recursive partitioning method for high dimensional space which partiti...
Abstract We propose a novel linear dimensionality reduction algorithm, namely Locally Regressive Pro...