Incremental Nonlinear Dimensionality Reduction by Manifold Learning

Understanding the structure of multidimensional patterns, especially in unsupervised case, is of fundamental importance in data mining, pattern recognition and machine learning. Several algorithms have been proposed to analyze the structure of high dimensional data based on the notion of manifold learning. These algorithms have been used to extract the intrinsic characteristics of different types of high dimensional data by performing nonlinear dimensionality reduction. Most of these algorithms operate in a "batch" mode and cannot be efficiently applied when data are collected sequentially. In this paper, we describe an incremental version of ISOMAP, one of the key manifold learning algorithms. Our experiments on synthetic data as well as real world images demonstrate that our modified algorithm can maintain an accurate low-dimensional representation of the data in an efficient manner.

• Type: Journal
• Year: 2006
• Where: PAMI
• Authors: Martin H. C. Law, Anil K. Jain
• Keywords: Algorithm, Nonlinear Dimensionality Reduction, PAMI 2006, Several Algorithms