A three-step algorithm for CANDECOMP/PARAFAC analysis of large data sets with multicollinearity

H.A.L. Kiers*

*Corresponding author for this work

    Research output: Contribution to journalArticleAcademicpeer-review

    70 Citations (Scopus)

    Abstract

    Fitting the CANDECOMP/PARAFAC model by the standard alternating least squares algorithm often requires very many iterations. One case in point is that of analysing data with mild to severe multicollinearity. If, in addition, the size of the data is large, the computation of one CANDECOMP/PARAFAC solution is very time-consuming. The present paper describes a three-step procedure which is much more efficient than the ordinary CANDECOMP/PARAFAC algorithm, by combining the idea of data compression with a form of regularization of the compressed data array. (C) 1998 John Wiley & Sons, Ltd.

    Original languageEnglish
    Pages (from-to)155-171
    Number of pages17
    JournalJournal of Chemometrics
    Volume12
    Issue number3
    DOIs
    Publication statusPublished - 4-May-1999

    Keywords

    • three-way analysis
    • trilinear decomposition
    • CANDECOMP/PARAFAC
    • multicollinearity
    • PRINCIPAL COMPONENT ANALYSIS
    • CALIBRATION

    Fingerprint

    Dive into the research topics of 'A three-step algorithm for CANDECOMP/PARAFAC analysis of large data sets with multicollinearity'. Together they form a unique fingerprint.

    Cite this