IEEE Trans Biomed Eng. 2020 Jan;67(1):69-78. doi: 10.1109/TBME.2019.2908099. Epub 2019 Mar 28.
A variety of pattern analysis techniques for model training in brain interfaces exploit neural feature dimensionality reduction based on feature ranking and selection heuristics. In the light of broad evidence demonstrating the potential sub-optimality of ranking-based feature selection by any criterion, we propose to extend this focus with an information theoretic learning-driven feature transformation concept.
We present a maximum mutual information linear transformation and a nonlinear transformation framework derived by a general definition of the feature transformation learning problem. Empirical assessments are performed based on electroencephalographic data recorded during a four class motor imagery brain-computer interface (BCI) task. Exploiting the state-of-the-art methods for initial feature vector construction, we compare the proposed approaches with conventional feature selection-based dimensionality reduction techniques, which are widely used in brain interfaces. Furthermore, for the multi-class problem, we present and exploit a hierarchical graphical model-based BCI decoding system.
Both binary and multi-class decoding analyses demonstrate significantly better performances with the proposed methods.
Information theoretic feature transformations are capable of tackling potential confounders of conventional approaches in various settings.
We argue that this concept provides significant insights to extend the focus on feature selection heuristics to a broader definition of feature transformation learning in brain interfaces.
在脑接口的模型训练中,各种模式分析技术都利用基于特征排序和选择启发式的神经特征降维。鉴于广泛的证据表明,任何标准的基于排序的特征选择都存在潜在的次优性,我们建议通过信息论学习驱动的特征变换概念来扩展这一焦点。
我们提出了一种最大互信息线性变换和一种非线性变换框架,该框架由特征变换学习问题的一般定义导出。基于脑电图数据在四类运动想象脑机接口(BCI)任务中的记录,进行了实证评估。利用初始特征向量构建的最新方法,我们将所提出的方法与脑接口中广泛使用的传统基于特征选择的降维技术进行了比较。此外,对于多类问题,我们提出并利用了基于分层图形模型的 BCI 解码系统。
二进制和多类解码分析均表明,所提出的方法具有显著更好的性能。
信息论特征变换能够解决传统方法在各种情况下的潜在混杂因素。
我们认为,这一概念为将特征选择启发式的焦点扩展到脑接口中的更广泛的特征变换学习定义提供了重要的见解。