arrow
Return

Matrix Factorization-Based Dimensionality Reduction Algorithms_A Comparative Study on Spectroscopic Profiling Data

delete2022-09-21
delete1
PRE
AI
Y
Yinsheng Zhang
金
金磊 (Ling Jin)
F
Fangjie Guo
N
Ni, Xiaofeng
Y
Yaju Zhao
Y
Yongbo Cheng
H
Haiyan Wang *
DOI:10.1021/acs.analchem.2c01922delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Spectroscopic profiling data used in analytical chemistry can be very high-dimensional. Dimensionality reduction (DR) is an effective way to handle the potential curse of dimensionality problem. Among the existing DR algorithms, many can be categorized as a matrix factorization (MF) problem, which decomposes the original data matrix X into the product of a low-dimensional matrix W and a dictionary matrix H. First, this paper provides a theoretical reformulation of relevant DR algorithms under a unified MF perspective, including PCA (principal component analysis), NMF (non-negative matrix factorization), LAE (linear autoencoder), RP (random projection), SRP (sparse random projection), VQ (vector quantization), AA (archetypical analysis), and ICA (independent component analysis). From this perspective, an open-sourced toolkit has been developed to integrate all of the above algorithms with a unified API. Second, we made a comparative study on MF-based DR algorithms. In a case study of TOF (time-of-flight) mass spectra, the eight algorithms extracted three components from the original 27,619 features. The results are compared by a set of DR quality metrics, e.g., reconstruction error, pairwise distance/ranking property, computational cost, local and global structure preservations, etc. Finally, based on the case study result, we summarized guidelines for DR algorithm selection. (1) For reconstruction quality, choose ICA. In the case study, ICA, PCA, and NMF have high reconstruction qualities (reconstruction error < 2%), ICA being the best. (2) To keep the pairwise topological structure, choose PCA. PCA best preserves the pairwise distance/ ranking property. (3) For edge computing and IoT scenarios, choose RP or SRP if reconstruction is not required and the JL-lemma condition is met. The RP family has the best computational performance in the experiment, almost 10-100 times faster than its peers.

Journal

Analytical Chemistry cover
Analytical Chemistry
IF:
6.7
Papers:
4.7W
Citations:
15.9W

Organization

U
University of Illinois Urbana-Champaign
Scholars:
2.4W
Papers: 2.0W
Citations: 35
Z
Zhejiang Gongshang University
Scholars:
6.6K
Papers: 4.9K
Citations: 8.1K
Cited Papers

Cited Papers

Archetypal analysis for machine learning and data mining
err2012-03-01
err165
PREAI
errMorup, Morten; Hansen, Lars Kai
errShare
errSave
Adaptive compressed sensing of Raman spectroscopic profiling data for discriminative tasks
errTALANTA
IF6.1
err2020-05-01
err9
PREAI
errZhang, Yinsheng; Zhang, Zhengyong; Zhao, Yaju; Dian, Rong; Cheng, Yongbo; Qin, Xiaolin; Wang, Haiyan
errShare
errSave
pyDRMetrics - A Python toolkit for dimensionality reduction quality assessment
errHELIYON
IF3.6
err2021-02-01
err12
errOAAI
errZhang, Yinsheng; Shang, Qian; Zhang, Guoming
errShare
errSave
errShare
errSave
The self-organizing map
err1998-11-01
err929
PREAI
errKohonen, T
errShare
errSave
Critical Skills for Kindergarten
err1995-10-01
err0
PREAI
errLAWRENCE J. JOHNSON; R. J. GALLAGHER; MARGARET COOK; PATRICK WONG
errShare
errSave
Assessment of mortality by qSOFA in patients with sepsis outside ICU: A post hoc subgroup analysis by the Japanese Association for Acute Medicine Sepsis Registry Study Group
err2017-11-01
err0
PREAI
errYutaka Umemura; Hiroshi Ogura; Satoshi Gando; Shigeki Kushimoto; Daizoh Saitoh; Toshihiko Mayumi; Seitaro Fujishima; Toshikazu Abe; Hiroto Ikeda; Joji Kotani; Yasuo Miki; Shin-ichiro Shiraishi; Atsushi Shiraishi; Koichiro Suzuki; Yasushi Suzuki; Naoshi Takeyama; Kiyotsugu Takuma; Ryosuke Tsuruta; Yoshihiro Yamaguchi; Norio Yamashita; Naoki Aikawa
errShare
errSave
researcher View more