Classification Criterion Based Neighborhood Optimization Method on Laplacian Eigenmaps

Article Preview

Abstract:

Manifold learning algorithms are nonlinear dimensionality reduction algorithms rising in recent years. Laplacian Eigenmaps is a typical manifold learning algorithms. Aim to the difficulty of selecting neighborhood parameter on the algorithm, a neighborhood parameter optimization method based on classification criterion is proposed in the paper. From the point of the classification performance, the classification criterion function is constructed to reflect the distance of within-class and between-class. The optimization of the neighborhood is obtained according to the minimum of the criterion function. The experimental results on IRIS validate the optimization of the neighborhood and the effectiveness of feature classification.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 403-408)

Pages:

2679-2682

Citation:

Online since:

November 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Tenenbaum J, Silva D D, Langford J. A global geometric framework for nonlinear dimensionality reduction. Science, 2000, 290 (5500) : 2319 - 2323.

DOI: 10.1126/science.290.5500.2319

Google Scholar

[2] Roweis S, Saul L. Nonlinear dimensionality reduction by locally linear embedding. Science, 2000, 290(5500): 2323 - 2326.

DOI: 10.1126/science.290.5500.2323

Google Scholar

[3] Belkin M, Niyogi P. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 2003, 15(6): 1373-1396.

DOI: 10.1162/089976603321780317

Google Scholar

[4] C.L. Blake and C.J. Merz. UCI repository of machine learning databases, (1998).

Google Scholar