A New Algorithm for Computing Disjoint Orthogonal Components in the Three-Way Tucker Model
[EN] One of the main drawbacks of the traditional methods for computing components in the three-way Tucker model is the complex structure of the final loading matrices preventing an easy interpretation of the obtained results. In this paper, we propose a heuristic algorithm for computing disjoint or...
| Autores: | , , , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2021 |
| País: | España |
| Institución: | Universidad de Salamanca (USAL) |
| Repositorio: | GREDOS. Repositorio Institucional de la Universidad de Salamanca |
| OAI Identifier: | oai:gredos.usal.es:10366/157319 |
| Acceso en línea: | http://hdl.handle.net/10366/157319 |
| Access Level: | acceso abierto |
| Palabra clave: | Greedy algorithms Heuristic algorithms PCA R software Singular value decomposition Three-way tables Tucker3 model 12 Matemáticas 1206.01 Construcción de Algoritmos |
| Sumario: | [EN] One of the main drawbacks of the traditional methods for computing components in the three-way Tucker model is the complex structure of the final loading matrices preventing an easy interpretation of the obtained results. In this paper, we propose a heuristic algorithm for computing disjoint orthogonal components facilitating the analysis of three-way data and the interpretation of results. We observe in the computational experiments carried out that our novel algorithm ameliorates this drawback, generating final loading matrices with a simple structure and then easier to interpret. Illustrations with real data are provided to show potential applications of the algorithm. |
|---|