Shift‐invariant tri‐linearity—A new model for resolving untargeted gas chromatography coupled mass spectrometry data

Multi‐way data analysis is popular in chemometrics for the decomposition of, for example, spectroscopic or chromatographic higher‐order tensor datasets. Parallel factor analysis (PARAFAC) and its extension, PARAFAC2, are extensively employed methods in chemometrics. Applications of PARAFAC2 for unta...

Full description

Saved in:
Bibliographic Details
Published in:Journal of chemometrics 2023-08, Vol.37 (8), p.n/a
Main Authors: Schneide, Paul‐Albert, Bro, Rasmus, Gallagher, Neal B.
Format: Article
Language:English
Subjects:
Algorithms
Chemometrics
Chromatography
Data analysis
Elution
Factor analysis
Gas chromatography
Invariants
Ions
Linearity
Mass spectrometry
Retention time
Tensors
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Multi‐way data analysis is popular in chemometrics for the decomposition of, for example, spectroscopic or chromatographic higher‐order tensor datasets. Parallel factor analysis (PARAFAC) and its extension, PARAFAC2, are extensively employed methods in chemometrics. Applications of PARAFAC2 for untargeted data analysis of hyphenated gas chromatography coupled with mass spectrometric detection (GC‐MS) have proven to be very successful. This is attributable to the ability of PARAFAC2 to account for retention time shifts and shape changes in chromatographic elution profiles. Despite its usefulness, the most common implementations of PARAFAC2 are considered quite slow. Furthermore, it is difficult to apply constraints (e.g., non‐negativity) to the shifted mode in PARAFAC2 models. Both aspects are addressed by a new shift‐invariant tri‐linearity (SIT) algorithm proposed in this paper. It is shown on simulated and real GC‐MS data that the SIT algorithm is 20–60 times faster than the latest PARAFAC2‐alternating least squares (ALS) implementation and the PARAFAC2‐flexible coupling algorithm. Further, the SIT method allows the implementation of constraints in all modes. Trials on real‐world data indicate that the SIT algorithm compares well with alternatives. The new SIT method achieves better factor resolution than the benchmark in some cases and tends to need fewer latent variables to extract the same chemical information. Although SIT is not capable of modeling shape changes in elution profiles, trials on real‐world data indicate the great robustness of the method even in those cases. A new shift‐invariant tri‐linearity algorithm for the analysis of untargeted gas chromatography coupled mass spectrometry data is presented. The algorithm performs significantly better than the benchmark in terms of computational efficiency and provides excellent results in terms of factor resolution. Simulated and real GC‐MS data have been used for the performance assessment.
ISSN:0886-9383
1099-128X
DOI:10.1002/cem.3501