Fast nonlinear dimensionality reduction with topology preserving networks
Résumé
We present a fast alternative for the Isomap algorithm. A set of quantizers is fit to the data and a neighborhood structure based on the competitive Hebbian rule is imposed on it. This structure is used to obtain low-dimensional description of the data by means of computing geodesic distances and multi dimensional scaling. The quantization allows for faster processing of the data. The speed-up as compared to Isomap is roughly quadratic in the ratio between the number of quan- tizers and the number of data points. The quantizers and neighborhood structure are use to map the data to the low dimensional space.
Domaines
Apprentissage [cs.LG]
Fichier principal
verbeek02esann.pdf (129.28 Ko)
Télécharger le fichier
VVK02b.png (17.05 Ko)
Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Format : Figure, Image
Loading...