Linear latent variable models such as principal component analysis (PCA), independent component analysis (ICA), canonical correlation analysis (CCA), and factor analysis (FA) identify latent directions (or loadings) either ordered or unordered. The data is then projected onto the latent directions to obtain their projected representations (or scores). For example, PCA solvers usually rank the principal directions by explaining the most to least variance, while ICA solvers usually return independent directions unordered and often with single sources spread across multiple directions as multiple sub-sources, which is of severe detriment to their usability and interpretability. This paper proposes a general framework to enhance latent space representations for improving the interpretability of linear latent spaces. Although the concepts in this paper are language agnostic, the framework is written in Python. This framework automates the clustering and ranking of latent vectors to enhance the latent information per latent vector, as well as, the interpretation of latent vectors. Several innovative enhancements are incorporated including latent ranking (LR), latent scaling (LS), latent clustering (LC), and latent condensing (LCON). For a specified linear latent variable model, LR ranks latent directions according to a specified metric, LS scales latent directions according to a specified metric, LC automatically clusters latent directions into a specified number of clusters, while, LCON automatically determines an appropriate number of clusters into which to condense the latent directions for a given metric. Additional functionality of the framework includes single-channel and multi-channel data sources, data preprocessing strategies such as Hankelisation to seamlessly expand the applicability of linear latent variable models (LLVMs) to a wider variety of data. The effectiveness of LR, LS, and LCON are showcased on two crafted foundational problems with two applied latent variable models, namely, PCA and ICA.
[1]
Daniel N. Wilke,et al.
Deep digital twins for detection, diagnostics and prognostics
,
2020
.
[2]
Naomi S. Altman,et al.
Points of Significance: Principal component analysis
,
2017,
Nature Methods.
[3]
Ganesh R. Naik,et al.
Introduction: Independent Component Analysis
,
2012
.
[4]
Kim-Anh Lê Cao,et al.
Independent Principal Component Analysis for biologically meaningful dimension reduction of large biological data sets
,
2012,
BMC Bioinformatics.
[5]
Xuezhi Zhao,et al.
Similarity of signal processing effect between Hankel matrix-based SVD and wavelet transform and its mechanism analysis
,
2009
.
[6]
Frank Westad,et al.
Independent component analysis and regression applied on sensory data
,
2005
.
[7]
James V. Stone.
Independent component analysis: an introduction
,
2002,
Trends in Cognitive Sciences.
[8]
Geoffrey E. Hinton,et al.
Learning representations by back-propagating errors
,
1986,
Nature.
[9]
G. P. King,et al.
Extracting qualitative dynamics from experimental data
,
1986
.
[10]
Teuvo Kohonen,et al.
An Adaptive Associative Memory Principle
,
1974,
IEEE Transactions on Computers.
[11]
Daniel N. Wilke,et al.
The Role of Untangled Latent Spaces in Unsupervised Learning Applied to Condition-Based Maintenance
,
2021,
Applied Condition Monitoring.
[12]
Jan A. Snyman,et al.
Practical Mathematical Optimization
,
2018
.
[13]
Seungjin Choi,et al.
Independent Component Analysis
,
2009,
Handbook of Natural Computing.
[14]
Michael I. Jordan,et al.
FINDING CLUSTERS IN INDEPENDENT COMPONENT ANALYSIS
,
2003
.