Dimensionality Reduction Methods: Comparative Analysis of methods PCA, PPCA and KPCA
Сохранить в:
| Автор: | |
|---|---|
| Формат: | artículo original |
| Статус: | Versión publicada |
| Дата публикации: | 2016 |
| Описание: | The dimensionality reduction methods are algorithms mapping the set of data in subspaces derived from the original space, of fewer dimensions, that allow a description of the data at a lower cost. Due to their importance, they are widely used in processes associated with learning machine. This article presents a comparative analysis of PCA, PPCA and KPCA dimensionality reduction methods. A reconstruction experiment of worm-shape data was performed through structures of landmarks located in the body contour, with methods having different number of main components. The results showed that all methods can be seen as alternative processes. Nevertheless, thanks to the potential for analysis in the features space and the method for calculation of its preimage presented, KPCA offers a better method for recognition process and pattern extraction |
| Страна: | Portal de Revistas UNA |
| Институт: | Universidad Nacional de Costa Rica |
| Repositorio: | Portal de Revistas UNA |
| Язык: | Español |
| OAI Identifier: | oai:www.revistas.una.ac.cr:article/7586 |
| Online-ссылка: | https://www.revistas.una.ac.cr/index.php/uniciencia/article/view/7586 |
| Ключевое слово: | Dimensionality Reduction Points Clouds Preimage problem Reducción de dimensionalidad nube de datos problema de la preimagen. |