Adaptive Neighborhood Graph for LTSA Learning Algorithm without Free-Parameter

Local Tangent Space Alignment (LTSA) algorithm is a classic local nonlinear manifold learning algorithm based on the information about local neighborhood space, i.e., local tangent space with respect to each point in dataset, which aims at finding the low-dimension intrinsic structure lie in high di...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computer applications 2011-01, Vol.19 (4)
Main Authors: Zou, Xianlin, Zhu, Qingsheng
Format: Article
Language:English
Subjects:
Adaptive algorithms
Algorithms
Alignment
Graphs
Learning
Manifolds
Nonlinearity
Tangents
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Local Tangent Space Alignment (LTSA) algorithm is a classic local nonlinear manifold learning algorithm based on the information about local neighborhood space, i.e., local tangent space with respect to each point in dataset, which aims at finding the low-dimension intrinsic structure lie in high dimensional data space for the purpose of dimensionality reduction. In this paper, we present a novel learning algorithm, called 3N-LTSA which needs no free parameter in contrast to LTSA by using an adaptive nearest neighborhood graph. Experimental results show that 3N-LTSA algorithm without free parameter performs more practical and simple algorithm than LTSA.
ISSN:0975-8887
0975-8887
DOI:10.5120/2348-3070