Dimensionality reduction of EEG signal using Fuzzy Discernibility Matrix

Rajdeep Chatterjee, T. Bandyopadhyay, Debarshi Kumar Sanyal, Dibyajyoti Guha
{"title":"Dimensionality reduction of EEG signal using Fuzzy Discernibility Matrix","authors":"Rajdeep Chatterjee, T. Bandyopadhyay, Debarshi Kumar Sanyal, Dibyajyoti Guha","doi":"10.1109/HSI.2017.8005014","DOIUrl":null,"url":null,"abstract":"High dimensionality of feature space is a problem in supervised machine learning. Redundant or superfluous features either slow down the training process or dilute the quality of classification. Many methods are available in literature for dimensionality reduction. Earlier studies explored a discernibility matrix (DM) based reduct calculation for dimensionality reduction. Discernibility matrix works only on discrete values. But most real-world datasets are continuous in nature. Use of traditional discernibility matrix approach inevitably incurs information loss due to discretization. In this paper, we propose a fuzzified adaptation of discernibility matrix with four variants of dissimilarity measure to deal with continuous data. The proposed algorithm has been applied on EEG dataset-III from BCI competition-II. The reduced dataset is then classified using Support Vector Machine (SVM). The performance of the proposed Fuzzy Discernibility Matrix (FDM) variants are compared with original discernibility matrix based method and Principal Component Analysis (PCA). In our empirical study, the proposed method outperforms the other two methods, thus suggesting that it is competitive with them.","PeriodicalId":355011,"journal":{"name":"2017 10th International Conference on Human System Interactions (HSI)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 10th International Conference on Human System Interactions (HSI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HSI.2017.8005014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

High dimensionality of feature space is a problem in supervised machine learning. Redundant or superfluous features either slow down the training process or dilute the quality of classification. Many methods are available in literature for dimensionality reduction. Earlier studies explored a discernibility matrix (DM) based reduct calculation for dimensionality reduction. Discernibility matrix works only on discrete values. But most real-world datasets are continuous in nature. Use of traditional discernibility matrix approach inevitably incurs information loss due to discretization. In this paper, we propose a fuzzified adaptation of discernibility matrix with four variants of dissimilarity measure to deal with continuous data. The proposed algorithm has been applied on EEG dataset-III from BCI competition-II. The reduced dataset is then classified using Support Vector Machine (SVM). The performance of the proposed Fuzzy Discernibility Matrix (FDM) variants are compared with original discernibility matrix based method and Principal Component Analysis (PCA). In our empirical study, the proposed method outperforms the other two methods, thus suggesting that it is competitive with them.
基于模糊分辨矩阵的脑电信号降维
特征空间的高维性是监督式机器学习中的一个问题。冗余或多余的特征要么减慢训练过程,要么降低分类质量。文献中有许多降维方法。早期的研究探索了一种基于差别矩阵的降维计算。差别矩阵只适用于离散值。但大多数真实世界的数据集本质上是连续的。传统的差别矩阵方法不可避免地会因离散化而导致信息丢失。本文提出了一种具有四种不同度量变量的模糊化区分矩阵来处理连续数据。该算法已应用于BCI competition-II的EEG数据集iii。然后使用支持向量机(SVM)对简化后的数据集进行分类。将所提出的模糊可辨矩阵(FDM)变体的性能与原始的基于可辨矩阵的方法和主成分分析(PCA)进行了比较。在我们的实证研究中,提出的方法优于其他两种方法,从而表明它具有竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信