<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Neurosci.</journal-id>
<journal-title>Frontiers in Neuroscience</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Neurosci.</abbrev-journal-title>
<issn pub-type="epub">1662-453X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fnins.2024.1360709</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Neuroscience</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Optimization of transfer learning based on source sample selection in Euclidean space for P300-based brain-computer interfaces</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>Kilani</surname> <given-names>Sepideh</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/2649444/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Aghili</surname> <given-names>Seyedeh Nadia</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/2631155/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Fathi</surname> <given-names>Yaser</given-names></name>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1527392/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Sburlea</surname> <given-names>Andreea Ioana</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/965899/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Department of Biomedical Engineering, School of Electrical Engineering, Iran University of Science and Technology (IUST)</institution>, <addr-line>Tehran</addr-line>, <country>Iran</country></aff>
<aff id="aff2"><sup>2</sup><institution>Institute of Neuroscience, Universite Catholique de Louvain</institution>, <addr-line>Brussels</addr-line>, <country>Belgium</country></aff>
<aff id="aff3"><sup>3</sup><institution>Bernoulli Institute of Mathematics, Computer Science and Artificial Intelligence, Faculty of Science and Engineering, University of Groningen</institution>, <addr-line>Groningen</addr-line>, <country>Netherlands</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Michela Chiappalone, University of Genoa, Italy</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Qi Li, Changchun University of Science and Technology, China</p>
<p>Jiancai Leng, Qilu University of Technology, China</p>
<p>Marianna Semprini, Italian Institute of Technology (IIT), Italy</p></fn>
<corresp id="c001">&#x0002A;Correspondence: Andreea Ioana Sburlea <email>a.i.sburlea&#x00040;rug.nl</email></corresp>
</author-notes>
<pub-date pub-type="epub">
<day>12</day>
<month>07</month>
<year>2024</year>
</pub-date>
<pub-date pub-type="collection">
<year>2024</year>
</pub-date>
<volume>18</volume>
<elocation-id>1360709</elocation-id>
<history>
<date date-type="received">
<day>23</day>
<month>12</month>
<year>2023</year>
</date>
<date date-type="accepted">
<day>25</day>
<month>06</month>
<year>2024</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2024 Kilani, Aghili, Fathi and Sburlea.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder>Kilani, Aghili, Fathi and Sburlea</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license>
</permissions>
<abstract>
<sec>
<title>Introduction</title>
<p>Event-related potentials (ERPs), such as P300, are widely utilized for non-invasive monitoring of brain activity in brain-computer interfaces (BCIs) via electroencephalogram (EEG). However, the non-stationary nature of EEG signals and different data distributions among subjects create significant challenges for implementing real-time P300-based BCIs. This requires time-consuming calibration and a large number of training samples.</p>
</sec>
<sec>
<title>Methods</title>
<p>To address these challenges, this study proposes a transfer learning-based approach that uses a convolutional neural network for high-level feature extraction, followed by Euclidean space data alignment to ensure similar distributions of extracted features. Furthermore, a source selection technique based on the Euclidean distance metric was applied to measure the distance between each source feature sample and a reference point from the target domain. The samples with the lowest distance were then chosen to increase the similarity between source and target datasets. Finally, the transferred features are applied to a discriminative restricted Boltzmann machine classifier for P300 detection.</p>
</sec>
<sec>
<title>Results</title>
<p>The proposed method was evaluated on the state-of-the-art BCI Competition III dataset II and rapid serial visual presentation dataset. The results demonstrate that the proposed technique achieves an average accuracy of 97% for both online and offline after 15 repetitions, which is comparable to the state-of-the-art methods. Notably, the proposed approach requires &#x0003C;&#x000BD; of the training samples needed by previous studies.</p>
</sec>
<sec>
<title>Discussion</title>
<p>Therefore, this technique offers an efficient solution for developing ERP-based BCIs with robust performance against reduced a number of training data.</p>
</sec></abstract>
<kwd-group>
<kwd>P300 event-related potential</kwd>
<kwd>Euclidean alignment</kwd>
<kwd>convolutional neural network</kwd>
<kwd>source sample selection</kwd>
<kwd>discriminative restricted Boltzmann machine</kwd>
</kwd-group>
<counts>
<fig-count count="8"/>
<table-count count="3"/>
<equation-count count="8"/>
<ref-count count="44"/>
<page-count count="13"/>
<word-count count="7879"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Neuroprosthetics</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec id="s1">
<title>1 Introduction</title>
<p>Brain-computer interfaces (BCIs) establish a communication link that directly connects the human brain to external devices (Yadav et al., <xref ref-type="bibr" rid="B40">2020</xref>; Kawala-Sterniuk et al., <xref ref-type="bibr" rid="B10">2021</xref>). BCIs primarily enable individuals with neuromuscular disorders, such as amyotrophic lateral sclerosis (ALS) and spinal cord injury, to communicate with the outside world (Abiri et al., <xref ref-type="bibr" rid="B1">2019</xref>; Bonci et al., <xref ref-type="bibr" rid="B3">2021</xref>). There are various types of BCI-based brain signals, including magnetoencephalography (Mridha et al., <xref ref-type="bibr" rid="B27">2021</xref>; Peksa and Mamchur, <xref ref-type="bibr" rid="B28">2023</xref>), electrocorticography (Miller et al., <xref ref-type="bibr" rid="B26">2020</xref>), functional magnetic resonance imaging (Guo, <xref ref-type="bibr" rid="B7">2020</xref>), and electroencephalogram (EEG)-based systems (Rashid et al., <xref ref-type="bibr" rid="B30">2020</xref>; Ydaav and Maini, <xref ref-type="bibr" rid="B41">2023</xref>). EEG-based BCIs have gained significant attention owing to their non-invasiveness, affordability, high temporal resolution, and widespread availability (Rashid et al., <xref ref-type="bibr" rid="B30">2020</xref>; Ydaav and Maini, <xref ref-type="bibr" rid="B41">2023</xref>).</p>
<p>The human brain produces different types of event-related potentials (ERPs) in response to particular stimuli (McWeeny and Norton, <xref ref-type="bibr" rid="B24">2020</xref>). The present study focuses on the P300-based ERP, which is a positive peak observed in the EEG waveform that is associated with cognitive information processing in the brain (Valakos et al., <xref ref-type="bibr" rid="B33">2020</xref>). The amount of stimulus information is reflected by the amplitude of the P300 wave, with larger P300 waves being generated by greater deviation. P300 responses are frequently triggered using the &#x0201C;oddball&#x0201D; paradigm or rapid serial visual presentation (RSVP), which involves presenting a series of different stimuli, one of which is infrequent relative to the others (Lees et al., <xref ref-type="bibr" rid="B17">2018</xref>).</p>
<p>The P300 typically occurs about 300 ms after a targeted stimulus and can vary depending on an individual&#x00027;s ability to differentiate events (Farwell and Donchin, <xref ref-type="bibr" rid="B5">1988</xref>; Zhang et al., <xref ref-type="bibr" rid="B43">2021</xref>). The P300 paradigm is regarded as being user-friendly and appropriate for use in BCI applications, particularly those that involve spelling, as it is less likely to cause eye strain (Mendoza-Montoya et al., <xref ref-type="bibr" rid="B25">2021</xref>). Farwell and Donchin introduced the Matrix Speller, which was the first device built on the P300 component (Farwell and Donchin, <xref ref-type="bibr" rid="B5">1988</xref>). Following their work, other studies have suggested diverse paradigms and strong algorithms improve performance, resulting in significant enhancements in both theoretical and experimental approaches (Lotte et al., <xref ref-type="bibr" rid="B19">2007</xref>; Kaufmann et al., <xref ref-type="bibr" rid="B9">2011</xref>; Abiri et al., <xref ref-type="bibr" rid="B1">2019</xref>; Lu et al., <xref ref-type="bibr" rid="B21">2019</xref>, <xref ref-type="bibr" rid="B20">2020a</xref>,<xref ref-type="bibr" rid="B22">b</xref>). One of these paradigms is RSVP, which involves presenting a series of stimuli in quick succession, usually at the center of the screen. RSVP can elicit P300 responses when the user sees a target stimulus among distractors (Lin et al., <xref ref-type="bibr" rid="B18">2018</xref>). RSVP has some advantages over the oddball paradigm, such as reducing the number of flashes required to spell a word and avoiding the need for gaze control (Won et al., <xref ref-type="bibr" rid="B38">2019</xref>).</p>
<p>Although the P300 paradigms exhibit promising potential in the BCI field, a significant obstacle is the fact that ERP signals are specific to each subject (Wu et al., <xref ref-type="bibr" rid="B39">2022</xref>). Individuals have varying patterns of brain activity when responding to the same stimuli. As a result, it is necessary to calibrate the system for each person. In the calibration process, the individual is requested to execute a set of tasks that enable the system to acquire knowledge and adjust to their distinctive brain patterns. Although calibration is critical for achieving accurate and reliable results, its time-consuming nature presents a notable challenge for the widespread implementation of BCI.</p>
<p>By utilizing transfer learning (TL) techniques, it is possible to decrease the training time and data needed for a new model, especially when training from scratch is not possible. TL allows machine learning models to be trained on existing datasets from other subjects (known as the source dataset) to apply the acquired knowledge to a new subject (referred to as the target dataset).</p>
<p>One common approach in transfer learning is to adapt a pre-trained model from a source domain to a target domain. Fine-tuning is a variant of this method that utilizes the weights of a pre-trained deep neural network (DNN) based on the source dataset as the initial synaptic configuration for training the target network. Fine-tuning of DNN-based convolutional neural networks (CNNs) is widely used for P300-based BCI applications (Kundu and Ari, <xref ref-type="bibr" rid="B14">2020a</xref>; Kilani et al., <xref ref-type="bibr" rid="B12">2022</xref>), allowing the model to benefit from the general feature extraction capabilities learned from the source dataset. This provides a strong foundation for learning even with limited labeled data from individual subjects and offers faster training times due to the pre-trained weights.</p>
<p>In Kundu and Ari (<xref ref-type="bibr" rid="B14">2020a</xref>), a CNN-based TL is introduced to extract high-level features from a fully connected layer of CNN for P300-based character recognition. Then a Fisher-based feature selection technique was employed to achieve the most optimal feature set. Their results demonstrated that a selected set of CNN-extracted deep features outperformed the manually designed features.</p>
<p>Another method in TL is subspace alignment (SA) which aims to increase the distributional similarity between the source and target datasets by aligning the feature distributions between the two datasets (Kundu and Ari, <xref ref-type="bibr" rid="B14">2020a</xref>). Since the source and target datasets have different characteristics in P300 signals, such as variations in the recorded signals, domain adaptation can reduce the need for extensive calibration and training, ultimately resulting in a more efficient and accurate BCI system (Zanini et al., <xref ref-type="bibr" rid="B42">2018</xref>; He and Wu, <xref ref-type="bibr" rid="B8">2020</xref>). Zanini et al. (<xref ref-type="bibr" rid="B42">2018</xref>) suggested a method called Riemannian alignment (RA) for aligning EEG data recorded during motor imagery (MI) task. RA calculates the covariance matrices of resting trials and computes their Riemannian mean, and uses it as the reference matrix to align all covariance matrices. To overcome the limitations of RA in terms of flexibility, lower computational cost, and unsupervised nature, He and Wu (<xref ref-type="bibr" rid="B8">2020</xref>) proposed a technique called Euclidean alignment (EA) that aligns EEG trials from different subjects in Euclidean space. EA works by identifying a projection matrix that can align the dataset in Euclidean space. The objective is to mitigate the distributional shift between the two domains and enhance the resemblance between their data distributions. In He and Wu (<xref ref-type="bibr" rid="B8">2020</xref>) the efficacy of the EA algorithm was assessed on two distinct datasets: one centered on P300 and the other on MI.</p>
<p>In transfer learning, the quality and relevance of source samples utilized for model training can considerably affect the model&#x00027;s performance. To achieve better transfer learning results and avoid negative transfer, it is important to select the most informative and applicable source samples (Wang et al., <xref ref-type="bibr" rid="B36">2019</xref>; Zhuang et al., <xref ref-type="bibr" rid="B44">2021</xref>; Kilani et al., <xref ref-type="bibr" rid="B11">2023</xref>). Selection data from source domains that are more like the target data has also been used in other works. In Wei et al. (<xref ref-type="bibr" rid="B37">2020</xref>), the authors adopted a performance-based approach to select the source datasets. A classifier was trained for each source subject, then target data was given to it as evaluation data. Finally, source subjects that exhibited the highest classification performance were selected. While this approach led to improved performance compared to using all source datasets, the challenge of training different classifiers made it difficult to implement in real-time. In Qi et al. (<xref ref-type="bibr" rid="B29">2018</xref>), a novel sample selection method using Riemannian geometry measurement has been introduced for P300-based character recognition. A reference epoch was constructed by using a limited number of epochs from target data. The source samples were then selected based on their Riemannian distance to this reference epoch. Their results showed higher character recognition accuracy for sample selection based on Riemannian distance compared to other selection methods. However, Riemannian measurements require more computation, and the choices for classification models are limited compared to Euclidean measurements (He and Wu, <xref ref-type="bibr" rid="B8">2020</xref>; Kilani et al., <xref ref-type="bibr" rid="B11">2023</xref>).</p>
<p>In response to the challenges presented by P300-based BCI, we suggest a new approach to transfer learning that combines the advantages of fine-tuning and subspace alignment. Our approach utilizes finetuning for extracting the high-level features of deep neural networks. Then a domain adaptation technique is used to improve the similarity between the source and target feature distributions. Moreover, to reduce negative transfer, a source sample selection approach is used to choose the samples that are more similar to the target domain data samples. Our transfer learning approach is subsequently implemented on the discriminative restricted Boltzmann machine (DRBM) as the classifier.</p>
<p>Section 2 provides a detailed description of the methods and materials used in our study. We begin by presenting the datasets and explaining the preprocessing steps that were taken to ensure the quality of the data. Next, we describe our proposed approach, which combines the fine-tuning method and subspace alignment using the EA approach. Finally, we outline the process of applying the extracted features using our transfer learning approach to the DRBM classifier. In Section 3, we present the simulation results, including a comparison with other methods and an analysis of the effectiveness of our approach. Finally, in Section 4, we conclude with a summary of our contributions and discuss research in this area.</p>
</sec>
<sec id="s2">
<title>2 Methods and materials</title>
<sec>
<title>2.1 Datasets</title>
<p>We applied the proposed method on two distinct datasets: the <italic>BCI Competition III Dataset II</italic>, derived from a pair of participants, and a <italic>Rapid Serial Visual Presentation (RSVP) Dataset</italic> acquired from <italic>PhysioNet</italic> across 11 participants. A concise summary of each dataset is detailed in Sections 2.1.1 and 2.1.2, respectively. Subsequently, we describe the processing steps and results for each participant.</p>
<sec>
<title>2.1.1 Dataset 1</title>
<p>For this study, we employed the BCI competition III dataset II (Blankertz et al., <xref ref-type="bibr" rid="B31">2006</xref>) from the Wadsworth Center, NYS Department of Health. The dataset included EEG data from a pair of participants (A and B), with strict adherence to relevant guidelines and regulations. EEG signals were recorded using 64 scalp electrodes, with a sampling rate of 240 Hz, and a band-pass filter with a bandwidth of 0.1&#x02013;60 Hz was used to ensure high-quality data. Two individuals who were in good health took part in both training and testing sessions of the P300 speller task experiment. The P300 speller proposed by Farwell and Donchin was used, as shown in <xref ref-type="fig" rid="F1">Figure 1</xref>. Participants were instructed to concentrate on a 6 x 6 matrix speller, which would randomly highlight its rows and columns, resulting in a total of 12 random intensifications. For each character recognition trial in the P300 signal analysis, the 12 intensifications were each repeated 15 times, leading to a total of 180 intensifications. In the EEG signal, the P300 component is generated following each row or column intensification. The objective of the processing was to identify the intersection of P300 component recognition in each row and column of the target character. During each repetition of character recognition, there were two target intensifications and 10 non-target intensifications. During both the training and testing sessions, the participants identified 85 and 100 pre-detected characters, respectively, which were then used for training (from 85 training characters) and testing (from 100 testing characters) the model. During the training session, a total of 2,550 P300 samples (85 characters, each with two target intensifications repeated 15 times) and 12,750 non-P300 samples (85 characters, each with 10 non-target intensifications repeated 15 times) were collected. MATLAB R2019b was used to carry out all analyses.</p>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption><p>The 6 &#x000D7; 6 alphabet matrix was designed by Farwell and Donchin. All letters and digits are gray and the ones on the intensified rows or columns indicate flashing. In this case, the second row is intensified.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnins-18-1360709-g0001.tif"/>
</fig>
</sec>
<sec>
<title>2.1.2 Dataset 2</title>
<p>Another ERP-based dataset in this study relied on an RSVP dataset acquired from PhysioNet4 (Goldberger et al., <xref ref-type="bibr" rid="B6">2000</xref>). This dataset encompassed EEG recordings from 11 healthy subjects who participated in an experiment involving rapid image presentations at frequencies of 5, 6, and 10 Hz (Matran-Fernandez and Poli, <xref ref-type="bibr" rid="B23">2017</xref>). During the experiment, participants were seated in front of a computer and presented with a series of swiftly changing aerial images of London. These images were categorized as either target images or non-target images. Target images featured a randomly rotated and positioned airplane that had been photo-realistically superimposed, while non-target images lacked airplanes. The main objective was to discern whether the images were target or non-target based on the EEG signals recorded from eight channels, with a sampling rate of 2,048 Hz. Each subject completed two sessions, referred to as &#x0201C;a&#x0201D; and &#x0201C;b,&#x0201D; respectively. In Session &#x0201C;a,&#x0201D; the first image was labeled as &#x0201C;target,&#x0201D; while in Session &#x0201C;b,&#x0201D; it was labeled as &#x0201C;non-target.&#x0201D; For our analysis, we specifically utilized the 5 Hz version (equivalent to five images per second) from Session &#x0201C;a.&#x0201D; The number of EEG samples collected varied across subjects, ranging from 368 to 565, and the target-to-non-target ratio was &#x0007E;1:9.</p>
</sec>
</sec>
<sec>
<title>2.2 Preprocessing</title>
<p>In terms of the preprocessing of the two datasets, we followed the specific recommendations provided in the previously published articles. This ensured that each dataset was prepared in a way that aligned with its unique characteristics and maximized the validity of comparisons between the methods applied. Below we detail the applied preprocessing steps.</p>
<p>To process the EEG signals for Dataset 1, we applied a band-pass filter with a range of 0.1&#x02013;30 Hz to the signals, as recommended by Thodoroff et al. (<xref ref-type="bibr" rid="B32">2016</xref>). Subsequently, we extracted the data by employing a window length of 665 ms following each intensification event. Taking into account the sampling rate of 240 Hz and the number of EEG channels, the input data was then organized into a sequence of samples with dimensions of 160<sup>&#x0002A;</sup>64.</p>
<p>For preprocessing of Dataset 2, the continuous EEG data underwent bandpass filtering between [0.15, 28] Hz, as recommended by Matran-Fernandez and Poli (<xref ref-type="bibr" rid="B23">2017</xref>). To streamline processing, we downsampled the EEG signal from the original 2,048 Hz to 64 Hz. Additionally, each trial was epoched to the time interval [0, 0.7] seconds, precisely time-locked to the stimulus onset, to ensure consistent analysis. Here, the data was organized in 8<sup>&#x0002A;</sup>45 images for further analysis as described below.</p>
</sec>
<sec>
<title>2.3 Deep feature extraction</title>
<p>We present a new feature extraction method for P300 signal classification. Our approach involves utilizing Euclidean alignment (EA) and a convolutional neural network (CNN) as part of a transfer learning strategy. The proposed method is depicted in <xref ref-type="fig" rid="F2">Figure 2</xref>, which outlines the overall schematic diagram. Initially, the CNN network is trained using the entire source dataset. Subsequently, the weights obtained from the source CNN are used as the initial weights for fine-tuning the CNN with input from the target dataset. Once the network is trained, high-level features are extracted from both CNNs&#x02014;the source and target feature blocks. Next, we apply the transfer learning-based EA method to align the features in a new Euclidean space, which leads to the creation of similar feature distributions (EA_source and EA_target feature steps). Before assigning the features to the classification, samples from the source that are less similar to the target are removed by the source selection block.</p>
<fig id="F2" position="float">
<label>Figure 2</label>
<caption><p>The general structure of the proposed method is based on a transfer learning approach for P300 Signal Classification with Euclidean alignment and fine-tuning of a convolutional neural network. <bold>(A)</bold> The training stage comprises four main modules: fine-tuning of a pre-trained CNN for deep feature extraction, Euclidean alignment to mitigate distribution variations between the source and target domains, source sample selection for optimal representation, and training the discriminative restricted Boltzmann machine (DRBM) classifier using the selected samples. <bold>(B)</bold> During the test stage, features are extracted using the fine-tuning module, followed by transformation into the aligned space, and finally fed into the classification model (DRBM).</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnins-18-1360709-g0002.tif"/>
</fig>
<sec>
<title>2.3.1 Convolutional neural network</title>
<p>This CNN structure is divided into six layers, including two Batch Normalization (BN) layers, a convolution layer, two fully connected layers, and a Softmax layer as can be seen in <xref ref-type="fig" rid="F3">Figure 3</xref>.</p>
<fig id="F3" position="float">
<label>Figure 3</label>
<caption><p>Description of the CNN structure employed for EEG signal classification. TxC indicates temporal features and the number of channels, where T = 160 and C = 64 for Dataset 1, and T = 45 and C = 8 for Dataset 2. The network includes batch normalization in the input layer, followed by a convolutional layer with K kernels of size [T/10xC] and stride of [Sx1] for feature extraction, where K &#x00026; S = 16 for Dataset 1, and K &#x00026; S = 5 for Dataset 2. Two Fully Connected layers of f (f = 128 for Dataset 1 and f = 36 for Dataset 2) and two neurons are utilized, followed by a Softmax layer to complete the network. The ReLU activation function is applied throughout the network.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnins-18-1360709-g0003.tif"/>
</fig>
<p>In the first layer, the EEG signal (<italic>X</italic><sup><italic>T</italic>&#x000D7;<italic>C</italic></sup> where <italic>T</italic> and <italic>C</italic> indicate temporal features and channels, respectively) was fed into the BN layer, which is used to normalize each training mini-batch and accelerate the network training process by reducing internal covariate shifts. After the input data was normalized using the BN layer, the neural network was trained using a convolutional layer. The convolutional layer extracts features using <italic>K</italic> kernels (K = 16 and 5 for Dataset 1 and 2, respectively) and stride of [S &#x000D7; 1] (S = 16 and 5 for BCI competition and RSVP datasets, respectively). Features are extracted by kernels as <xref ref-type="disp-formula" rid="E1">Equation 1</xref>:</p>
<disp-formula id="E1"><label>(1)</label><mml:math id="M1"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mo>&#x0002A;</mml:mo><mml:msup><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup><mml:mo>&#x0002B;</mml:mo><mml:msup><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mtext>&#x000A0;</mml:mtext></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <inline-formula><mml:math id="M2"><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mtext>&#x000A0;</mml:mtext></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:math></inline-formula> is the feature of the <italic>l-</italic>1th layer; <inline-formula><mml:math id="M3"><mml:msubsup><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mtext>&#x000A0;</mml:mtext></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula><mml:math id="M4"><mml:msubsup><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mtext>&#x000A0;</mml:mtext></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> are filters and biases of the <italic>lth</italic> layer; f<italic>()</italic> is the activation function that introduces a non-linearity aspect to the network. The second BN layer was applied in this step to avoid the convert shifts. Rectified Linear Unit (ReLU) is the most common activation function. Different types of ReLUs can be used. The simple non-linear type of ReLU activates neurons as <xref ref-type="disp-formula" rid="E2">Equation 2</xref>:</p>
<disp-formula id="E2"><label>(2)</label><mml:math id="M5"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>h</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo class="qopname">max</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mtext>&#x000A0;</mml:mtext></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>which accepts positive inputs from a neuron and returns 0 for negative input values. Following the extraction of features from the convolutional layer output, the network was completed with two fully connected layers consisting of <italic>f</italic> and 2 neurons, and then a Softmax layer. To assess the model&#x00027;s effectiveness during training and pre-training steps, we utilize the cross-entropy loss function. This function acts as a performance metric throughout the training process by providing necessary gradients for updating weights. Stochastic gradient descent with a learning rate of 0.01 and a momentum factor of 0.9 is used for backpropagation, and L2 regularization parameter of 0.0005 is applied to prevent overfitting.</p>
<sec>
<title>2.3.1.1 CNN training approach</title>
<p>The paper fine-tuned a pre-trained CNN on a new task, adjusting its weights for better adaptation while retaining prior knowledge. This enabled quick and accurate adaptation to new tasks with limited data, demonstrating CNN&#x00027;s ability to learn versatile features during pre-training. In this study, two subjects were considered for the Dataset 1, with one as the source and the other as the target. It consisted of 15,300 training samples (85<sup>&#x0002A;</sup>12<sup>&#x0002A;</sup>15), and all samples from the source dataset were used for the initial training (pre-training) of the CNN according to the aforementioned structure. Then, initial convolutional layers of the pre-trained CNN were frozen to retain their generic feature extraction capabilities learned from the source data. These frozen layers were then used to initialize the corresponding layers in the target (current) CNN. In the next step, only 7,200 samples (40<sup>&#x0002A;</sup>12<sup>&#x0002A;</sup>15) from the target dataset were used to retrain the model. This approach allowed for leveraging the pre-trained network&#x00027;s knowledge to adapt it to the target task, thereby improving the accuracy and reducing the calibration time (a reduction of 53%).</p>
<p>In Dataset 2 (RSVP), which comprises 11 subjects, our primary objective is to select the most suitable source subject for each target subject. To accomplish this, we employed a source subject selection process based on performance evaluation. The approach involved training 10 classifiers, each using the training dataset from one of the 10 source subjects. These classifiers were subsequently tested using 20% of the training data from the target subject. After conducting the tests, we identified the source subject whose classifier achieved the highest classification accuracy out of the 10 groups. This source subject was then chosen as the optimal match for the respective target subject. By employing this methodology, we aimed to ensure that the most competent and relevant sources were utilized to enhance the overall performance of the system. Notably, 10% of training selected source datasets were used for tuning the parameters as a cross-validation step in Dataset 1 and 2 analyses.</p>
</sec>
</sec>
<sec>
<title>2.3.2 Euclidean space data alignment</title>
<p>According to the literature (He and Wu, <xref ref-type="bibr" rid="B8">2020</xref>), an unsupervised approach was proposed to align EEG data of various subjects in Euclidean space with a focus on enhancing their similarity which is called Euclidean alignment (EA). In this study, we applied this EA approach to the features extracted from the first fully connected layer of the CNN structure [y = f(X)] in both the source and target datasets to improve the efficiency of the transfer learning process. The EA technique computed the reference matrix based on the covariance of a subject&#x00027;s <italic>N</italic>-trial feature, as given by <xref ref-type="disp-formula" rid="E3">Equation 3</xref>:</p>
<disp-formula id="E3"><label>(3)</label><mml:math id="M6"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mo>&#x000AF;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:mfrac><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:msup><mml:mrow><mml:mtext>&#x000A0;</mml:mtext><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>After computing the reference matrix for each dataset, the datasets were aligned using the <xref ref-type="disp-formula" rid="E4">Equation 4</xref>:</p>
<disp-formula id="E4"><label>(4)</label><mml:math id="M7"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mi>&#x01EF9;</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mo>&#x000AF;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mtext>&#x000A0;</mml:mtext><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>This method is computationally efficient, does not require labeling, and results in distributions of the aligned data being more similar. To implement the EA, we calculated the reference covariance matrix in two ways offline and online calculation. In offline calculation, all unlabeled trials from a new subject are available and used to calculate the reference, while in online calculation only one trial of unlabeled data at each step is used to update the reference covariance matrix.</p>
</sec>
<sec>
<title>2.3.3 Source sample selection</title>
<p>To reduce the negative effect of transfer from the source domain to the target domain, source sample selection has been used in the current study. This process involves selecting the most relevant and informative source samples to improve the performance of the target domain. There are different criteria for choosing source data. Here we employed an unsupervised sample selection approach based on distance criteria. The distance-based method involved creating a reference for the target subject by averaging its feature samples. The Euclidean distance measurement was used to calculate the distance between each source feature sample and the reference. The samples with the smallest distance were then selected. <xref ref-type="table" rid="T3">Algorithm 1</xref> provides a more detailed description of the introduced source selection method.</p>
<table-wrap position="float" id="T3">
<label>Algorithm 1</label>
<caption><p>Source sample selection.</p></caption>
<table frame="box" rules="all">
<tbody>
<tr>
<td valign="top" align="left"><bold>Input:</bold><break/> &#x02022; <inline-formula><mml:math id="M8"><mml:mstyle mathvariant="bold-italic"><mml:msubsup><mml:mrow><mml:mi>&#x01EF9;</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup></mml:mstyle></mml:math></inline-formula> is the extracted feature vector from j<italic>th</italic> target sample.<break/> &#x02022; <inline-formula><mml:math id="M9"><mml:mstyle mathvariant="bold-italic"><mml:msubsup><mml:mrow><mml:mi>&#x01EF9;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:msubsup></mml:mstyle></mml:math></inline-formula> is the extracted feature vector from i<italic>th</italic> source sample.<break/> &#x02022; <italic>N</italic><sub><italic>T</italic></sub> is the number of target samples.<break/> &#x02022; <italic>N</italic><sub><italic>S</italic></sub> is the number of source samples.<break/> &#x02022; <italic>k</italic> is the number of source samples to be selected</td>
</tr>
<tr>
<td valign="top" align="left">Calculate target reference: <inline-formula><mml:math id="M10"><mml:mstyle class="text"><mml:mtext mathvariant="bold">r</mml:mtext></mml:mstyle><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:msubsup><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msubsup><mml:mstyle mathvariant="bold-italic"><mml:msubsup><mml:mrow><mml:mi>&#x01EF9;</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup></mml:mstyle></mml:math></inline-formula>;<break/> <bold>for</bold> <italic>i</italic> = l: <italic>N</italic><sub>s</sub> <bold>do</bold><break/>&#x000A0;&#x000A0;&#x000A0;&#x000A0;<inline-formula><mml:math id="M11"><mml:mstyle class="text"><mml:mtext mathvariant="bold">d</mml:mtext></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>j</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle class="text"><mml:mtext mathvariant="bold">r</mml:mtext></mml:mstyle><mml:mo>-</mml:mo><mml:msubsup><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mstyle class="text"><mml:mtext mathvariant="bold">y</mml:mtext></mml:mstyle></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext mathvariant="bold">i</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext mathvariant="bold">S</mml:mtext></mml:mstyle></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle class="text"><mml:mtext mathvariant="bold">r</mml:mtext></mml:mstyle><mml:mo>-</mml:mo><mml:msubsup><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mstyle class="text"><mml:mtext mathvariant="bold">y</mml:mtext></mml:mstyle></mml:mrow><mml:mo>&#x0007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext mathvariant="bold">i</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext mathvariant="bold">S</mml:mtext></mml:mstyle></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mtext>&#x000A0;</mml:mtext></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msup><mml:mo>;</mml:mo></mml:math></inline-formula><break/> <bold>end</bold><break/> Sort <bold>d</bold> and select <italic>k</italic> source samples with the smallest distance.</td>
</tr>
<tr>
<td valign="top" align="left"><bold>Output:</bold> <italic>k</italic> index from source (<bold><italic>&#x01EF8;</italic><sup><italic>S</italic></sup></bold>)</td>
</tr></tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec>
<title>2.4 Classification</title>
<p>Restricted Boltzmann Machines (RBMs) are an energy-based model with hidden variables. RBMs are typically used as generative models, meaning they can learn to generate new samples from a given distribution. The model learns to assign higher probabilities to samples that are similar to the ones it has seen during training and lower probabilities to dissimilar samples.</p>
<p>For classification problems, a Discriminative RBM (DRBM) was proposed (Larochelle and Bengio, <xref ref-type="bibr" rid="B16">2008</xref>). Unlike a standard RBM, a DRBM is trained to directly model the conditional distribution of the labels given the input data. This makes the DRBM a discriminative model, as it is trained to predict the labels of new samples, rather than generate them. DRBMs have been shown to achieve state-of-the-art performance on several benchmark datasets.</p>
<p>Previous studies have reported the successful performance of a hybrid form of DRBM in the P300 classification (Varsamou and Antonakopoulos, <xref ref-type="bibr" rid="B35">2019</xref>; Kordmahale et al., <xref ref-type="bibr" rid="B13">2022</xref>; Aghili et al., <xref ref-type="bibr" rid="B2">2023</xref>). Therefore, we have adopted this approach, using 10 hidden neurons, to classify features extracted from the output of the convolutional layer.</p>
</sec>
</sec>
<sec id="s3">
<title>3 Results and discussion</title>
<p>We utilized two datasets (dataset II from BCI competition III and RSVP dataset) to evaluate the proposed method, as introduced in Section 2.1. In the initial phase, we showcase our effectiveness using Dataset 1, illustrating our commendable performance in both offline and online scenarios (more details about the scenarios in Section 2.3.2). Subsequently, in the second phase, we present the findings obtained from Dataset 2, providing more comprehensive insights through ablation experiments. Given the larger pool of subjects in this dataset, we can effectively showcase our robustness in this context.</p>
<sec>
<title>3.1 Dataset 1 results</title>
<sec>
<title>3.1.1 Data visualization</title>
<p>The t-Stochastic Neighbor Embedding (t-SNE) is a visualization technique that maps high-dimensional data to a two or three-dimensional (2D or 3D) space (Van Der Maaten and Hinton, <xref ref-type="bibr" rid="B34">2008</xref>). The goal of t-SNE is to optimize the pairwise distances in the reduced space for the distances in the original manifold. In our case, we aim to represent each extracted feature in a 2D space to better appreciate the effect of the EA alignment in the cross-subject shifts. In <xref ref-type="fig" rid="F4">Figure 4</xref>, we aim to illustrate the extracted features by the fine-tuned CNN before and after applying EA to demonstrate their impact on the similarity of target and source distributions. As shown in <xref ref-type="fig" rid="F4">Figure 4</xref>, the proposed TL (fine-tuned CNN&#x0002B;EA) method demonstrates a suitable effect on the similarity of target and source distributions.</p>
<fig id="F4" position="float">
<label>Figure 4</label>
<caption><p><bold>(Left)</bold> presents a t-SNE visualization of the data distributions in the source (red color) and target (cyan color) domains within Dataset 1. The target involves data samples of 40 characters from subject A, and the source distribution comprises data samples of 85 characters from subject B, after extracting fine-tuned CNN features (before applying EA). On the other hand, the <bold>(Right)</bold> depicts the target and source feature distributions after applying EA (fine-tuned CNN&#x0002B;EA).</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnins-18-1360709-g0004.tif"/>
</fig>
</sec>
<sec>
<title>3.1.2 Performance evaluation</title>
<p>In <xref ref-type="fig" rid="F5">Figure 5</xref>, the character recognition performance was evaluated on Dataset 1, subjects &#x0201C;A&#x0201D; and &#x0201C;B&#x0201D; using three different feature extraction approaches as comparison study (DRBM was set as a classification method for all of them): (i) conventional CNN technique without fine-tune approach with 40 target characters, (ii) fine-tuning approach is used for 40 target characters training, (iii) fine_tuned CNN&#x0002B;EA without sources samples selection, and (iv) proposed TL approach (7,200 sources samples were selected by <xref ref-type="table" rid="T3">Algorithm 1</xref>). The results show that the accuracy of character recognition is higher with the proposed approach compared to fine-tuned CNN&#x0002B;EA, fine-tuned CNN, and conventional CNN. By selectively utilizing 7,200 source samples by the proposed sample selection method, we not only boost the system&#x00027;s accuracy but also enhance the efficiency of the training process by ensuring that only the most relevant and impactful data is utilized. The results underscore the importance of source sample selection in improving the efficacy of TL techniques in BCI applications.</p>
<fig id="F5" position="float">
<label>Figure 5</label>
<caption><p>Comparative analysis of character recognition accuracy (%) for Dataset 1, subjects A and B, using three distinct methodologies for training on 40 target characters. Approach (i) employs a conventional CNN (blue); approach (ii) applies the fine_tuned CNN method (red); approach (iii) utilizes the fine_tuned CNN&#x0002B;EA method without source sample selection (cyan); and approach (iv) applies the fine-tuned CNN&#x0002B;EA with source sample selection (pink color).</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnins-18-1360709-g0005.tif"/>
</fig>
<p>To evaluate the performance of the proposed algorithm, we compared its results with those of previous works that reported their findings on the benchmark dataset (BCI competition III dataset II), which included the CNN-1 (Cecotti and Gr&#x000E4;ser, <xref ref-type="bibr" rid="B4">2011</xref>), MCNN-3 (Cecotti and Gr&#x000E4;ser, <xref ref-type="bibr" rid="B4">2011</xref>), MsCNN-TL-ESVM (Kundu and Ari, <xref ref-type="bibr" rid="B15">2020b</xref>), and DRBM (Larochelle and Bengio, <xref ref-type="bibr" rid="B16">2008</xref>) techniques. <xref ref-type="table" rid="T1">Table 1</xref> summarizes the results of the current character recognition methods compared to our proposed method. Our approach achieved excellent classification performance, with an accuracy of 98%, and 96% for subjects A and B after 15 repetitions, respectively. It&#x00027;s worth noting that these results were achieved using only 40 training characters to train the model.</p>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p>The accuracy of character recognition (%) is compared between our proposed method and other existing methods for subjects A and B from Dataset 1.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<th valign="top" align="left"><bold>Subjects</bold></th>
<th valign="top" align="center"><bold>Methods</bold></th>
<th valign="top" align="center" colspan="15"><bold>Repetitions</bold></th>
</tr>
</thead>
<tbody>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<td/>
<td/>
<td valign="top" align="center"><bold>1</bold></td>
<td valign="top" align="center"><bold>2</bold></td>
<td valign="top" align="center"><bold>3</bold></td>
<td valign="top" align="center"><bold>4</bold></td>
<td valign="top" align="center"><bold>5</bold></td>
<td valign="top" align="center"><bold>6</bold></td>
<td valign="top" align="center"><bold>7</bold></td>
<td valign="top" align="center"><bold>8</bold></td>
<td valign="top" align="center"><bold>9</bold></td>
<td valign="top" align="center"><bold>10</bold></td>
<td valign="top" align="center"><bold>11</bold></td>
<td valign="top" align="center"><bold>12</bold></td>
<td valign="top" align="center"><bold>13</bold></td>
<td valign="top" align="center"><bold>14</bold></td>
<td valign="top" align="center"><bold>15</bold></td>
</tr>
<tr>
<td valign="top" align="left">A</td>
<td valign="top" align="center"><sup><bold>&#x0002A;</bold></sup><bold>Proposed method</bold></td>
<td valign="top" align="center">22</td>
<td valign="top" align="center"><bold>38</bold></td>
<td valign="top" align="center"><bold>52</bold></td>
<td valign="top" align="center"><bold>58</bold></td>
<td valign="top" align="center"><bold>63</bold></td>
<td valign="top" align="center"><bold>71</bold></td>
<td valign="top" align="center">76</td>
<td valign="top" align="center"><bold>79</bold></td>
<td valign="top" align="center">83</td>
<td valign="top" align="center"><bold>88</bold></td>
<td valign="top" align="center">90</td>
<td valign="top" align="center"><bold>91</bold></td>
<td valign="top" align="center">91</td>
<td valign="top" align="center"><bold>94</bold></td>
<td valign="top" align="center"><bold>98</bold></td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">CNN-1</td>
<td valign="top" align="center">16</td>
<td valign="top" align="center">33</td>
<td valign="top" align="center">47</td>
<td valign="top" align="center">52</td>
<td valign="top" align="center">61</td>
<td valign="top" align="center">65</td>
<td valign="top" align="center">77</td>
<td valign="top" align="center">78</td>
<td valign="top" align="center"><bold>85</bold></td>
<td valign="top" align="center">86</td>
<td valign="top" align="center">90</td>
<td valign="top" align="center"><bold>91</bold></td>
<td valign="top" align="center">91</td>
<td valign="top" align="center">93</td>
<td valign="top" align="center">97</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">MCNN-3</td>
<td valign="top" align="center">17</td>
<td valign="top" align="center">35</td>
<td valign="top" align="center">50</td>
<td valign="top" align="center">55</td>
<td valign="top" align="center">63</td>
<td valign="top" align="center">67</td>
<td valign="top" align="center"><bold>78</bold></td>
<td valign="top" align="center"><bold>79</bold></td>
<td valign="top" align="center">84</td>
<td valign="top" align="center">85</td>
<td valign="top" align="center"><bold>91</bold></td>
<td valign="top" align="center">90</td>
<td valign="top" align="center"><bold>92</bold></td>
<td valign="top" align="center"><bold>94</bold></td>
<td valign="top" align="center">97</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center"><sup>&#x0002A;</sup>MsCNN-TL-ESVM</td>
<td valign="top" align="center"><bold>24</bold></td>
<td valign="top" align="center"><bold>38</bold></td>
<td valign="top" align="center">46</td>
<td valign="top" align="center">50</td>
<td valign="top" align="center">60</td>
<td valign="top" align="center">70</td>
<td valign="top" align="center">72</td>
<td valign="top" align="center"><bold>79</bold></td>
<td valign="top" align="center">84</td>
<td valign="top" align="center">86</td>
<td valign="top" align="center">89</td>
<td valign="top" align="center">89</td>
<td valign="top" align="center"><bold>92</bold></td>
<td valign="top" align="center"><bold>94</bold></td>
<td valign="top" align="center">96</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center"><sup>&#x0002A;</sup>MsCNN-ESVM</td>
<td valign="top" align="center">16</td>
<td valign="top" align="center">16</td>
<td valign="top" align="center">39</td>
<td valign="top" align="center">38</td>
<td valign="top" align="center">46</td>
<td valign="top" align="center">49</td>
<td valign="top" align="center">65</td>
<td valign="top" align="center">69</td>
<td valign="top" align="center">78</td>
<td valign="top" align="center">81</td>
<td valign="top" align="center">82</td>
<td valign="top" align="center">87</td>
<td valign="top" align="center">88</td>
<td valign="top" align="center">89</td>
<td valign="top" align="center">89</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">DRBM-85</td>
<td valign="top" align="center">19</td>
<td valign="top" align="center">35</td>
<td valign="top" align="center">47</td>
<td valign="top" align="center">57</td>
<td valign="top" align="center">62</td>
<td valign="top" align="center">65</td>
<td valign="top" align="center">74</td>
<td valign="top" align="center">78</td>
<td valign="top" align="center">83</td>
<td valign="top" align="center">85</td>
<td valign="top" align="center">86</td>
<td valign="top" align="center">89</td>
<td valign="top" align="center">91</td>
<td valign="top" align="center">92</td>
<td valign="top" align="center">94</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center"><sup>&#x0002A;</sup>DRBM-45</td>
<td valign="top" align="center">20</td>
<td valign="top" align="center">31</td>
<td valign="top" align="center">43</td>
<td valign="top" align="center">50</td>
<td valign="top" align="center">55</td>
<td valign="top" align="center">61</td>
<td valign="top" align="center">70</td>
<td valign="top" align="center">72</td>
<td valign="top" align="center">78</td>
<td valign="top" align="center">82</td>
<td valign="top" align="center">80</td>
<td valign="top" align="center">84</td>
<td valign="top" align="center">85</td>
<td valign="top" align="center">89</td>
<td valign="top" align="center">91</td>
</tr>
<tr>
<td valign="top" align="left">B</td>
<td valign="top" align="center"><sup><bold>&#x0002A;</bold></sup><bold>Proposed method</bold></td>
<td valign="top" align="center"><bold>43</bold></td>
<td valign="top" align="center"><bold>66</bold></td>
<td valign="top" align="center"><bold>74</bold></td>
<td valign="top" align="center"><bold>77</bold></td>
<td valign="top" align="center"><bold>82</bold></td>
<td valign="top" align="center"><bold>86</bold></td>
<td valign="top" align="center"><bold>90</bold></td>
<td valign="top" align="center">88</td>
<td valign="top" align="center">90</td>
<td valign="top" align="center">91</td>
<td valign="top" align="center">91</td>
<td valign="top" align="center">94</td>
<td valign="top" align="center">95</td>
<td valign="top" align="center">95</td>
<td valign="top" align="center"><bold>96</bold></td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">CNN-1</td>
<td valign="top" align="center">35</td>
<td valign="top" align="center">52</td>
<td valign="top" align="center">59</td>
<td valign="top" align="center">68</td>
<td valign="top" align="center">79</td>
<td valign="top" align="center">81</td>
<td valign="top" align="center">82</td>
<td valign="top" align="center">89</td>
<td valign="top" align="center">92</td>
<td valign="top" align="center">91</td>
<td valign="top" align="center">91</td>
<td valign="top" align="center">90</td>
<td valign="top" align="center">91</td>
<td valign="top" align="center">92</td>
<td valign="top" align="center">92</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">MCNN-3</td>
<td valign="top" align="center">34</td>
<td valign="top" align="center">56</td>
<td valign="top" align="center">60</td>
<td valign="top" align="center">68</td>
<td valign="top" align="center">74</td>
<td valign="top" align="center">80</td>
<td valign="top" align="center">82</td>
<td valign="top" align="center">89</td>
<td valign="top" align="center">90</td>
<td valign="top" align="center">90</td>
<td valign="top" align="center">91</td>
<td valign="top" align="center">88</td>
<td valign="top" align="center">90</td>
<td valign="top" align="center">91</td>
<td valign="top" align="center">92</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center"><sup>&#x0002A;</sup>MsCNN-TL-ESVM</td>
<td valign="top" align="center">40</td>
<td valign="top" align="center">59</td>
<td valign="top" align="center">67</td>
<td valign="top" align="center">74</td>
<td valign="top" align="center">79</td>
<td valign="top" align="center">84</td>
<td valign="top" align="center"><bold>90</bold></td>
<td valign="top" align="center"><bold>92</bold></td>
<td valign="top" align="center"><bold>94</bold></td>
<td valign="top" align="center"><bold>97</bold></td>
<td valign="top" align="center"><bold>96</bold></td>
<td valign="top" align="center"><bold>98</bold></td>
<td valign="top" align="center"><bold>97</bold></td>
<td valign="top" align="center"><bold>97</bold></td>
<td valign="top" align="center"><bold>96</bold></td>
</tr>
 <tr>
<td/>
<td valign="top" align="center"><sup>&#x0002A;</sup>MsCNN-ESVM</td>
<td valign="top" align="center">37</td>
<td valign="top" align="center">58</td>
<td valign="top" align="center">65</td>
<td valign="top" align="center">73</td>
<td valign="top" align="center">74</td>
<td valign="top" align="center">83</td>
<td valign="top" align="center">87</td>
<td valign="top" align="center">88</td>
<td valign="top" align="center">91</td>
<td valign="top" align="center">94</td>
<td valign="top" align="center">92</td>
<td valign="top" align="center">92</td>
<td valign="top" align="center">93</td>
<td valign="top" align="center">96</td>
<td valign="top" align="center"><bold>96</bold></td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">DRBM-85</td>
<td valign="top" align="center">32</td>
<td valign="top" align="center">50</td>
<td valign="top" align="center">62</td>
<td valign="top" align="center">65</td>
<td valign="top" align="center">75</td>
<td valign="top" align="center">77</td>
<td valign="top" align="center">83</td>
<td valign="top" align="center">86</td>
<td valign="top" align="center">90</td>
<td valign="top" align="center">93</td>
<td valign="top" align="center">94</td>
<td valign="top" align="center">95</td>
<td valign="top" align="center">95</td>
<td valign="top" align="center">94</td>
<td valign="top" align="center">93</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center"><sup>&#x0002A;</sup>DRBM-45</td>
<td valign="top" align="center">32</td>
<td valign="top" align="center">45</td>
<td valign="top" align="center">52</td>
<td valign="top" align="center">65</td>
<td valign="top" align="center">73</td>
<td valign="top" align="center">76</td>
<td valign="top" align="center">82</td>
<td valign="top" align="center">84</td>
<td valign="top" align="center">86</td>
<td valign="top" align="center">92</td>
<td valign="top" align="center">92</td>
<td valign="top" align="center">93</td>
<td valign="top" align="center">93</td>
<td valign="top" align="center">91</td>
<td valign="top" align="center">89</td>
</tr></tbody>
</table>
<table-wrap-foot>
<p><sup>&#x0002A;</sup>Indicates that 40 target characters (7,200 training target samples) are used for training the model. Other methods utilized all 85 target characters (15,300 training target samples) for training the model.</p>
<p>The best accuracy for each repetition was made bold for clarification.</p>
</table-wrap-foot>
</table-wrap>
<p>The speed and accuracy of a user&#x00027;s communication with a computer using brain signals can be quantified using the information transfer rate (ITR) formula. ITR is measured in bits per minute (bpm) and is defined as <xref ref-type="disp-formula" rid="E5">Equation 5</xref>.</p>
<disp-formula id="E5"><label>(5)</label><mml:math id="M12"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>I</mml:mi><mml:mi>T</mml:mi><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mtext>&#x000A0;</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mo class="qopname">log</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mi>N</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>P</mml:mi><mml:msub><mml:mrow><mml:mo class="qopname">log</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mi>P</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:mi>P</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mo class="qopname">log</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mfrac><mml:mrow><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x000D7;</mml:mo><mml:mn>60</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where N is the number of characters in the BCI paradigm, which is 36 in this case. P is the character recognition accuracy, and T is the time required for character recognition, defined as <xref ref-type="disp-formula" rid="E6">Equation 6</xref>:</p>
<disp-formula id="E6"><label>(6)</label><mml:math id="M13"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>T</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mo>.</mml:mo><mml:mn>5</mml:mn><mml:mo>&#x0002B;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>.</mml:mo><mml:mn>100</mml:mn><mml:mtext>&#x000A0;</mml:mtext><mml:mi>s</mml:mi><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x0002B;</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mn>0</mml:mn><mml:mo>.</mml:mo><mml:mn>075</mml:mn><mml:mtext>&#x000A0;</mml:mtext><mml:mi>s</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x000D7;</mml:mo><mml:mn>12</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x000D7;</mml:mo><mml:mi>N</mml:mi><mml:mi>r</mml:mi><mml:mtext>&#x000A0;</mml:mtext><mml:mo>,</mml:mo><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mn>1</mml:mn><mml:mo>&#x02264;</mml:mo><mml:mi>N</mml:mi><mml:mi>r</mml:mi><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x02264;</mml:mo><mml:mn>15</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where Nr is the number of repetitions (1 &#x02264; Nr &#x02264; 15). <xref ref-type="fig" rid="F6">Figure 6</xref> demonstrates the ITR of the proposed method in comparison to other previously reported methods. ITR values of 10.4, 13.4, 10.6, and 8.5 bpm were achieved for 1, 5, 10, and 15 repetitions, respectively. The proposed technique achieves an optimal level of character recognition and speed for 1&#x02013;7 repetitions, resulting in a higher ITR score than other methods. The practicality of our approach extends to real-time applications, offering a robust solution to the prevalent speed limitations in BCI systems.</p>
<fig id="F6" position="float">
<label>Figure 6</label>
<caption><p>The comparison of information transfer rates (ITRs) between the proposed method and other techniques, based on the average accuracy of two subjects A and B from Dataset 1. DRBM-45 and DRBM-85 indicate that 45 and 85 training characters are used for training the model, respectively.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnins-18-1360709-g0006.tif"/>
</fig>
</sec>
<sec>
<title>3.1.3 Online vs. offline analysis</title>
<p>The difference between online and offline computations lies in the covariance matrix calculation, as explained previously (Section 2.3.2). The research study highlights the outcomes of online character recognition in two subjects, identified as Subject A and Subject B. These results are comprehensively summarized in <xref ref-type="table" rid="T2">Table 2</xref>, presenting an overview of the achieved recognition accuracy in real-time scenarios. By serving as a valuable reference, <xref ref-type="table" rid="T2">Table 2</xref> provides crucial insights into the effectiveness of online character recognition among different individuals. The implications drawn from these findings hold significant potential for advancing the field of online character recognition and its practical applications.</p>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p>The accuracy of character recognition (%) using online and offline methods is evaluated for subjects A and B from Dataset 1.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<th valign="top" align="left"><bold>Subjects</bold></th>
<th valign="top" align="center"><bold>Analysis approach</bold></th>
<th valign="top" align="center" colspan="15"><bold>Repetitions</bold></th>
</tr>
</thead>
<tbody>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<td/>
<td/>
<td valign="top" align="center"><bold>1</bold></td>
<td valign="top" align="center"><bold>2</bold></td>
<td valign="top" align="center"><bold>3</bold></td>
<td valign="top" align="center"><bold>4</bold></td>
<td valign="top" align="center"><bold>5</bold></td>
<td valign="top" align="center"><bold>6</bold></td>
<td valign="top" align="center"><bold>7</bold></td>
<td valign="top" align="center"><bold>8</bold></td>
<td valign="top" align="center"><bold>9</bold></td>
<td valign="top" align="center"><bold>10</bold></td>
<td valign="top" align="center"><bold>11</bold></td>
<td valign="top" align="center"><bold>12</bold></td>
<td valign="top" align="center"><bold>13</bold></td>
<td valign="top" align="center"><bold>14</bold></td>
<td valign="top" align="center"><bold>15</bold></td>
</tr>
<tr>
<td valign="top" align="left">A</td>
<td valign="top" align="center">Offline</td>
<td valign="top" align="center">22</td>
<td valign="top" align="center">38</td>
<td valign="top" align="center">52</td>
<td valign="top" align="center">58</td>
<td valign="top" align="center">63</td>
<td valign="top" align="center">71</td>
<td valign="top" align="center">76</td>
<td valign="top" align="center">79</td>
<td valign="top" align="center">83</td>
<td valign="top" align="center">88</td>
<td valign="top" align="center">90</td>
<td valign="top" align="center">91</td>
<td valign="top" align="center">91</td>
<td valign="top" align="center">94</td>
<td valign="top" align="center">98</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Online</td>
<td valign="top" align="center">23</td>
<td valign="top" align="center">37</td>
<td valign="top" align="center">51</td>
<td valign="top" align="center">62</td>
<td valign="top" align="center">63</td>
<td valign="top" align="center">72</td>
<td valign="top" align="center">74</td>
<td valign="top" align="center">79</td>
<td valign="top" align="center">84</td>
<td valign="top" align="center">86</td>
<td valign="top" align="center">87</td>
<td valign="top" align="center">91</td>
<td valign="top" align="center">92</td>
<td valign="top" align="center">93</td>
<td valign="top" align="center">97</td>
</tr>
<tr>
<td valign="top" align="left">B</td>
<td valign="top" align="center">Offline</td>
<td valign="top" align="center">43</td>
<td valign="top" align="center">66</td>
<td valign="top" align="center">74</td>
<td valign="top" align="center">77</td>
<td valign="top" align="center">82</td>
<td valign="top" align="center">86</td>
<td valign="top" align="center">90</td>
<td valign="top" align="center">88</td>
<td valign="top" align="center">90</td>
<td valign="top" align="center">91</td>
<td valign="top" align="center">91</td>
<td valign="top" align="center">94</td>
<td valign="top" align="center">95</td>
<td valign="top" align="center">95</td>
<td valign="top" align="center">96</td>
</tr>
 <tr>
<td/>
<td valign="top" align="center">Online</td>
<td valign="top" align="center">39</td>
<td valign="top" align="center">64</td>
<td valign="top" align="center">72</td>
<td valign="top" align="center">77</td>
<td valign="top" align="center">82</td>
<td valign="top" align="center">87</td>
<td valign="top" align="center">89</td>
<td valign="top" align="center">87</td>
<td valign="top" align="center">89</td>
<td valign="top" align="center">91</td>
<td valign="top" align="center">90</td>
<td valign="top" align="center">95</td>
<td valign="top" align="center">95</td>
<td valign="top" align="center">97</td>
<td valign="top" align="center">97</td>
</tr></tbody>
</table>
</table-wrap>
<p>Experimental results show that the <italic>t</italic>-test conducted between the offline and online results (<italic>P</italic>-value = 0.25) yielded non-significant differences. This outcome provides strong evidence that the proposed method is highly suitable for online implementation. Moreover, the system&#x00027;s efficiency is further highlighted by the reduced number of repetitions required to achieve satisfactory results. These smaller number of repetitions demonstrate the speediness of the system, making it an efficient and practical solution for P300 signal classification tasks.</p>
</sec>
</sec>
<sec>
<title>3.2 RSVP results</title>
<p>Given the significant class imbalance in the RSVP dataset, we opted to employ balanced classification accuracy (BCA) as the performance metric, as recommended in the literature (He and Wu, <xref ref-type="bibr" rid="B8">2020</xref>). To elaborate, let&#x00027;s designate &#x0201C;m1&#x0201D; as the true number of trials from the target class and &#x0201C;m2&#x0201D; as the true number of trials from the non-target class. Additionally, &#x0201C;n1&#x0201D; and &#x0201C;n2&#x0201D; represent the number of trials correctly classified as target and non-target, respectively, by the algorithm. To compute the BCA, we follow these steps:</p>
<disp-formula id="E7"><mml:math id="M14"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mi>a</mml:mi><mml:mn>1</mml:mn><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>n</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:mfrac><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mi>a</mml:mi><mml:mn>2</mml:mn><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>In this context, &#x0201C;a1&#x0201D; refers to the classification accuracy of the target class, while &#x0201C;a2&#x0201D; represents the classification accuracy of the non-target class.</p>
<disp-formula id="E8"><mml:math id="M15"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mi>B</mml:mi><mml:mi>C</mml:mi><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>a</mml:mi><mml:mn>1</mml:mn><mml:mo>&#x0002B;</mml:mo><mml:mi>a</mml:mi><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p><xref ref-type="fig" rid="F7">Figure 7</xref> presents the BCA of the methods across four different types of analysis for Dataset 2, highlighting the improvements made in our final approach. The classifier is DRBM for all feature extraction methods. The first category termed conventional CNN without a fine-tuning approach to the target subjects&#x00027; dataset. In the fine-tuned CNN approach, we aimed to show the effect of fine-tuning on the performance by employing a fine-tuned CNN, utilizing data from source subject, to extract optimal features from the target subject&#x00027; dataset. The third category demonstrates the use of fine-tuned CNN combined with EA without employing the source selection strategy. Here, we aim to highlight the impact of EA. The features derived from both the source CNN and the target fine-tuned CNN were transformed into the Euclidean space using EA. Subsequently, the features transferred from the target, along with all the transferred features from the source, were inputted into the classifier. In the fourth approach, we present our proposed method, which integrates fine-tuned CNN with EA along with the proposed source selection approach. Ultimately, our method yields significantly higher BCA (Balanced Classification Accuracy) values compared to the other three methods. These results were evaluated using the one-way ANOVA statistical test followed by Tuckey&#x00027;s hsd <italic>post-hoc</italic>, confirming the superiority of our proposed approach (<italic>p</italic> &#x0003C; 0.001).</p>
<fig id="F7" position="float">
<label>Figure 7</label>
<caption><p>BCA values for all subjects <bold>(left)</bold> and their average <bold>(right)</bold> across four distinct training methodologies in Dataset 2. Approach (i) utilizes a conventional technique without fine-tuning, training on target characters (CNN); approach (ii) involves a fine-tuned CNN for feature extraction (Finetune-CNN); approach (iii) employs the proposed TL method without source sample selection (Finetune-CNN&#x0002B;EA); and approach (iv) incorporates the fined-tune CNN&#x0002B;EA method with source sample selection (Finetune-CNN&#x0002B;EA&#x0002B;SSS). Significance levels are denoted by &#x0002A;&#x0002A;&#x0002A; for <italic>P</italic> &#x0003C; 10<sup>&#x02212;3</sup> and &#x0002A;&#x0002A; for <italic>P</italic> &#x0003C; 10<sup>&#x02212;2</sup>.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnins-18-1360709-g0007.tif"/>
</fig>
<p>We further conducted a comprehensive comparison of our newly developed method with two existing approaches using the RSVP dataset, as reported in the literature (He and Wu, <xref ref-type="bibr" rid="B8">2020</xref>). We also followed the same evaluation criteria and procedures outlined in He and Wu (<xref ref-type="bibr" rid="B8">2020</xref>) to make the results directly comparable. The two approaches we assessed included EA-SVM and EA-xDAWN-SVM. For each method, we measured its accuracy and effectiveness in analyzing EEG data on the RSVP dataset. This comparison is represented in <xref ref-type="fig" rid="F8">Figure 8</xref>. These findings provide strong evidence for the potential superiority of our method in analyzing EEG data from the RSVP dataset. Specifically, we achieved a remarkable increase of 5.7 and 6.65%, respectively, in BCA values compared to EA-xDAWN-SVM and EA-SVM, which were the best-performing existing approaches.</p>
<fig id="F8" position="float">
<label>Figure 8</label>
<caption><p>BCA values for all subjects <bold>(left)</bold> and their average <bold>(right)</bold> for three different approaches in Dataset 2: (i) EA-SVM, (ii) EA-xDAWN-SVM, and (iii) proposed method.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnins-18-1360709-g0008.tif"/>
</fig>
</sec>
</sec>
<sec id="s4">
<title>4 Conclusion</title>
<p>This study introduced a new transfer learning approach for the ERP-based brain-computer interface that incorporates source sample selection to improve the performance of the system further. Source sample selection in transfer learning has several advantages. It can help to reduce the negative effects of domain shift, where there are differences between the distribution of data in the source and target domains. By selecting appropriate sources, it is possible to mitigate these negative effects and improve performance on the target task. The proposed selection approach chooses the most relevant source samples based on their similarity to the target samples to enhance the transferability of the model further.</p>
<p>In addition, the proposed approach utilized fine-tuning and data alignment techniques to improve the performance of the P300 BCI, especially when dealing with limited labeled data. Specifically, the approach fine-tunes a pre-trained model on a similar task using a small amount of labeled data and aligns the data distributions between the source and target domains to minimize the domain shift. The results of our experiments showed that the proposed approach outperforms the baseline models and achieves state-of-the-art performance on the datasets used in this study.</p>
<p>Furthermore, the proposed approach is shown to be generalizable to other datasets, demonstrating its potential for wider applicability. One of the most important aspects of the proposed method is extracting high-level features in a new domain (EA) while minimizing the difference between both feature groups of source and target. Importantly, while Euclidean Alignment has been explored in the context of transfer learning for BCIs, our work demonstrates its novel application to high-level features extracted from convolutional neural networks. This approach directly addresses the inherent variability of EEG signals between subjects, facilitating more robust knowledge transfer and improving performance compared to methods that focus solely on raw time samples. The findings of this study suggest that fine-tuning, data alignment, and source sample selection could be promising techniques for enhancing the performance of ERP-based BCIs while reducing calibration time and could pave the way for further research in this area.</p>
</sec>
<sec sec-type="data-availability" id="s5">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/supplementary material, further inquiries can be directed to the corresponding author.</p>
</sec>
<sec sec-type="ethics-statement" id="s6">
<title>Ethics statement</title>
<p>Ethical approval was not required for the study involving humans in accordance with the local legislation and institutional requirements. Written informed consent to participate in this study was not required from the participants or the participants&#x00027; legal guardians/next of kin in accordance with the national legislation and the institutional requirements.</p>
</sec>
<sec sec-type="author-contributions" id="s7">
<title>Author contributions</title>
<p>SK: Conceptualization, Formal analysis, Investigation, Methodology, Software, Validation, Visualization, Writing &#x02013; original draft, Writing &#x02013; review &#x00026; editing. SA: Conceptualization, Formal analysis, Investigation, Methodology, Software, Supervision, Writing &#x02013; original draft, Writing &#x02013; review &#x00026; editing. YF: Supervision, Writing &#x02013; original draft, Writing &#x02013; review &#x00026; editing. AS: Supervision, Writing &#x02013; original draft, Writing &#x02013; review &#x00026; editing.</p>
</sec>
</body>
<back>
<sec sec-type="funding-information" id="s8">
<title>Funding</title>
<p>The author(s) declare that no financial support was received for the research, authorship, and/or publication of this article.</p>
</sec>
<sec sec-type="COI-statement" id="conf1">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s9">
<title>Publisher&#x00027;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Abiri</surname> <given-names>R.</given-names></name> <name><surname>Borhani</surname> <given-names>S.</given-names></name> <name><surname>Sellers</surname> <given-names>E. W.</given-names></name> <name><surname>Jiang</surname> <given-names>Y.</given-names></name> <name><surname>Zhao</surname> <given-names>X.</given-names></name></person-group> (<year>2019</year>). <article-title>A comprehensive review of EEG-based brain-computer interface paradigms</article-title>. <source>J. Neural Eng</source>. <volume>16</volume>:<fpage>aaf12e</fpage>. <pub-id pub-id-type="doi">10.1088/1741-2552/aaf12e</pub-id><pub-id pub-id-type="pmid">30523919</pub-id></citation></ref>
<ref id="B2">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Aghili</surname> <given-names>S. N.</given-names></name> <name><surname>Kilani</surname> <given-names>S.</given-names></name> <name><surname>Khushaba</surname> <given-names>R. N.</given-names></name> <name><surname>Rouhani</surname> <given-names>E.</given-names></name></person-group> (<year>2023</year>). <article-title>A spatial-temporal linear feature learning algorithm for P300-based brain-computer interfaces</article-title>. <source>Heliyon</source> <volume>9</volume>:<fpage>e15380</fpage>. <pub-id pub-id-type="doi">10.1016/j.heliyon.2023.e15380</pub-id><pub-id pub-id-type="pmid">37113774</pub-id></citation></ref>
<ref id="B31">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Blankertz</surname> <given-names>B.</given-names></name> <name><surname>Muller</surname> <given-names>K. R.</given-names></name> <name><surname>Krusienski</surname> <given-names>D. J.</given-names></name> <name><surname>Schalk</surname> <given-names>G.</given-names></name> <name><surname>Wolpaw</surname> <given-names>J. R.</given-names></name> <name><surname>Schlogl</surname> <given-names>A.</given-names></name> <etal/></person-group>. (<year>2006</year>). <article-title>The BCI competition III: validating alternative approaches to actual BCI problems</article-title>. <source>IEEE Trans. Neural-Syst. Rehabil. Eng</source>. <volume>14</volume>, <fpage>153</fpage>&#x02013;<lpage>159</lpage>. <pub-id pub-id-type="doi">10.1109/TNSRE.2006.875642</pub-id><pub-id pub-id-type="pmid">16792282</pub-id></citation>
</ref>
<ref id="B3">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bonci</surname> <given-names>A.</given-names></name> <name><surname>Fiori</surname> <given-names>S.</given-names></name> <name><surname>Higashi</surname> <given-names>H.</given-names></name> <name><surname>Tanaka</surname> <given-names>T.</given-names></name> <name><surname>Verdini</surname> <given-names>F.</given-names></name></person-group> (<year>2021</year>). <article-title>An introductory tutorial on brain-computer interfaces and their applications</article-title>. <source>Electron</source> <volume>10</volume>, <fpage>1</fpage>&#x02013;<lpage>43</lpage>. <pub-id pub-id-type="doi">10.3390/electronics10050560</pub-id></citation>
</ref>
<ref id="B4">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cecotti</surname> <given-names>H.</given-names></name> <name><surname>Gr&#x000E4;ser</surname> <given-names>A.</given-names></name></person-group> (<year>2011</year>). <article-title>Convolutional neural networks for P300 detection with application to brain-computer interfaces</article-title>. <source>IEEE Trans. Pattern Anal. Mach. Intell</source>. <volume>33</volume>, <fpage>433</fpage>&#x02013;<lpage>445</lpage>. <pub-id pub-id-type="doi">10.1109/TPAMI.2010.125</pub-id><pub-id pub-id-type="pmid">20567055</pub-id></citation></ref>
<ref id="B5">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Farwell</surname> <given-names>L. A.</given-names></name> <name><surname>Donchin</surname> <given-names>E.</given-names></name></person-group> (<year>1988</year>). <article-title>Talking off the top of your head: toward a mental prosthesis utilizing event-related brain potentials</article-title>. <source>Electroencephalogr. Clin. Neurophysiol</source>. <volume>70</volume>, <fpage>510</fpage>&#x02013;<lpage>523</lpage>. <pub-id pub-id-type="doi">10.1016/0013-4694(88)90149-6</pub-id><pub-id pub-id-type="pmid">2461285</pub-id></citation></ref>
<ref id="B6">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Goldberger</surname> <given-names>A. L.</given-names></name> <name><surname>Amaral</surname> <given-names>L. A.</given-names></name> <name><surname>Glass</surname> <given-names>L.</given-names></name> <name><surname>Hausdorff</surname> <given-names>J. M.</given-names></name> <name><surname>Ivanov</surname> <given-names>P. C.</given-names></name> <name><surname>Mark</surname> <given-names>R. G.</given-names></name> <etal/></person-group>. (<year>2000</year>). <article-title>PhysioBank, PhysioToolkit, and PhysioNet: components of a new research resource for complex physiologic signals</article-title>. <source>Circulation</source> <volume>101</volume>:<fpage>e215</fpage>. <pub-id pub-id-type="doi">10.1161/01.CIR.101.23.e215</pub-id><pub-id pub-id-type="pmid">10851218</pub-id></citation></ref>
<ref id="B7">
<citation citation-type="journal"><person-group person-group-type="editor"><name><surname>Guo</surname> <given-names>L. (ed.).</given-names></name></person-group> (<year>2020</year>). <source>Neural Interface Engineering: Linking the Physical World and the Nervous System</source>. Springer Nature.</citation>
</ref>
<ref id="B8">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>He</surname> <given-names>H.</given-names></name> <name><surname>Wu</surname> <given-names>D.</given-names></name></person-group> (<year>2020</year>). <article-title>Transfer learning for brain-computer interfaces: a euclidean space data alignment approach</article-title>. <source>IEEE Trans. Biomed. Eng</source>. <volume>67</volume>, <fpage>399</fpage>&#x02013;<lpage>410</lpage>. <pub-id pub-id-type="doi">10.1109/TBME.2019.2913914</pub-id><pub-id pub-id-type="pmid">31034407</pub-id></citation></ref>
<ref id="B9">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kaufmann</surname> <given-names>T.</given-names></name> <name><surname>Schulz</surname> <given-names>S. M.</given-names></name> <name><surname>Gr&#x000FC;nzinger</surname> <given-names>C.</given-names></name> <name><surname>K&#x000FC;bler</surname> <given-names>A.</given-names></name></person-group> (<year>2011</year>). <article-title>Flashing characters with famous faces improves ERP-based brain-computer interface performance</article-title>. <source>J. Neural Eng</source>. <volume>8</volume>:<fpage>056016</fpage>. <pub-id pub-id-type="doi">10.1088/1741-2560/8/5/056016</pub-id><pub-id pub-id-type="pmid">21934188</pub-id></citation></ref>
<ref id="B10">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kawala-Sterniuk</surname> <given-names>A.</given-names></name> <name><surname>Browarska</surname> <given-names>N.</given-names></name> <name><surname>Al-Bakri</surname> <given-names>A.</given-names></name> <name><surname>Pelc</surname> <given-names>M.</given-names></name> <name><surname>Zygarlicki</surname> <given-names>J.</given-names></name> <name><surname>Sidikova</surname> <given-names>M.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>Summary of over fifty years with brain-computer interfaces-a review</article-title>. <source>Brain Sci</source>. <volume>11</volume>, <fpage>1</fpage>&#x02013;<lpage>41</lpage>. <pub-id pub-id-type="doi">10.3390/brainsci11010043</pub-id><pub-id pub-id-type="pmid">33401571</pub-id></citation></ref>
<ref id="B11">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kilani</surname> <given-names>S.</given-names></name> <name><surname>Aghili</surname> <given-names>S. N.</given-names></name> <name><surname>Hulea</surname> <given-names>M.</given-names></name></person-group> (<year>2023</year>). <article-title>Enhancing P300-based brain-computer interfaces with hybrid transfer learning: a data alignment and fine-tuning approach</article-title>. <source>Appl. Sci</source>. <volume>13</volume>:<fpage>106283</fpage>. <pub-id pub-id-type="doi">10.3390/app13106283</pub-id></citation>
</ref>
<ref id="B12">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kilani</surname> <given-names>S.</given-names></name> <name><surname>Kordmahale</surname> <given-names>S. N. A.</given-names></name> <name><surname>Ghassemlooy</surname> <given-names>Z.</given-names></name> <name><surname>Hulea</surname> <given-names>M.</given-names></name> <name><surname>Wu</surname> <given-names>Q.</given-names></name></person-group> (<year>2022</year>). <article-title>Reducing calibration time using novel hybrid transfer-learning for P300-based BCI applications</article-title>. <source>2022 13th Int. Symp. Commun. Syst. Networks Digit. Signal Process. CSNDSP 2022 19111</source> <volume>2022</volume>, <fpage>401</fpage>&#x02013;<lpage>405</lpage>. <pub-id pub-id-type="doi">10.1109/CSNDSP54353.2022.9908000</pub-id></citation>
</ref>
<ref id="B13">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kordmahale</surname> <given-names>S. N. A.</given-names></name> <name><surname>Kilani</surname> <given-names>S.</given-names></name> <name><surname>Ghassemlooy</surname> <given-names>Z.</given-names></name> <name><surname>Wu</surname> <given-names>Q.</given-names></name> <name><surname>Maleki</surname> <given-names>A.</given-names></name></person-group> (<year>2022</year>). <article-title>A novel artifact removal method for the SSVEP signal using hybrid CCA-DWT and comparative analysis for feature selection and classification in the P300 signal</article-title>. <source>2022 13th Int. Symp. Commun. Syst. Networks Digit. Signal Process. CSNDSP</source> <volume>2022</volume>, <fpage>390</fpage>&#x02013;<lpage>394</lpage>. <pub-id pub-id-type="doi">10.1109/CSNDSP54353.2022.9907961</pub-id></citation>
</ref>
<ref id="B14">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kundu</surname> <given-names>S.</given-names></name> <name><surname>Ari</surname> <given-names>S.</given-names></name></person-group> (<year>2020a</year>). <article-title>MsCNN: a deep learning framework for P300-based brain-computer interface speller</article-title>. <source>IEEE Trans. Med. Robot. Bionics</source> <volume>2</volume>, <fpage>86</fpage>&#x02013;<lpage>93</lpage>. <pub-id pub-id-type="doi">10.1109/TMRB.2019.2959559</pub-id><pub-id pub-id-type="pmid">37021904</pub-id></citation></ref>
<ref id="B15">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kundu</surname> <given-names>S.</given-names></name> <name><surname>Ari</surname> <given-names>S.</given-names></name></person-group> (<year>2020b</year>). <article-title>P300 based character recognition using convolutional neural network and support vector machine</article-title>. <source>Biomed. Signal Process. Control</source> <volume>55</volume>:<fpage>101645</fpage>. <pub-id pub-id-type="doi">10.1016/j.bspc.2019.101645</pub-id></citation>
</ref>
<ref id="B16">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Larochelle</surname> <given-names>H.</given-names></name> <name><surname>Bengio</surname> <given-names>Y.</given-names></name></person-group> (<year>2008</year>). <article-title>Classification using discriminative restricted boltzmann machines</article-title>. <source>Proc. 25th Int. Conf. Mach. Learn</source>. <volume>2008</volume>, <fpage>536</fpage>&#x02013;<lpage>543</lpage>. <pub-id pub-id-type="doi">10.1145/1390156.1390224</pub-id></citation>
</ref>
<ref id="B17">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lees</surname> <given-names>S.</given-names></name> <name><surname>Dayan</surname> <given-names>N.</given-names></name> <name><surname>Cecotti</surname> <given-names>H.</given-names></name> <name><surname>McCullagh</surname> <given-names>P.</given-names></name> <name><surname>Maguire</surname> <given-names>L.</given-names></name> <name><surname>Lotte</surname> <given-names>F.</given-names></name> <etal/></person-group>. (<year>2018</year>). <article-title>A review of rapid serial visual presentation-based brain-computer interfaces</article-title>. <source>J. Neural Eng</source>. <volume>15</volume>:<fpage>aa9817</fpage>. <pub-id pub-id-type="doi">10.1088/1741-2552/aa9817</pub-id><pub-id pub-id-type="pmid">29099388</pub-id></citation></ref>
<ref id="B18">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lin</surname> <given-names>Z.</given-names></name> <name><surname>Zhang</surname> <given-names>C.</given-names></name> <name><surname>Zeng</surname> <given-names>Y.</given-names></name> <name><surname>Tong</surname> <given-names>L.</given-names></name> <name><surname>Yan</surname> <given-names>B.</given-names></name></person-group> (<year>2018</year>). <article-title>A novel P300 BCI speller based on the Triple RSVP paradigm</article-title>. <source>Sci. Rep</source>. <volume>8</volume>, <fpage>1</fpage>&#x02013;<lpage>9</lpage>. <pub-id pub-id-type="doi">10.1038/s41598-018-21717-y</pub-id><pub-id pub-id-type="pmid">29463870</pub-id></citation></ref>
<ref id="B19">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lotte</surname> <given-names>F.</given-names></name> <name><surname>Congedo</surname> <given-names>M.</given-names></name> <name><surname>L&#x000E9;cuyer</surname> <given-names>A.</given-names></name> <name><surname>Lamarche</surname> <given-names>F.</given-names></name> <name><surname>Arnaldi</surname> <given-names>B.</given-names></name></person-group> (<year>2007</year>). <article-title>A review of classification algorithms for EEG-based brain-computer interfaces</article-title>. <source>J. Neural Eng</source>. <volume>4</volume>:<fpage>R01</fpage>. <pub-id pub-id-type="doi">10.1088/1741-2560/4/2/R01</pub-id><pub-id pub-id-type="pmid">17409472</pub-id></citation></ref>
<ref id="B20">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lu</surname> <given-names>Z.</given-names></name> <name><surname>Li</surname> <given-names>Q.</given-names></name> <name><surname>Gao</surname> <given-names>N.</given-names></name> <name><surname>Yang</surname> <given-names>J.</given-names></name></person-group> (<year>2020a</year>). <article-title>The self-face paradigm improves the performance of the P300-speller system</article-title>. <source>Front. Comput. Neurosci</source>. <volume>13</volume>, <fpage>1</fpage>&#x02013;<lpage>12</lpage>. <pub-id pub-id-type="doi">10.3389/fncom.2019.00093</pub-id><pub-id pub-id-type="pmid">32009923</pub-id></citation></ref>
<ref id="B21">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lu</surname> <given-names>Z.</given-names></name> <name><surname>Li</surname> <given-names>Q.</given-names></name> <name><surname>Gao</surname> <given-names>N.</given-names></name> <name><surname>Yang</surname> <given-names>J.</given-names></name> <name><surname>Bai</surname> <given-names>O.</given-names></name></person-group> (<year>2019</year>). <article-title>Happy emotion cognition of bimodal audiovisual stimuli optimizes the performance of the P300 speller</article-title>. <source>Brain Behav</source>. <volume>9</volume>, <fpage>1</fpage>&#x02013;<lpage>13</lpage>. <pub-id pub-id-type="doi">10.1002/brb3.1479</pub-id><pub-id pub-id-type="pmid">31729840</pub-id></citation></ref>
<ref id="B22">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lu</surname> <given-names>Z.</given-names></name> <name><surname>Qi</surname> <given-names>L.</given-names></name> <name><surname>Ning</surname> <given-names>G.</given-names></name> <name><surname>Jingjing</surname> <given-names>Y.</given-names></name></person-group> (<year>2020b</year>). <article-title>Time-varying networks of ERPs in P300-speller paradigms based on spatially and semantically congruent audiovisual bimodality</article-title>. <source>J. Neural Eng</source>. <volume>17</volume>:<fpage>046015</fpage>. <pub-id pub-id-type="doi">10.1088/1741-2552/aba07f</pub-id><pub-id pub-id-type="pmid">32590363</pub-id></citation></ref>
<ref id="B23">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Matran-Fernandez</surname> <given-names>A.</given-names></name> <name><surname>Poli</surname> <given-names>R.</given-names></name></person-group> (<year>2017</year>). <article-title>Towards the automated localisation of targets in rapid image-sifting by collaborative braincomputer interfaces</article-title>. <source>PLoS ONE</source> <volume>12</volume>, <fpage>1</fpage>&#x02013;<lpage>28</lpage>. <pub-id pub-id-type="doi">10.1371/journal.pone.0178498</pub-id><pub-id pub-id-type="pmid">28562664</pub-id></citation></ref>
<ref id="B24">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>McWeeny</surname> <given-names>S.</given-names></name> <name><surname>Norton</surname> <given-names>E. S.</given-names></name></person-group> (<year>2020</year>). <article-title>Understanding event-related potentials (ERPs) in clinical and basic language and communication disorders research: a tutorial</article-title>. <source>Int. J. Lang. Commun. Disord</source>. <volume>55</volume>, <fpage>445</fpage>&#x02013;<lpage>457</lpage>. <pub-id pub-id-type="doi">10.1111/1460-6984.12535</pub-id><pub-id pub-id-type="pmid">32347637</pub-id></citation></ref>
<ref id="B25">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mendoza-Montoya</surname> <given-names>O.</given-names></name> <name><surname>Antelis</surname> <given-names>J. M.</given-names></name> <name><surname>Delijorge</surname> <given-names>J.</given-names></name></person-group> (<year>2021</year>). <article-title>P300-based brain-computer interface for communication and control</article-title>. <source>Elsevier Inc</source>. <volume>2021</volume>:<fpage>9</fpage>. <pub-id pub-id-type="doi">10.1016/B978-0-12-820125-1.00026-9</pub-id></citation>
</ref>
<ref id="B26">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Miller</surname> <given-names>K. J.</given-names></name> <name><surname>Hermes</surname> <given-names>D.</given-names></name> <name><surname>Staff</surname> <given-names>N. P.</given-names></name></person-group> (<year>2020</year>). <article-title>The current state of electrocorticography-based brain-computer interfaces</article-title>. <source>Neurosurg. Focus</source> <volume>49</volume>, <fpage>1</fpage>&#x02013;<lpage>8</lpage>. <pub-id pub-id-type="doi">10.3171/2020.4.FOCUS20352</pub-id><pub-id pub-id-type="pmid">32610292</pub-id></citation></ref>
<ref id="B27">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mridha</surname> <given-names>M. F.</given-names></name> <name><surname>Das</surname> <given-names>S. C.</given-names></name> <name><surname>Kabir</surname> <given-names>M. M.</given-names></name> <name><surname>Lima</surname> <given-names>A. A.</given-names></name> <name><surname>Islam</surname> <given-names>M. R.</given-names></name> <name><surname>Watanobe</surname> <given-names>Y.</given-names></name></person-group> (<year>2021</year>). <article-title>Brain-computer interface: advancement and challenges</article-title>. <source>Sensors</source> <volume>21</volume>, <fpage>1</fpage>&#x02013;<lpage>46</lpage>. <pub-id pub-id-type="doi">10.3390/s21175746</pub-id><pub-id pub-id-type="pmid">34502636</pub-id></citation></ref>
<ref id="B28">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Peksa</surname> <given-names>J.</given-names></name> <name><surname>Mamchur</surname> <given-names>D.</given-names></name></person-group> (<year>2023</year>). <article-title>State-of-the-art on brain-computer interface technology</article-title>. <source>Sensors</source> <volume>23</volume>:<fpage>6001</fpage>. <pub-id pub-id-type="doi">10.3390/s23136001</pub-id><pub-id pub-id-type="pmid">37447849</pub-id></citation></ref>
<ref id="B29">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Qi</surname> <given-names>H.</given-names></name> <name><surname>Xue</surname> <given-names>Y.</given-names></name> <name><surname>Xu</surname> <given-names>L.</given-names></name> <name><surname>Cao</surname> <given-names>Y.</given-names></name> <name><surname>Jiao</surname> <given-names>X.</given-names></name></person-group> (<year>2018</year>). <article-title>A speedy calibration method using riemannian geometry measurement and other-subject samples on A P300 speller</article-title>. <source>IEEE Trans. Neural Syst. Rehabil. Eng</source>. <volume>26</volume>, <fpage>602</fpage>&#x02013;<lpage>608</lpage>. <pub-id pub-id-type="doi">10.1109/TNSRE.2018.2801887</pub-id><pub-id pub-id-type="pmid">29522404</pub-id></citation></ref>
<ref id="B30">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Rashid</surname> <given-names>M.</given-names></name> <name><surname>Sulaiman</surname> <given-names>N.</given-names></name> <name><surname>Abdul Majeed</surname> <given-names>P. P. A.</given-names></name> <name><surname>Musa</surname> <given-names>R. M.</given-names></name> <name><surname>Ahmad</surname> <given-names>A. F.</given-names></name> <name><surname>Bari</surname> <given-names>A. S.</given-names></name> <etal/></person-group>. (<year>2020</year>). <article-title>Current status, challenges, and possible solutions of EEG-based brain-computer interface: a comprehensive review</article-title>. <source>Front. Neurorobot</source>. <volume>14</volume>, <fpage>1</fpage>&#x02013;<lpage>35</lpage>. <pub-id pub-id-type="doi">10.3389/fnbot.2020.00025</pub-id><pub-id pub-id-type="pmid">32581758</pub-id></citation></ref>
<ref id="B32">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Thodoroff</surname> <given-names>P.</given-names></name> <name><surname>Pineau</surname> <given-names>J.</given-names></name> <name><surname>Lim</surname> <given-names>A.</given-names></name></person-group> (<year>2016</year>). <article-title>&#x0201C;Learning robust features using deep learning for automatic seizure detection,&#x0201D;</article-title> in <source>Machine Learning for Healthcare Conference</source> (<publisher-loc>PMLR</publisher-loc>).</citation>
</ref>
<ref id="B33">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Valakos</surname> <given-names>D.</given-names></name> <name><surname>d&#x00027;Avossa</surname> <given-names>G.</given-names></name> <name><surname>Mylonas</surname> <given-names>D.</given-names></name> <name><surname>Butler</surname> <given-names>J.</given-names></name> <name><surname>Klein</surname> <given-names>C.</given-names></name> <name><surname>Smyrnis</surname> <given-names>N.</given-names></name></person-group> (<year>2020</year>). <article-title>P300 response modulation reflects breaches of non-probabilistic expectations</article-title>. <source>Sci. Rep</source>. <volume>10</volume>, <fpage>1</fpage>&#x02013;<lpage>11</lpage>. <pub-id pub-id-type="doi">10.1038/s41598-020-67275-0</pub-id><pub-id pub-id-type="pmid">32581245</pub-id></citation></ref>
<ref id="B34">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Van Der Maaten</surname> <given-names>L.</given-names></name> <name><surname>Hinton</surname> <given-names>G.</given-names></name></person-group> (<year>2008</year>). <article-title>Visualizing data using t-SNE</article-title>. <source>J. Mach. Learn. Res</source>. <volume>9</volume>, <fpage>2579</fpage>&#x02013;<lpage>2625</lpage>.</citation>
</ref>
<ref id="B35">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Varsamou</surname> <given-names>M.</given-names></name> <name><surname>Antonakopoulos</surname> <given-names>T.</given-names></name></person-group> (<year>2019</year>). <article-title>Classification using discriminative restricted boltzmann machines on spark</article-title>. <source>2019 27th Int. Conf. Software, Telecommun. Comput. Networks, SoftCOM</source> <volume>2019</volume>, <fpage>1</fpage>&#x02013;<lpage>6</lpage>. <pub-id pub-id-type="doi">10.23919/SOFTCOM.2019.8903859</pub-id></citation>
</ref>
<ref id="B36">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>Z.</given-names></name> <name><surname>Dai</surname> <given-names>Z.</given-names></name> <name><surname>Poczos</surname> <given-names>B.</given-names></name> <name><surname>Carbonell</surname> <given-names>J.</given-names></name></person-group> (<year>2019</year>). <article-title>Characterizing and avoiding negative transfer</article-title>. <source>Proc. IEEE Comput. Soc. Conf. Comput. Vis. Pattern Recognit</source>. <volume>2019</volume>, <fpage>11285</fpage>&#x02013;<lpage>11294</lpage>. <pub-id pub-id-type="doi">10.1109/CVPR.2019.01155</pub-id></citation>
</ref>
<ref id="B37">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wei</surname> <given-names>W.</given-names></name> <name><surname>Qiu</surname> <given-names>S.</given-names></name> <name><surname>Ma</surname> <given-names>X.</given-names></name> <name><surname>Li</surname> <given-names>D.</given-names></name> <name><surname>Wang</surname> <given-names>B.</given-names></name> <name><surname>He</surname> <given-names>H.</given-names></name></person-group> (<year>2020</year>). <article-title>Reducing calibration efforts in RSVP tasks with multi-source adversarial domain adaptation</article-title>. <source>IEEE Trans. Neural Syst. Rehabil. Eng</source>. <volume>28</volume>, <fpage>2344</fpage>&#x02013;<lpage>2355</lpage>. <pub-id pub-id-type="doi">10.1109/TNSRE.2020.3023761</pub-id><pub-id pub-id-type="pmid">32924941</pub-id></citation></ref>
<ref id="B38">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Won</surname> <given-names>K.</given-names></name> <name><surname>Kwon</surname> <given-names>M.</given-names></name> <name><surname>Jang</surname> <given-names>S.</given-names></name> <name><surname>Ahn</surname> <given-names>M.</given-names></name> <name><surname>Jun</surname> <given-names>S. C.</given-names></name></person-group> (<year>2019</year>). <article-title>P300 speller performance predictor based on RSVP multi-feature</article-title>. <source>Front. Hum. Neurosci</source>. <volume>13</volume>, <fpage>1</fpage>&#x02013;<lpage>14</lpage>. <pub-id pub-id-type="doi">10.3389/fnhum.2019.00261</pub-id><pub-id pub-id-type="pmid">31417382</pub-id></citation></ref>
<ref id="B39">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wu</surname> <given-names>D.</given-names></name> <name><surname>Xu</surname> <given-names>Y.</given-names></name> <name><surname>Lu</surname> <given-names>B. L.</given-names></name></person-group> (<year>2022</year>). <article-title>Transfer learning for EEG-based brain-computer interfaces: a review of progress made since 2016</article-title>. <source>IEEE Trans. Cogn. Dev. Syst</source>. <volume>14</volume>, <fpage>4</fpage>&#x02013;<lpage>19</lpage>. <pub-id pub-id-type="doi">10.1109/TCDS.2020.3007453</pub-id></citation>
</ref>
<ref id="B40">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yadav</surname> <given-names>D.</given-names></name> <name><surname>Yadav</surname> <given-names>S.</given-names></name> <name><surname>Veer</surname> <given-names>K.</given-names></name></person-group> (<year>2020</year>). <article-title>A comprehensive assessment of brain computer interfaces: recent trends and challenges</article-title>. <source>J. Neurosci. Methods</source> <volume>346</volume>:<fpage>108918</fpage>. <pub-id pub-id-type="doi">10.1016/j.jneumeth.2020.108918</pub-id><pub-id pub-id-type="pmid">32853592</pub-id></citation></ref>
<ref id="B41">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ydaav</surname> <given-names>H.</given-names></name> <name><surname>Maini</surname> <given-names>S.</given-names></name></person-group> (<year>2023</year>). <article-title>Electroencephalogram based brain-computer interface: applications, challenges, and opportunities</article-title>. <source>Multimedia Tools Appl</source>. <volume>82</volume>, <fpage>47003</fpage>&#x02013;<lpage>47047</lpage>. <pub-id pub-id-type="doi">10.1007/s11042-023-15653-x</pub-id><pub-id pub-id-type="pmid">37362726</pub-id></citation></ref>
<ref id="B42">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zanini</surname> <given-names>P.</given-names></name> <name><surname>Congedo</surname> <given-names>M.</given-names></name> <name><surname>Jutten</surname> <given-names>C.</given-names></name> <name><surname>Said</surname> <given-names>S.</given-names></name> <name><surname>Berthoumieu</surname> <given-names>Y.</given-names></name></person-group> (<year>2018</year>). <article-title>Transfer learning: a Riemannian geometry framework with applications to brain-computer interfaces</article-title>. <source>IEEE Trans. Biomed. Eng</source>. <volume>65</volume>, <fpage>1107</fpage>&#x02013;<lpage>1116</lpage>. <pub-id pub-id-type="doi">10.1109/TBME.2017.2742541</pub-id><pub-id pub-id-type="pmid">28841546</pub-id></citation></ref>
<ref id="B43">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>Y.</given-names></name> <name><surname>Xu</surname> <given-names>H.</given-names></name> <name><surname>Zhao</surname> <given-names>Y.</given-names></name> <name><surname>Zhang</surname> <given-names>L.</given-names></name> <name><surname>Zhang</surname> <given-names>Y.</given-names></name></person-group> (<year>2021</year>). <article-title>Application of the P300 potential in cognitive impairment assessments after transient ischemic attack or minor stroke</article-title>. <source>Neurol. Res</source>. <volume>43</volume>, <fpage>336</fpage>&#x02013;<lpage>341</lpage>. <pub-id pub-id-type="doi">10.1080/01616412.2020.1866245</pub-id><pub-id pub-id-type="pmid">33443462</pub-id></citation></ref>
<ref id="B44">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhuang</surname> <given-names>F.</given-names></name> <name><surname>Qi</surname> <given-names>Z.</given-names></name> <name><surname>Duan</surname> <given-names>K.</given-names></name> <name><surname>Xi</surname> <given-names>D.</given-names></name> <name><surname>Zhu</surname> <given-names>Y.</given-names></name> <name><surname>Zhu</surname> <given-names>H.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>A comprehensive survey on transfer learning</article-title>. <source>Proc. IEEE</source> <volume>109</volume>, <fpage>43</fpage>&#x02013;<lpage>76</lpage>. <pub-id pub-id-type="doi">10.1109/JPROC.2020.3004555</pub-id></citation>
</ref>
</ref-list>
</back>
</article>