Robust locally linear embedding

作者:

Highlights:

摘要

In the past few years, some nonlinear dimensionality reduction (NLDR) or nonlinear manifold learning methods have aroused a great deal of interest in the machine learning community. These methods are promising in that they can automatically discover the low-dimensional nonlinear manifold in a high-dimensional data space and then embed the data points into a low-dimensional embedding space, using tractable linear algebraic techniques that are easy to implement and are not prone to local minima. Despite their appealing properties, these NLDR methods are not robust against outliers in the data, yet so far very little has been done to address the robustness problem. In this paper, we address this problem in the context of an NLDR method called locally linear embedding (LLE). Based on robust estimation techniques, we propose an approach to make LLE more robust. We refer to this approach as robust locally linear embedding (RLLE). We also present several specific methods for realizing this general RLLE approach. Experimental results on both synthetic and real-world data show that RLLE is very robust against outliers.

论文关键词:Nonlinear dimensionality reduction,Manifold learning,Locally linear embedding,Principal component analysis,Outlier,Robust statistics,M-estimation,Handwritten digit,Wood texture

论文评审过程:Received 20 August 2004, Revised 11 May 2005, Accepted 12 July 2005, Available online 10 October 2005.

论文官网地址:https://doi.org/10.1016/j.patcog.2005.07.011