The Bilipschitz criterion for dimension reduction mapping design
| Autor: | Michael Kirby, Markus Anderle, Douglas R. Hundley |
|---|---|
| Rok vydání: | 2002 |
| Předmět: |
Mathematical optimization
Basis (linear algebra) Dimensionality reduction Feature extraction Value (computer science) Construct (python library) Theoretical Computer Science Reduction (complexity) Dimension (vector space) Artificial Intelligence Computer Vision and Pattern Recognition Contraction (operator theory) Algorithm Mathematics |
| Zdroj: | Intelligent Data Analysis. 6:85-104 |
| ISSN: | 1571-4128 1088-467X |
| DOI: | 10.3233/ida-2002-6106 |
| Popis: | We present a graphical method for evaluating the quality of a feature extraction mapping. Based on the Bilipschitz criterion, this Bilipschitz Criterion Plot (BCP) can be used to evaluate dimension reducing mappings for relative quality and to estimate the injectivity of the reduction map (as well as the associated reconstruction map). It can also be used to survey regions where the map is locally an expansion or contraction map. The plot is easy and fast to construct, and gives much more insight than any single value can, such as the distance preservation error. We demonstrate the value of such a mapping when examining the quality of the Sammon map, Neuroscale, the autoassociative map, and a recent technique that is designed to optimize the BCP in a linear fashion, the adaptive secant basis algorithm. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|