Selection of the optimal parameter value for the Isomap algorithm

Samko, Oksana, Marshall, Andrew David ORCID: https://orcid.org/0000-0003-2789-1395 and Rosin, Paul L. ORCID: https://orcid.org/0000-0002-4965-3884 2006. Selection of the optimal parameter value for the Isomap algorithm. Pattern Recognition Letters 27 (9) , pp. 968-979. 10.1016/j.patrec.2005.11.017

Full text not available from this repository.

Abstract

The isometric feature mapping (Isomap) method has demonstrated promising results in finding low-dimensional manifolds from data points in high-dimensional input space. Isomap has one free parameter (number of nearest neighbours K or neighbourhood radius ϵ), which has to be specified manually. In this paper we present a new method for selecting the optimal parameter value for Isomap automatically. Numerous experiments on synthetic and real data sets show the effectiveness of our method.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Schools > Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Uncontrolled Keywords:	Nonlinear dimensionality reduction; Manifold learning; Isomap
Publisher:	Elsevier
ISSN:	0167-8655
Last Modified:	21 Oct 2022 10:56
URI:	https://orca.cardiff.ac.uk/id/eprint/41775

Citation Data

Cited 115 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item