首页> 外文会议>International Conference on Artificial Intelligence and Computer Engineering >Unsupervised MEG classification by Riemannian Geometry and class centroid matching
【24h】

Unsupervised MEG classification by Riemannian Geometry and class centroid matching

机译:riemannian几何和类心针匹配的无监督MEG分类

获取原文

摘要

In brain-computer interface, information decoded from brain can be used as control signal. However, classifier trained from previous subjects suffer from performance drop due to some factors, including environmental, physiological and instrumental changes. Concretely speaking, statical distribution alters across subjects, as well as sessions. In this paper, we focus on across-subject problem. Thus, we propose a framework for decoding MEG and matching data distribution across subjects. First, features from Riemannian tangent space were extracted to build common feature space between source domain and target domain. Second, taking advantages of clustering in target domain, supervised subspace learning in source domain and matching the class centroid between two domains, we proposed an improved transfer learning method named class centroid matching (CCM). Several experiments had been conducted on a MEG dataset, which shows that our proposed method is effective to reduce discrepancy across subjects and can achieve a promising performance than other comparable methods.
机译:在大脑 - 计算机接口中,从大脑解码的信息可以用作控制信号。然而,由于某些因素,包括环境,生理和工具的变化,从先前受试者培训的分类器患有性能下降。具体说话,统计分布在跨学科以及会话中改变。在本文中,我们专注于跨对象问题。因此,我们提出了一种用于解码MEG的框架和跨对象的匹配数据分布。首先,提取来自riemannian切线空间的功能,以在源域和目标域之间构建常见的特征空间。其次,采用目标域中聚类的优势,在源域中监督子空间学习并与两个域之间的课程匹配,我们提出了一种名为Class Centroid匹配(CCM)的改进的传输学习方法。在MEG数据集上进行了几个实验,表明我们所提出的方法有效地减少对象的差异,并且可以实现比其他可比方法的有希望的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号