2017/07/21 by Kelum Gajamannage, Gajamannage, Kelum, Randy Paffenroth +3 · 1 citation
Computer Science · Mathematics · #68T05 #Computer Vision and Pattern Recognition (cs.CV) #Dynamical Systems (math.DS) #FOS: Computer and information sciences #FOS: Mathematics #H.2.8 #I.2.6 #Machine Learning (cs.LG) #Machine Learning (stat.ML) #acm:68T05 #cs.CV #cs.LG #math.DS #msc:68T05 #stat.ML
paper · pdf · doi:10.48550/arxiv.1707.06757
13 pages, 7 figures, submitted to Pattern Recognition
arxiv created 2018/07/13 · arxiv updated 2018/07/16
Existing dimensionality reduction methods are adept at revealing hidden underlying manifolds arising from high-dimensional data and thereby producing a low-dimensional representation. However, the smoothness of the manifolds produced by classic techniques over sparse and noisy data is not guaranteed. In fact, the embedding generated using such data may distort the geometry of the manifold and thereby produce an unfaithful embedding. Herein, we propose a framework for nonlinear dimensionality reduction that generates a manifold in terms of smooth geodesics that is designed to treat problems in which manifold measurements are either sparse or corrupted by noise. Our method generates a network structure for given high-dimensional data using a nearest neighbors search and then produces piecewise linear shortest paths that are defined as geodesics. Then, we fit points in each geodesic by a smoothing spline to emphasize the smoothness. The robustness of this approach for sparse and noisy datasets is demonstrated by the implementation of the method on synthetic and real-world datasets.