PARAFAC2—Part I. A direct fitting algorithm for the PARAFAC2 model
✍ Scribed by Henk A. L. Kiers; Jos M. F. ten Berge; Rasmus Bro
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 158 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0886-9383
No coin nor oath required. For personal study only.
✦ Synopsis
PARAFAC is a generalization of principal component analysis (PCA) to the situation where a set of data matrices is to be analysed. If each data matrix has the same row and column units, the resulting data are three-way data and can be modelled by the PARAFAC1 model. If each data matrix has the same column units but different (numbers of) row units, the PARAFAC2 model can be used. Like the PARAFAC1 model, the PARAFAC2 model gives unique solutions under certain mild assumptions, whereas it is less severely constrained than PARAFAC1. It may therefore also be used for regular three-way data in situations where the PARAFAC1 model is too restricted. Usually the PARAFAC2 model is fitted to a set of matrices with cross-products between the column units. However, this model-fitting procedure is computationally complex and inefficient. In the present paper a procedure for fitting the PARAFAC2 model directly to the set of data matrices is proposed. It is shown that this algorithm is more efficient than the indirect fitting algorithm. Moreover, it is more easily adjusted so as to allow for constraints on the parameter matrices, to handle missing data, as well as to handle generalizations to sets of three-and higher-way data. Furthermore, with the direct fitting approach we also gain information on the row units, in the form of 'factor scores'. As will be shown, this elaboration of the model in no way limits the feasibility of the method. Even though full information on the row units becomes available, the algorithm is based on the usually much smaller cross-product matrices only.
📜 SIMILAR VOLUMES
We present the results of some numerical experiments which were carried out in order to investigate the general characteristics of the algorithm described in Part 1 of this paper.
By use of rotation angle method a direct algorithm is derived, which determines the least-squares superposition that matches two sets of atomic coordinates. The program based on this algorithm runs fast. The solution obtained by this algorithm cannot be trapped by any local minimum. Testing examples
## Abstract ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 100 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, please select a “Full Text” option. The original article is trackable v
The kinetics and mechanism of transesteri®cation reactions involving furanic esters (and aliphatic or aromatic counterparts for the sake of comparison) have been studied in detail using various catalysts and a wide range of experimental conditions. The purpose of this model investigation is to gathe