arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.07908cs.LGcs.AIcs.CVcs.DScs.IRcs.ITmath.IT
收藏

M-ar-K-快速独立分量分析

M-ar-K-Fast Independent Component Analysis

Luca Parisi

摘要:

本研究提出了一种用于特征提取的m-arcsinh核('m-ar-K')快速独立成分分析('FastICA')方法('m-ar-K-FastICA')。内核技巧使降维技术能够捕获数据中更高程度的非线性;然而,可重复的开源内核来帮助特征提取仍然是有限的,并且在从熵数据投影特征时可能不可靠。m-ar-K函数在Python中免费提供,并与其开源库“scikit-learn”兼容,因此与FastICA相结合,以在数据中存在高度随机性的情况下实现更可靠的特征提取,减少对预白化的需求。考虑了不同的分类任务,这些任务与来自scikit-learn和加州大学欧文分校(UCI)机器学习库的不同程度的信息熵的五个(N = 5)开放获取数据集有关。实验结果表明,所提出的特征提取带来的分类性能的改善。新的m-ar-K-FastICA降维方法与“FastICA”金标准方法进行了比较,支持其更高的可靠性和计算效率,无论数据中的潜在不确定性如何。

英文摘要:

This study presents the m-arcsinh Kernel ('m-ar-K') Fast Independent Component Analysis ('FastICA') method ('m-ar-K-FastICA') for feature extraction. The kernel trick has enabled dimensionality reduction techniques to capture a higher extent of non-linearity in the data; however, reproducible, open-source kernels to aid with feature extraction are still limited and may not be reliable when projecting features from entropic data. The m-ar-K function, freely available in Python and compatible with its open-source library 'scikit-learn', is hereby coupled with FastICA to achieve more reliable feature extraction in presence of a high extent of randomness in the data, reducing the need for pre-whitening. Different classification tasks were considered, as related to five (N = 5) open access datasets of various degrees of information entropy, available from scikit-learn and the University California Irvine (UCI) Machine Learning repository. Experimental results demonstrate improvements in the classification performance brought by the proposed feature extraction. The novel m-ar-K-FastICA dimensionality reduction approach is compared to the 'FastICA' gold standard method, supporting its higher reliability and computational efficiency, regardless of the underlying uncertainty in the data.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑