Abstract

PARAFAC2 is a powerful decomposition method which is ideally suited for modeling gas chromatography-mass spectrometry (GC-MS) data. However, the most widely used fitting algorithms (alternating least squares, ALS) are very slow which hinders use of the model. In this paper, an iterative method called geometric search is proposed to fit the PARAFAC2 model. This method models the PARAFAC2 loading parameters as geometric sequences with offsets during the ALS iterations. It extrapolates the optimal parameters from prior iterations to accelerate ALS convergence process. The performance of this method was evaluated by simulated datasets and two GC-MS datasets of wine and tobacco samples. This geometric search method proved an efficient way to fit PARAFAC2 models, compared with a standard ALS algorithm and two widely used line search algorithms in terms of convergence speed and fitting quality.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call