Dataset Information

Non-negative matrix factorisation improves Centiloid robustness in longitudinal studies.

ABSTRACT:

Background

Centiloid was introduced to harmonise β-Amyloid (Aβ) PET quantification across different tracers, scanners and analysis techniques. Unfortunately, Centiloid still suffers from some quantification disparities in longitudinal analysis when normalising data from different tracers or scanners. In this work, we aim to reduce this variability using a different analysis technique applied to the existing calibration data.

Method

All PET images from the Centiloid calibration dataset, along with 3762 PET images from the AIBL study were analysed using the recommended SPM pipeline. The PET images were SUVR normalised using the whole cerebellum. All SUVR normalised PiB images from the calibration dataset were decomposed using non-negative matrix factorisation (NMF). The NMF coefficients related to the first component were strongly correlated with global SUVR and were subsequently used as a surrogate for Aβ retention. For each tracer of the calibration dataset, the components of the NMF were computed in a way such that the coefficients of the first component would match those of the corresponding PiB. Given the strong correlations between the SUVR and the NMF coefficients on the calibration dataset, all PET images from AIBL were subsequently decomposed using the computed NMF, and their coefficients transformed into Centiloids.

Results

Using the AIBL data, the correlation between the standard Centiloid and the novel NMF-based Centiloid was high in each tracer. The NMF-based Centiloids showed a reduction of outliers, and improved longitudinal consistency. Furthermore, it removed the effects of switching tracers from the longitudinal variance of the Centiloid measure, when assessed using a linear mixed effects model.

Conclusion

We here propose a novel image driven method to perform the Centiloid quantification. The methods is highly correlated with standard Centiloids while improving the longitudinal reliability when switching tracers. Implementation of this method across multiple studies may lend to more robust and comparable data for future research.

SUBMITTER: Bourgeat P

PROVIDER: S-EPMC8049633 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Similar Datasets

Project description:Background:Matrix factorization is a well established pattern discovery tool that has seen numerous applications in biomedical data analytics, such as gene expression co-clustering, patient stratification, and gene-disease association mining. Matrix factorization learns a latent data model that takes a data matrix and transforms it into a latent feature space enabling generalization, noise removal and feature discovery. However, factorization algorithms are numerically intensive, and hence there is a pressing challenge to scale current algorithms to work with large datasets. Our focus in this paper is matrix tri-factorization, a popular method that is not limited by the assumption of standard matrix factorization about data residing in one latent space. Matrix tri-factorization solves this by inferring a separate latent space for each dimension in a data matrix, and a latent mapping of interactions between the inferred spaces, making the approach particularly suitable for biomedical data mining. Results:We developed a block-wise approach for latent factor learning in matrix tri-factorization. The approach partitions a data matrix into disjoint submatrices that are treated independently and fed into a parallel factorization system. An appealing property of the proposed approach is its mathematical equivalence with serial matrix tri-factorization. In a study on large biomedical datasets we show that our approach scales well on multi-processor and multi-GPU architectures. On a four-GPU system we demonstrate that our approach can be more than 100-times faster than its single-processor counterpart. Conclusions:A general approach for scaling non-negative matrix tri-factorization is proposed. The approach is especially useful parallel matrix factorization implemented in a multi-GPU environment. We expect the new approach will be useful in emerging procedures for latent factor analysis, notably for data integration, where many large data matrices need to be collectively factorized.