Loading…

Locally linear embedding with additive noise

•A regularized version of the locally linear embedding algorithm is proposed to handle additive noise.•The algorithm has been shown to perform well in practice.•In addition, an algorithm is proposed to automatically select the regularization parameter. Locally linear embedding (LLE) is a nonlinear d...

Full description

Saved in:
Bibliographic Details
Published in:Pattern recognition letters 2019-05, Vol.123, p.47-52
Main Authors: Wang, Justin, Wong, Raymond K.W., Lee, Thomas C.M.
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•A regularized version of the locally linear embedding algorithm is proposed to handle additive noise.•The algorithm has been shown to perform well in practice.•In addition, an algorithm is proposed to automatically select the regularization parameter. Locally linear embedding (LLE) is a nonlinear dimension reduction technique that only relies on the assumption of local linearity. While it is known to produce good results and is computationally efficient, it does not perform well when the observations are distorted by noises, as the fundamental assumption of local linearity becomes violated. In this work, we present a modification of locally linear embedding which is designed to handle such situations. This new modification is termed LLEAN, short for locally linear embedding with additive noise, which has been seen to perform better in the presence of noise distortion. In LLEAN, we seek to recover the noiseless data from the noisy data by exploiting the relationship between local linearity and reconstruction potential, and we then use the recovered noiseless data while performing the dimension reduction. The LLEAN algorithm includes a tuning parameter, and our work includes an automatic selection method for the tuning parameter to remove the burden from the user.
ISSN:0167-8655
1872-7344
DOI:10.1016/j.patrec.2019.02.030