{'fraction_non_alphanumeric': 0.018356643356643356, 'fraction_numerical': 0.0008741258741258741, 'mean_word_length': 5.8562874251497, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Study of different strategies for the Canonical Polyadic decomposition of nonnegative third order tensors with application to the separation of spectra in 3D fluorescence spectroscopy

In this communication, the problem of blind source separation in chemical analysis and more precisely in the fluorescence spectroscopy framework is addressed. Classically multi-linear Canonical Polyadic (CP or Candecomp/Parafac) decomposition algorithms are used to perform that task. Yet, as the constituent vectors of the loading matrices should be nonnegative since they stand for nonnegative quantities (spectra and concentrations), we focus on NonNegative CP decomposition algorithms (NNCP). In the unconstrained case, two types of trilinear (or triadic) decomposition model have been studied. Here, our aim is to investigate different strategies concerning the choice of models and optimization schemes in the case of a nonnegativity constraint. Computer simulations are performed on synthetic data to illustrate the robustness of the proposed approaches versus overfactoring problems but also the critical importance of the use of regularization terms.