将主成分分析扩展到非线性流形,提升神经数据建模精度。
Probabilistic Geometric Principal Component Analysis with application to neural data
- 基于流形几何构建概率模型,融合非欧空间信息。
- 在模拟与脑数据中优于传统方法,有效捕捉数据分布差异。
- 适合处理含噪声的高维非线性数据,如神经活动记录。
降维在神经科学等多领域至关重要。概率主成分分析(PPCA)是一种具有概率框架的降维方法,连接了主成分分析(PCA)与因子分析(FA),但其基于线性模型,仅适用于欧氏空间。然而,许多神经科学数据分布在非线性流形上而非欧氏空间。为此,我们提出概率几何主成分分析(PGPCA),一种可显式融入先验流形结构的新降维算法。通过从数据中拟合流形,构建几何坐标系以刻画数据偏离流形及噪声的程度。我们还推导出一种数据驱动的EM算法来学习模型参数。实验表明,PGPCA能有效建模数据在多种给定流形周围的分布,在模拟和真实脑数据中均优于PPCA。此外,该方法可检验几何坐标系是否比欧氏坐标系更优。最终,PGPCA实现对流形上及周围数据分布的联合降维与建模,显著提升高维噪声数据在非线性流形上的分析效能。
原文摘要 · Abstract (English)
Dimensionality reduction is critical across various domains of science including neuroscience. Probabilistic Principal Component Analysis (PPCA) is a prominent dimensionality reduction method that provides a probabilistic approach unlike the deterministic approach of PCA and serves as a connection between PCA and Factor Analysis (FA). Despite their power, PPCA and its extensions are mainly based on linear models and can only describe the data in a Euclidean coordinate system. However, in many neuroscience applications, data may be distributed around a nonlinear geometry (i.e., manifold) rather than lying in the Euclidean space. We develop Probabilistic Geometric Principal Component Analysis (PGPCA) for such datasets as a new dimensionality reduction algorithm that can explicitly incorporate knowledge about a given nonlinear manifold that is first fitted from these data. Further, we show how in addition to the Euclidean coordinate system, a geometric coordinate system can be derived for the manifold to capture the deviations of data from the manifold and noise. We also derive a data-driven EM algorithm for learning the PGPCA model parameters. As such, PGPCA generalizes PPCA to better describe data distributions by incorporating a nonlinear manifold geometry. In simulations and brain data analyses, we show that PGPCA can effectively model the data distribution around various given manifolds and outperforms PPCA for such data. Moreover, PGPCA provides the capability to test whether the new geometric coordinate system better describes the data than the Euclidean one. Finally, PGPCA can perform dimensionality reduction and learn the data distribution both around and on the manifold. These capabilities make PGPCA valuable for enhancing the efficacy of dimensionality reduction for analysis of high-dimensional data that exhibit noise and are distributed around a nonlinear manifold.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。