Evaluation of projection algorithms
A number of linear and nonlinear mapping algorithms for the projection of patterns from a high-dimensional space to two dimensions are available. These two-dimensional representations allow quick visual observation of a data set. A combination of two popular mapping algorithms-Sammon's mean-squ...
| Publié dans: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 3(1981), 6 vom: 01. Juni, Seite 701-8 |
|---|---|
| Auteur principal: | |
| Autres auteurs: | , |
| Format: | Article |
| Langue: | English |
| Publié: |
1981
|
| Accès à la collection: | IEEE transactions on pattern analysis and machine intelligence |
| Sujets: | Journal Article |
| Résumé: | A number of linear and nonlinear mapping algorithms for the projection of patterns from a high-dimensional space to two dimensions are available. These two-dimensional representations allow quick visual observation of a data set. A combination of two popular mapping algorithms-Sammon's mean-square error technique and the triangulation method-is proposed to overcome the limitations in the individual algorithms. Some factors which describe the goodness of a projection are described, and a comparison is made of six of these algorithms by running them on four data sets. The results obtained support the use of the proposed algorithm |
|---|---|
| Description: | Date Completed 02.10.2012 Date Revised 12.11.2019 published: Print Citation Status PubMed-not-MEDLINE |
| ISSN: | 1939-3539 |