<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article 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. Neurorobot.</journal-id>
<journal-title>Frontiers in Neurorobotics</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Neurorobot.</abbrev-journal-title>
<issn pub-type="epub">1662-5218</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fnbot.2021.618408</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>EEG-Based Driving Fatigue Detection Using a Two-Level Learning Hierarchy Radial Basis Function</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>Ren</surname> <given-names>Ziwu</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1119666/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Li</surname> <given-names>Rihui</given-names></name>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/454797/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Chen</surname> <given-names>Bin</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
</contrib>
<contrib contrib-type="author">
<name><surname>Zhang</surname> <given-names>Hongmiao</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
</contrib>
<contrib contrib-type="author">
<name><surname>Ma</surname> <given-names>Yuliang</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
</contrib>
<contrib contrib-type="author">
<name><surname>Wang</surname> <given-names>Chushan</given-names></name>
<xref ref-type="aff" rid="aff4"><sup>4</sup></xref>
</contrib>
<contrib contrib-type="author">
<name><surname>Lin</surname> <given-names>Ying</given-names></name>
<xref ref-type="aff" rid="aff5"><sup>5</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/891075/overview"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Zhang</surname> <given-names>Yingchun</given-names></name>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/220590/overview"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Robotics and Microsystems Center, Soochow University</institution>, <addr-line>Suzhou</addr-line>, <country>China</country></aff>
<aff id="aff2"><sup>2</sup><institution>Department of Biomedical Engineering, University of Houston</institution>, <addr-line>Houston, TX</addr-line>, <country>United States</country></aff>
<aff id="aff3"><sup>3</sup><institution>College of Automation, Intelligent Control &#x00026; Robotics Institute, Hangzhou Dianzi University</institution>, <addr-line>Hangzhou</addr-line>, <country>China</country></aff>
<aff id="aff4"><sup>4</sup><institution>Guangdong Provincial Work Injury Rehabilitation Hospital</institution>, <addr-line>Guangzhou</addr-line>, <country>China</country></aff>
<aff id="aff5"><sup>5</sup><institution>Department of Industrial Engineering, University of Houston</institution>, <addr-line>Houston, TX</addr-line>, <country>United States</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Mukesh Prasad, University of Technology Sydney, Australia</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Devika Chhachhiya, Maharshi Dayanand University, India; Di Wu, Chongqing Institute of Green and Intelligent Technology (CAS), China</p></fn>
<corresp id="c001">&#x0002A;Correspondence: Yingchun Zhang <email>yzhang94&#x00040;uh.edu</email></corresp>
</author-notes>
<pub-date pub-type="epub">
<day>11</day>
<month>02</month>
<year>2021</year>
</pub-date>
<pub-date pub-type="collection">
<year>2021</year>
</pub-date>
<volume>15</volume>
<elocation-id>618408</elocation-id>
<history>
<date date-type="received">
<day>16</day>
<month>10</month>
<year>2020</year>
</date>
<date date-type="accepted">
<day>05</day>
<month>01</month>
<year>2021</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2021 Ren, Li, Chen, Zhang, Ma, Wang, Lin and Zhang.</copyright-statement>
<copyright-year>2021</copyright-year>
<copyright-holder>Ren, Li, Chen, Zhang, Ma, Wang, Lin and Zhang</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><p>Electroencephalography (EEG)-based driving fatigue detection has gained increasing attention recently due to the non-invasive, low-cost, and potable nature of the EEG technology, but it is still challenging to extract informative features from noisy EEG signals for driving fatigue detection. Radial basis function (RBF) neural network has drawn lots of attention as a promising classifier due to its linear-in-the-parameters network structure, strong non-linear approximation ability, and desired generalization property. The RBF network performance heavily relies on network parameters such as the number of the hidden nodes, number of the center vectors, width, and output weights. However, global optimization methods that directly optimize all the network parameters often result in high evaluation cost and slow convergence. To enhance the accuracy and efficiency of EEG-based driving fatigue detection model, this study aims to develop a two-level learning hierarchy RBF network (RBF-TLLH) which allows for global optimization of the key network parameters. Experimental EEG data were collected, at both fatigue and alert states, from six healthy participants in a simulated driving environment. Principal component analysis was first utilized to extract features from EEG signals, and the proposed RBF-TLLH was then employed for driving status (fatigue <italic>vs</italic>. alert) classification. The results demonstrated that the proposed RBF-TLLH approach achieved a better classification performance (mean accuracy: 92.71%; area under the receiver operating curve: 0.9199) compared to other widely used artificial neural networks. Moreover, only three core parameters need to be determined using the training datasets in the proposed RBF-TLLH classifier, which increases its reliability and applicability. The findings demonstrate that the proposed RBF-TLLH approach can be used as a promising framework for reliable EEG-based driving fatigue detection.</p></abstract>
<kwd-group>
<kwd>driving fatigue detection</kwd>
<kwd>electroencephalography</kwd>
<kwd>principal component analysis</kwd>
<kwd>radial basis function</kwd>
<kwd>neural network</kwd>
<kwd>classification</kwd>
</kwd-group>
<contract-num rid="cn001">51675358</contract-num>
<contract-sponsor id="cn001">National Natural Science Foundation of China<named-content content-type="fundref-id">10.13039/501100001809</named-content></contract-sponsor>
<counts>
<fig-count count="8"/>
<table-count count="2"/>
<equation-count count="9"/>
<ref-count count="56"/>
<page-count count="12"/>
<word-count count="8275"/>
</counts>
</article-meta>
</front>
<body>

<sec sec-type="intro" id="s1">
<title>Introduction</title>
<p>Driving fatigue is a typical mental and physical concern that weakens the driver&#x00027;s ability to control the vehicle (Li Z. et al., <xref ref-type="bibr" rid="B29">2017</xref>). It not only poses a significant injury and fatality risk to the drivers but also causes injury to other road users such as passengers, motorbike users, other drivers, and pedestrians. According to the statistical data reported by the World Health Organization, more than 1.3 million people are killed in traffic accidents every year mainly due to fatigued driving (Sahayadhas et al., <xref ref-type="bibr" rid="B40">2012</xref>; Li Z. et al., <xref ref-type="bibr" rid="B29">2017</xref>). Therefore, it is of great importance to investigate the characteristics of driving fatigue and develop an automatic driving fatigue detection system with reliable detection performance (Li Z. et al., <xref ref-type="bibr" rid="B29">2017</xref>; Sikander and Anwar, <xref ref-type="bibr" rid="B46">2019</xref>).</p>
<p>The currently available methods for driving fatigue detection can be characterized into three categories (Sikander and Anwar, <xref ref-type="bibr" rid="B46">2019</xref>): (1) psychology-based approach that generally relies on psychometric questionnaires to evaluate an individual&#x00027;s fatigue level (Michielsen et al., <xref ref-type="bibr" rid="B35">2004</xref>), (2) video-based approach that usually monitors the behavioral and physical status of the driver, such as facial features, head position, reaction time, steering errors, lane deviation, etc. (Akerstedt et al., <xref ref-type="bibr" rid="B1">2005</xref>; Hsieh and Tai, <xref ref-type="bibr" rid="B19">2013</xref>), and (3) physiological approach that makes use of bio-signals associated with driving fatigue, such as electrooculography (EOG) to measure the movement of the eye (Hu and Zheng, <xref ref-type="bibr" rid="B20">2009</xref>; Picot et al., <xref ref-type="bibr" rid="B39">2012</xref>), electrocardiography (ECG) to detect heart rate variability (Jung et al., <xref ref-type="bibr" rid="B23">2014</xref>), electroencephalography (EEG) to assess brain state (Huang et al., <xref ref-type="bibr" rid="B21">2016</xref>; Ma et al., <xref ref-type="bibr" rid="B30">2019</xref>, <xref ref-type="bibr" rid="B31">2020</xref>), and electromyography (EMG) to measure muscle activity (Sikander and Anwar, <xref ref-type="bibr" rid="B46">2019</xref>). Among them, psychological self-reported measurement is time-consuming and subjective because it relies on the driver&#x00027;s subjective feedbacks <italic>via</italic> questionnaires, which makes it infeasible and unreliable for real-time detection. Video-based approaches are vulnerable to environmental factors, such as brightness, weather, road conditions, and other factors, which could result in poor detection performance (Jimenez-Pinto and Torres-Torriti, <xref ref-type="bibr" rid="B22">2012</xref>). EOG, ECG, surface EMG, and EEG have all been explored as physiological measures for driving fatigue detection, with specific advantages and disadvantages to each other (Sikander and Anwar, <xref ref-type="bibr" rid="B46">2019</xref>). Electrodes have to be placed over the body surface, which makes the system intrusive in nature. For example, EOG signals are retrieved through electrodes placed near the eye, which can hinder driving. ECG can be measured in a less intrusive way, but ECG signals showed a high inter-subject variance which may lead to challenges in developing a generic driving fatigue detection system. The applicability of surface EMG in real-time driving fatigue detection is limited (Sikander and Anwar, <xref ref-type="bibr" rid="B46">2019</xref>). EEG has been considered as a promising modality for driving fatigue detection, owing to its high temporal resolution, high portability, and good sensitivity to brain state (O&#x00027;Hanlon and Kelley, <xref ref-type="bibr" rid="B37">1977</xref>; Nguyen et al., <xref ref-type="bibr" rid="B36">2019</xref>; Gao et al., <xref ref-type="bibr" rid="B15">2020</xref>). In particular, EEG can be used to non-invasively measure the neuronal electrical activity from the scalp surface to provide a direct assessment of brain fatigue status (Zhao et al., <xref ref-type="bibr" rid="B56">2017</xref>; Sikander and Anwar, <xref ref-type="bibr" rid="B46">2019</xref>). However, EEG signal retrieval through multiple electrodes is highly susceptible to noise from external factors, and it is critical to extract informative features from noisy EEG signals for a successful driving fatigue detection application.</p>
<p>Neural networks have been used as promising tools in extracting informative features from EEG signals because of their massive computational parallelism which resembles the way the brain processes information (Masic and Pfurtscheller, <xref ref-type="bibr" rid="B33">1993</xref>). Recently, many studies have implemented EEG-based driving fatigue detection systems using neural network techniques. Vuckovic et al. proposed a model for classifying alertness and drowsiness from EEG recordings on arbitrary healthy subjects, in which the artificial neural network (ANN) was used as an automatic classifier (Vuckovic et al., <xref ref-type="bibr" rid="B48">2002</xref>). Yang et al. presented a driving fatigue classification model based on information fusion technique and dynamic neural network. The experimental results indicated that the EEG-derived features were able to detect the fatigue state of a driver (Yang et al., <xref ref-type="bibr" rid="B53">2010</xref>). Moreover, Aruna et al. proposed a recurrent self-evolving fuzzy neural network method for driving fatigue detection, in which the correlation coefficient of driver attention was classified to detect driving fatigue (Aruna and Kalaivani, <xref ref-type="bibr" rid="B4">2016</xref>). Chai et al. presented a three-layer feed-forward Bayesian neural network structure for the binary classification of driving fatigue, where autoregressive (AR) modeling was used as the feature extraction algorithm (Chai et al., <xref ref-type="bibr" rid="B8">2017b</xref>). Besides that, Chai et al. also proposed an improved EEG-based driving fatigue classification model, where the AR model was employed for feature extraction, and the sparse-deep belief network (sparse-DBN) was employed for classification (Chai et al., <xref ref-type="bibr" rid="B7">2017a</xref>). Recent studies also demonstrated the radial basis function (RBF) neural network as a promising classifier due to its linear-in-the-parameters network structure, strong non-linear approximation ability, and desired generalization property. Li <italic>et al</italic>. demonstrated that the radial basis function-based classification method has advantages in terms of classification accuracy for epileptic seizure classification by comparing with five other classifiers (Li Y. et al., <xref ref-type="bibr" rid="B28">2017</xref>; Li et al., <xref ref-type="bibr" rid="B27">2019</xref>). The RBF kernel-based support vector regression also achieved better performance in fatigue prediction compared to the other kernel functions in the study of Bose et al. (<xref ref-type="bibr" rid="B6">2019</xref>). The performance of the RBF network heavily relies on network parameters, which should be optimized globally for best performance. The RBF network parameters can be estimated using the existing global optimization methods (Petkovi&#x00107; et al., <xref ref-type="bibr" rid="B38">2016</xref>; Aljarah et al., <xref ref-type="bibr" rid="B2">2018</xref>). Unfortunately, due to a relatively large number of network parameters that need to be optimized, the existing global optimization methods show high computational cost and slow convergence and further lead to low classification accuracy and efficiency of the RBF network.</p>
<p>In this study, a two-level learning hierarchy RBF network (RBF-TLLH) is developed to enhance the performance of the RBF classification. In the proposed RBF-TLLH, only three key RBF network parameters need to be optimized and, as such, can be easily optimized globally and efficiently. Specifically, the RBF-TLLH is constructed by employing the ROLS&#x0002B;D-opt algorithm, which combines the regularized orthogonal least squares (ROLS) and the D-optimality experimental design (D-opt) at the lower level and the particle swarm optimization (PSO) at the upper level. The PSO algorithm is used to globally optimize the three core parameters of the ROLS&#x0002B;D-opt algorithm to enhance the classification performance. As EEG signals are usually measured with multiple channels at a high sampling rate, principal component analysis (PCA) (Hotelling, <xref ref-type="bibr" rid="B18">1933</xref>) is employed to reduce the dimensionality of the original data space (Lever et al., <xref ref-type="bibr" rid="B25">2017</xref>; Artoni et al., <xref ref-type="bibr" rid="B3">2018</xref>) before the application of the RBF-TLLH. The performance of the proposed approach is evaluated on driving fatigue detection and compared against several widely used artificial neural networks, including the artificial neural network based on back-propagation (BP), the artificial neural network based on PSO, and the RBF network based on the ROLS&#x0002B;D-opt learning algorithm.</p>
</sec>
<sec sec-type="materials and methods" id="s2">
<title>Materials and Methods</title>
<sec>
<title>Study Design</title>
<p>The overall structure for the proposed EEG-based fatigue classification framework is shown in <xref ref-type="fig" rid="F1">Figure 1</xref>, which consists of five steps: (1) EEG data collection during a simulated driving environment, (2) raw data pre-processing and segmentation, (3) dimensionality reduction and feature extraction using PCA; (4) classification using the RBF network, and (5) performance evaluation.</p>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption><p>Schematic illustration of the two-level learning hierarchy radial basis function network.</p></caption>
<graphic xlink:href="fnbot-15-618408-g0001.tif"/>
</fig>
</sec>
<sec>
<title>Participants and EEG Data Acquisition</title>
<p>The EEG data used in this study were collected from six healthy, male volunteers (right-handed, aged 23 to 27 years). All volunteers had valid driver&#x00027;s licenses, and no participant had any history of physical or psychological disorders. The study was approved by the local ethics committee (Guangdong Provincial Work Injury Rehabilitation Center, China) and performed in accordance with the Declaration of Helsinki. Each subject was fully informed about the purpose of the research and provided written informed consent before the start of the experiment.</p>
<p>A driving simulation system (Shanghai Infrared Automobile Simulator Driving Equipment Co., Ltd., China) was employed to imitate a real driving environment during the experiment. As shown in <xref ref-type="fig" rid="F2">Figure 2</xref>, the driving simulation system includes clutches, brakes, throttles, and scene simulations that consist of three large screens and high-performance simulation software. This system can imitate the real-driving experience, such as the changing surrounding traffic. EEG signals were recorded using a 32-channel EEG acquisition system (Brain Products GmbH, Germany), with a sampling rate of 500 Hz. EEG electrodes were placed on the scalp based on the international 10&#x02013;20 standard system.</p>
<fig id="F2" position="float">
<label>Figure 2</label>
<caption><p>The driving simulation system and EEG acquisition device.</p></caption>
<graphic xlink:href="fnbot-15-618408-g0002.tif"/>
</fig>
<p>Prior to the start of the experiment, all participants were allowed to practice and get familiar with the driving simulation system. EEG data were then collected for two states, alert (non-fatigue) and fatigue. To collect the alert data, all subjects were required to maintain an adequate and natural sleep for about 8 h during the night before the experiment. The EEG data were collected at 9 a.m. on the next day for about 30&#x02013;60 min while the subjects were executing the driving simulation task. For the recording of alert data, the path was set relatively complicated to avoid the drowsiness of the subjects. On the other hand, to collect the fatigue data, all subjects were requested to sleep for only 4 h during the night before the experiment. The EEG data were also recorded at 9 a.m. for 30 to 60 min when the subjects were driving in the simulation environment. The experiment was performed in a quiet and undisturbed laboratory with ambient temperatures of around 22&#x000B0;C. In order to reach the fatigue state rapidly in fatigue data collection, a long and straight road with very few pedestrians was used in the simulated environment. During the data recording, an observer was seated 2 m beside the subject and monitored the subject&#x00027;s behavior without causing any disturbance to the subject. The observer decided whether the subject was in a fatigue state or an alert state by observing the subject&#x00027;s drowsy signs (more than 2 s of eye closure and head nodding, large deviation off the road). The EEG data recording was terminated at a time of 30 min after the subject began to show fatigue symptoms. For the participants who stayed in alert state for 60 min, the experiments were terminated, and the participants were excluded from further analysis.</p>
</sec>
<sec>
<title>Data Pre-processing and Segmentation</title>
<p>In this study, 20-min EEG signals in each state (alert or fatigue) were collected on each subject, and all the data analyses were implemented in a MATLAB environment (2014a, MathWorks, Natick, Massachusetts). The recorded EEG data were firstly down-sampled from 500 to 200 Hz, and a fourth-order Butterworth band-pass filtering (1&#x02013;45 Hz) was then applied to remove artifacts such as slow drift, high-frequency noise, and power line interference. The 20-min (1,200 s) pre-processed EEG data for each state were then segmented by applying a 10-s time window, which resulted in 120 samples for each state (fatigue or alert). It is worthy of note that, in this study, each sample is a two-dimensional matrix form (32 channels &#x000D7; 2,000 points). As such, with the six participants, a total of 1,440 samples (720 samples for alert and 720 samples for fatigue) were formed for feature extraction and classification. For each participant, the total of 240 samples was divided into the training data set with 200 samples and the validation data set with the remaining 40 samples, where the fatigue and alert state EEG samples were evenly split. In addition, a 6-fold cross-validation was employed for performance evaluation.</p>
</sec>
<sec>
<title>Feature Extraction</title>
<p>To extract the representative features from the large amounts of EEG data, dimensionality reduction is firstly performed to reduce computational expense and classification error. PCA is an efficient and flexible unsupervised method for dimensionality reduction of data (Hotelling, <xref ref-type="bibr" rid="B18">1933</xref>). For a given EEG sample (<italic>m</italic>32-channels &#x000D7; 2,000 points), PCA transforms the sample data into a lower-dimension space through an orthogonal projection or transformation of the correlated points into uncorrelated variables of data, known as principal components (PCs) (Lever et al., <xref ref-type="bibr" rid="B25">2017</xref>; Artoni et al., <xref ref-type="bibr" rid="B3">2018</xref>). Based on the predetermined cumulative contribution rate, the first <italic>r</italic> components with the largest variances are preserved. The preserved number of PCs, <italic>r</italic>, is an important parameter in PCA. In this study, different <italic>r</italic>-values were tested through multiple trials, and the results showed that the first 10 PCs accounted for over 80% (the minimum cumulative contribution rate is up to 82.13%) of the total variance of the original signals for all EEG samples. Hence, the first 10 PCs were preserved, and the original EEG sample with a size of 32 by 2,000 was transformed into a lower-dimension matrix with a size of 32 by 10. These lower-dimensionality samples were used to construct the driving fatigue classification model.</p>
</sec>
<sec>
<title>Classification Model</title>
<p>An RBF network is a single hidden layer feedforward neural network that is generally controlled by several key parameters, including center vectors, the width of the basis function, and the connecting weights from the hidden nodes to the network output. An RBF network with <italic>n</italic> hidden nodes and a single output is shown in <xref ref-type="fig" rid="F3">Figure 3</xref>, where the input features are first transformed to hidden nodes via <italic>n</italic> Gaussian basis functions with a uniform width and different center vectors. The hidden nodes are further aggregated to predict the network output <italic>via</italic> connecting weights. Denoting the input vector as <bold>x</bold> and the output as &#x01EF9;<bold>(</bold><bold>x</bold><bold>)</bold>, the RBF network could be represented as:</p>
<disp-formula id="E1"><label>(1)</label><mml:math id="M1"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>&#x01EF9;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>x</mml:mtext></mml:mstyle></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</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:msub><mml:mrow><mml:mi>&#x003B8;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo class="qopname">exp</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:msup><mml:mrow><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>x</mml:mtext></mml:mstyle><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>c</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>/</mml:mo><mml:mi>&#x003C1;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <bold>c</bold><sub><italic>i</italic></sub>(<italic>i</italic> &#x0003D; 1, &#x022EF;&#x000A0;, <italic>n</italic>) are the center vectors, &#x003C1; is the width of the Gaussian basis functions, &#x003B8;<sub><italic>i</italic></sub>(<italic>i</italic> &#x0003D; 1, &#x022EF;&#x000A0;, <italic>n</italic>) are the weights, and ||&#x000B7;|| is the Euclidean norm.</p>
<fig id="F3" position="float">
<label>Figure 3</label>
<caption><p>Radial basis function network for the EEG-based driving fatigue classification model.</p></caption>
<graphic xlink:href="fnbot-15-618408-g0003.tif"/>
</fig>
<sec>
<title>ROLS&#x0002B;D-opt Integrated Learning Algorithm</title>
<p>In order to construct a model with good performance, in this study, we adopt an integrated learning algorithm (ROLS&#x0002B;D-opt) to train the model by combining regularized orthogonal least squares and D-optimality experimental design. The ROLS regularization techniques improve the generalization properties, and the D-optimality experimental design further enhances the efficiency and robustness of the model (Hong and Harris, <xref ref-type="bibr" rid="B16">2002</xref>; Chen et al., <xref ref-type="bibr" rid="B11">2003</xref>). Denoting the input and output of <italic>k</italic>th sample as <bold>x</bold>(<italic>k</italic>) and <italic>y</italic>(<italic>k</italic>), respectively, a training set of <italic>N</italic> samples could be represented as <inline-formula><mml:math id="M2"><mml:msubsup><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>x</mml:mtext></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>. To formulate the network as a linear-in-the-parameters problem, each sample input is considered as a candidate center in RBF, i.e., <bold>c</bold><sub><italic>i</italic></sub> &#x0003D; <bold>x</bold>(<italic>i</italic>), <italic>i</italic> &#x0003D; 1, &#x02026;, <italic>N</italic>. Therefore, the <italic>i</italic>th hidden node on the <italic>k</italic>th sample, denoted as &#x003D5;<sub><italic>i</italic></sub>(<italic>k</italic>), could be represented as <inline-formula><mml:math id="M3"><mml:msub><mml:mrow><mml:mi>&#x003D5;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>p</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>x</mml:mtext></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>x</mml:mtext></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>|</mml:mo><mml:msup><mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mi>&#x003C1;</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>. The desired output <italic>y</italic>(<italic>k</italic>) can be expressed as</p>
<disp-formula id="E2"><label>(2)</label><mml:math id="M4"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>y</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x01EF9;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mi>e</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</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:msub><mml:mrow><mml:mi>&#x003B8;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi>&#x003D5;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mi>e</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x02264;</mml:mo><mml:mi>k</mml:mi><mml:mo>&#x02264;</mml:mo><mml:mi>N</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>e</italic>(<italic>k</italic>) is the error between <italic>y</italic>(<italic>k</italic>) and the actual network output &#x01EF9;(<italic>k</italic>), &#x003B8;<sub><italic>i</italic></sub> are the output weights, and <italic>N</italic> is the number of samples in the training dataset. The integrated ROLS&#x0002B;D-opt learning algorithm first transforms the model (2) into a matrix form and performs orthogonal decomposition on the regression matrix, which decomposes the regression matrix to a matrix with orthogonal columns and an upper triangular matrix. Specifically, the regression model in (2) can be depicted as:</p>
<disp-formula id="E3"><label>(3)</label><mml:math id="M5"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mstyle mathvariant="bold"><mml:mtext>y</mml:mtext></mml:mstyle><mml:mo>=</mml:mo><mml:mstyle mathvariant="bold"><mml:mo>&#x003A6;</mml:mo></mml:mstyle><mml:mstyle mathvariant="bold-italic"><mml:mi>&#x003B8;</mml:mi></mml:mstyle><mml:mo>&#x0002B;</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>e</mml:mtext></mml:mstyle><mml:mo>=</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>W</mml:mtext></mml:mstyle><mml:mstyle mathvariant="bold"><mml:mtext>A</mml:mtext></mml:mstyle><mml:mstyle mathvariant="bold-italic"><mml:mi>&#x003B8;</mml:mi></mml:mstyle><mml:mo>&#x0002B;</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>e</mml:mtext></mml:mstyle><mml:mo>=</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>W</mml:mtext></mml:mstyle><mml:mstyle mathvariant="bold"><mml:mtext>g</mml:mtext></mml:mstyle><mml:mo>&#x0002B;</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>e</mml:mtext></mml:mstyle></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <bold>y</bold> is output vector, <bold>&#x003A6;</bold> is regression matrix, <bold>&#x003B8;</bold> is weighting vector, and <bold>e</bold> is the error vector. The regression matrix <bold><bold>&#x003A6;</bold></bold> could be decomposed to two matrices, <bold>W</bold> and <bold>A</bold>, where <bold>W</bold> &#x0003D; [<bold>w</bold><sub>1</sub>, &#x022EF;&#x000A0;, <bold>w</bold><sub><bold>N</bold></sub>] has orthogonal columns that satisfy <inline-formula><mml:math id="M6"><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>w</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup><mml:msub><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>w</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x022EF;</mml:mo><mml:mspace width="0.3em" class="thinspace"/><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> for <italic>i</italic> &#x02260; <italic>j</italic>, and <bold>A</bold> is an upper triangular matrix with unit diagonal elements. The upper triangular matrix further multiplies the weight vector to construct an orthogonal weight vector, i.e., <inline-formula><mml:math id="M7"><mml:mstyle mathvariant="bold"><mml:mtext>g</mml:mtext></mml:mstyle><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x022EF;</mml:mo><mml:mspace width="0.3em" class="thinspace"/><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mstyle mathvariant="bold"><mml:mtext>A</mml:mtext></mml:mstyle><mml:mstyle mathvariant="bold-italic"><mml:mi>&#x003B8;</mml:mi></mml:mstyle></mml:math></inline-formula> . Then, the integrated ROLS&#x0002B;D-opt learning algorithm performs a forward subset selection procedure from the full regression model, which is based on the following minimization criterion (Chen et al., <xref ref-type="bibr" rid="B11">2003</xref>):</p>
<disp-formula id="E4"><label>(4)</label><mml:math id="M8"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>J</mml:mi></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>R</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>g</mml:mtext></mml:mstyle><mml:mo>,</mml:mo><mml:mi>&#x003BB;</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>J</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>g</mml:mtext></mml:mstyle><mml:mo>,</mml:mo><mml:mi>&#x003BB;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:mi>&#x003B2;</mml:mi><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</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:mo>-</mml:mo><mml:mo class="qopname">log</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>w</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup><mml:msub><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>w</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>e</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mstyle mathvariant="bold"><mml:mtext>e</mml:mtext></mml:mstyle><mml:mo>&#x0002B;</mml:mo><mml:mi>&#x003BB;</mml:mi><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>g</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mstyle mathvariant="bold"><mml:mtext>g</mml:mtext></mml:mstyle><mml:mo>&#x0002B;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><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;&#x000A0;&#x000A0;</mml:mtext><mml:mi>&#x003B2;</mml:mi><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</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:mo>-</mml:mo><mml:mo class="qopname">log</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>w</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup><mml:msub><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>w</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <inline-formula><mml:math id="M10"><mml:msub><mml:mrow><mml:mi>J</mml:mi></mml:mrow><mml:mrow><mml:mi>R</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>g</mml:mtext></mml:mstyle><mml:mo>,</mml:mo><mml:mi>&#x003BB;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>e</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mstyle mathvariant="bold"><mml:mtext>e</mml:mtext></mml:mstyle><mml:mo>&#x0002B;</mml:mo><mml:mi>&#x003BB;</mml:mi><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>g</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mstyle mathvariant="bold"><mml:mtext>g</mml:mtext></mml:mstyle></mml:math></inline-formula> is the regularized error criterion, &#x003BB; &#x02265; 0 is a regularization parameter, and &#x003B2; is a fixed small positive weighting for the D-optimality cost. The error reduction ratio is defined as:</p>
<disp-formula id="E6"><label>(5)</label><mml:math id="M11"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mi>c</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>r</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>w</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup><mml:msub><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>w</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:mi>&#x003BB;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:msubsup><mml:mrow><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x0002B;</mml:mo><mml:mi>&#x003B2;</mml:mi><mml:mo class="qopname">log</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>w</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup><mml:msub><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>w</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow><mml:mo>/</mml:mo><mml:msup><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>y</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msup><mml:mstyle mathvariant="bold"><mml:mtext>y</mml:mtext></mml:mstyle></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Based on the ratio in (5), significant regressors are selected in a forward-regression procedure, and the selection procedure is terminated when (Chen et al., <xref ref-type="bibr" rid="B11">2003</xref>):</p>
<disp-formula id="E7"><label>(6)</label><mml:math id="M12"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mi>c</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>r</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02264;</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mtext>&#x000A0;</mml:mtext><mml:msub><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x02264;</mml:mo><mml:mi>l</mml:mi><mml:mo>&#x02264;</mml:mo><mml:mi>N</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
</sec>
<sec>
<title>Two-Level Learning Hierarchy RBF Network Learning Algorithm</title>
<p>In the integrated ROLS&#x0002B;D-opt learning algorithm, all candidate centers of the network are chosen from the input vectors of training samples, and the output weights &#x003B8;<sub><italic>i</italic></sub> in (1) can be obtained by linear learning algorithm (Chen et al., <xref ref-type="bibr" rid="B11">2003</xref>). Therefore, only the uniform width &#x003C1; , regularization parameter &#x003BB; , and D-optimality weighting parameter &#x003B2; need to be determined in the ROLS&#x0002B;D-opt algorithm. The selection of these three parameters has a great influence on the performance of the RBF network (Hong et al., <xref ref-type="bibr" rid="B17">2003</xref>; Chen et al., <xref ref-type="bibr" rid="B12">2009</xref>). A global optimization method is needed to determine the optimal combination of these three parameters.</p>
<p>A two-level learning hierarchy (TLLH) scheme is proposed by combining the PSO and ROLS&#x0002B;D-opt algorithms to train the RBF network, as shown in <xref ref-type="fig" rid="F4">Figure 4</xref>. With the fitness function values given at the lower level, PSO (Kennedy and Eberhart, <xref ref-type="bibr" rid="B24">1995</xref>; Shi and Eberhart, <xref ref-type="bibr" rid="B45">1995</xref>) is used to learn the width &#x003C1;, regularization parameter &#x003BB;, and D-optimality weighting parameter &#x003B2; of the integrated algorithm (ROLS&#x0002B;D-opt) at the upper level, while the lower level consists of <italic>p</italic> parallel integrated ROLS&#x0002B;D-opt learning algorithm for each set of parameters, [&#x003BB;, &#x003C1;, &#x003B2;], provided by the PSO. <italic>p</italic> is the swarm size of the PSO, i.e., there are <italic>p</italic> particles in the PSO algorithm. PSO, like a swarm intelligent optimization method, has the characteristic of the parallel computation. In this study, all EEG samples are divided into a training set and a validation set. The <italic>i</italic>-th ROLS&#x0002B;D-opt algorithm constructs an RBF network using the training data set with a given particle [&#x003BB;<sub><italic>i</italic></sub>, &#x003C1;<sub><italic>i</italic></sub>, &#x003B2;<sub><italic>i</italic></sub>], and the mean square error (MSE) over the validation set of the resulting RBF model is defined as the fitness function of the PSO algorithm:</p>
<disp-formula id="E8"><label>(7)</label><mml:math id="M13"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mo class="qopname">min</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><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>c</mml:mi></mml:mrow></mml:msub></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>k</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>c</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munderover></mml:mstyle><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>x</mml:mtext></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:mi>&#x01EF9;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="bold"><mml:mtext>x</mml:mtext></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <italic>K</italic> &#x0003D; [&#x003BB;<sub><italic>i</italic></sub>, &#x003C1;<sub><italic>i</italic></sub>, &#x003B2;<sub><italic>i</italic></sub>] represents the particle, <italic>y</italic>(<bold>x</bold>(<italic>k</italic>) is the desired output of the validation sample, &#x01EF9;(<bold>x</bold>(<italic>k</italic>)) is the actual network output, and <italic>n</italic><sub><italic>c</italic></sub> is the size of the validation set. The smaller the fitness value, the better the generalization performance of the network (Chen et al., <xref ref-type="bibr" rid="B13">1999</xref>, <xref ref-type="bibr" rid="B9">2008</xref>).</p>
<p>The computational complexity of this TLLH scheme is determined by the total number of function evaluations at the upper level. Assuming that the swarm size of the PSO is <italic>p</italic>, the evolutionary generation is <italic>T</italic>, and the complexity of the ROLS&#x0002B; D-opt algorithm is <italic>C</italic><sub>ROLS&#x0002B;D&#x02212;opt</sub>. Then, the complexity of the TLLH scheme is</p>
<disp-formula id="E9"><label>(8)</label><mml:math id="M14"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mtext>TLLH</mml:mtext></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>p</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:mi>T</mml:mi><mml:mo>&#x000D7;</mml:mo><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mtext>ROLS</mml:mtext><mml:mo>&#x0002B;</mml:mo><mml:mtext>D</mml:mtext><mml:mo>-</mml:mo><mml:mtext>opt</mml:mtext></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>since the PSO is only used to optimize three parameters of the integrated ROLS&#x0002B;D-opt learning algorithm, and the lower level presents a linear learning problem. The overall computational requirement of this scheme is much smaller than that of the scheme where a PSO is directly used to determine the RBF network structure as well as to learn all the network parameters (Billings and Zheng, <xref ref-type="bibr" rid="B5">1995</xref>).</p>
<fig id="F4" position="float">
<label>Figure 4</label>
<caption><p>The architecture of two-level learning hierarchy in radial basis function networks.</p></caption>
<graphic xlink:href="fnbot-15-618408-g0004.tif"/>
</fig>
</sec>
</sec>
<sec>
<title>Performance Evaluation</title>
<p>To assess the performance of the proposed approach, the proposed RBF-TLLH was applied to the driving fatigue classification dataset and compared with the state-of-the-art neuron network models, including the RBF based on the ROLS&#x0002B;D-opt algorithm (RBF-ROLS&#x0002B;D-opt) (Chen et al., <xref ref-type="bibr" rid="B11">2003</xref>), three-layer forward ANN with back-propagation (ANN-BP) (Zaw et al., <xref ref-type="bibr" rid="B54">2019</xref>; Zhang and Pu, <xref ref-type="bibr" rid="B55">2020</xref>), and three-layer forward ANN with PSO optimization (ANN-PSO) (Li and Liu, <xref ref-type="bibr" rid="B26">2016</xref>). The RBF based on the ROLS&#x0002B;D-opt algorithm (RBF-ROLS&#x0002B;D-opt) has been widely used because of its robustness, sparsity of the parameters, and easy implementation (Chen et al., <xref ref-type="bibr" rid="B11">2003</xref>). ANN-BP has the ability to approximate the non-linear function with arbitrary accuracy; therefore, it has been widely applied to various classification problems (Zaw et al., <xref ref-type="bibr" rid="B54">2019</xref>; Zhang and Pu, <xref ref-type="bibr" rid="B55">2020</xref>). The three-layer forward ANN with PSO optimization (ANN-PSO) is also widely used due to its advantages such as easy implementation, fewer adjustment parameters, and fast convergence (Li and Liu, <xref ref-type="bibr" rid="B26">2016</xref>). The initial weights and thresholds are generated randomly within the interval [&#x02212;1, 1] in the ANN-BP, the maximum epoch is set to 1,000, and the learning rate is 0.01. The MSE of the training data set is minimized as the objective function in the ANN-PSO. The variable parameters range is set to [&#x02212;1, 1], the swarm size is set to 30, and the evolutionary iterations are set to 60. According to the empirical formula, the hidden nodes of these two ANN classifiers are both set to 30. In addition, in order to prevent over-fitting or over-training in the ANN network, a validation-based early stop strategy is used to select the best training parameters. <xref ref-type="fig" rid="F5">Figure 5</xref> shows the MSE curve of the training set and the validation set for classification. It can be seen that the best iteration number of the ANN-BP is 79, and the best iteration number of the ANN-PSO is 43, for this training result, according to the MSE curve of the validation set.</p>
<fig id="F5" position="float">
<label>Figure 5</label>
<caption><p>Mean square error (MSE) of the training and validation set for the early stopping of the classifier. <bold>(A)</bold> Training and validation MSE of artificial neural network (ANN)-back-propagation. <bold>(B)</bold> Training and validation MSE of ANN-particle swarm optimization.</p></caption>
<graphic xlink:href="fnbot-15-618408-g0005.tif"/>
</fig>
<p>The regularization technique is employed in criterion function (4) in the proposed TLLH-RBF to prevent the over-fitting problem and improve the classification accuracy of the RBF network. The D-optimality cost is introduced to further enhance the efficiency and robustness of the selected subset model. The parameters, including the RBF width, regularization parameter, and D-optimality weighting parameter, are, respectively, set within range,&#x003C1; &#x02208; [1, 220], &#x003BB; &#x02208; [10<sup>&#x02212;7</sup>, 1], and &#x003B2; &#x02208; [10<sup>&#x02212;7</sup>, 1], and optimized using the PSO. The swarm size <italic>p</italic> of PSO is set to 15, and the number of evolutionary iterations is set to 30. For further comparison, another RBF network classifier based on the ROLS&#x0002B;D-opt algorithm is also designed, where the width and D-optimality parameters are determined as&#x003C1; &#x0003D; 110 and &#x003B2; &#x0003D; 10<sup>&#x02212;4</sup>, respectively, by the trial-and-error method, whereas the regularization parameter &#x003BB; is estimated by the Bayesian approach (MacKayi, <xref ref-type="bibr" rid="B32">1992</xref>; Chen et al., <xref ref-type="bibr" rid="B10">1996</xref>).</p>
<p>The classification results achieved by the four aforementioned neural network models were compared against each other. In all these classification models, when the actual output of the network is &#x0003E;0.5, the model classifies it as 1 (fatigue state); otherwise, the model classifies it as 0 (alert state). All samples are normalized firstly before the ANN is trained to prevent the ANN weights from being too large.</p>
</sec>
</sec>
<sec sec-type="results" id="s3">
<title>Results</title>
<p><xref ref-type="table" rid="T1">Table 1</xref> summarizes the classification accuracy in driving fatigue detection as achieved by the four classification models using 6-fold cross-validation for each subject. The results show that the RBF-TLLH classifier achieves the highest accuracy for all the subjects in classifying the fatigue vs. alert states, with the mean value of 92.71 &#x000B1; 6.26%. Overall, the ANN classifiers achieve lower classification accuracy than the RBF-based classifiers. Paired <italic>t</italic>-test was used for statistical comparison, as shown in <xref ref-type="fig" rid="F6">Figure 6</xref>, showing that the proposed RBF-TLLH classifier significantly outperforms the other two ANN classifiers (<italic>p</italic> &#x0003C; 0.05) while the ROLS&#x0002B;D-opt-based RBF does not. Although no significant difference is observed between these two different RBF-based classifiers, the RBF-TLLH achieves higher accuracy and yields lower variance than the ROLS&#x0002B;D-opt RBF network, which that suggests the proposed RBF-TLLH is a more accurate and robust classifier in EEG driving fatigue detection in these two RBF-based classifiers.</p>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p>Average accuracy (%) of 6-fold cross-validation for each subject using different classifiers.</p></caption>
<table frame="hsides" rules="groups">
<thead><tr>
<th valign="top" align="left"><bold>Subjects classifier</bold></th>
<th valign="top" align="center"><bold>Subject 1</bold></th>
<th valign="top" align="center"><bold>Subject 2</bold></th>
<th valign="top" align="center"><bold>Subject 3</bold></th>
<th valign="top" align="center"><bold>Subject 4</bold></th>
<th valign="top" align="center"><bold>Subject 5</bold></th>
<th valign="top" align="center"><bold>Subject 6</bold></th>
<th valign="top" align="center"><bold>Mean (SD)</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">ANN-BP</td>
<td valign="top" align="center">75.00</td>
<td valign="top" align="center">59.58</td>
<td valign="top" align="center">90.42</td>
<td valign="top" align="center">95.42</td>
<td valign="top" align="center">78.33</td>
<td valign="top" align="center">62.08</td>
<td valign="top" align="center">76.81 (14.50)</td>
</tr>
<tr>
<td valign="top" align="left">ANN-PSO</td>
<td valign="top" align="center">57.50</td>
<td valign="top" align="center">54.58</td>
<td valign="top" align="center">86.67</td>
<td valign="top" align="center">84.17</td>
<td valign="top" align="center">60.00</td>
<td valign="top" align="center">60.83</td>
<td valign="top" align="center">67.29 (14.23)</td>
</tr>
<tr>
<td valign="top" align="left">RBF-(ROLS&#x0002B;D-opt)</td>
<td valign="top" align="center">82.08</td>
<td valign="top" align="center">77.92</td>
<td valign="top" align="center">97.08</td>
<td valign="top" align="center">98.75</td>
<td valign="top" align="center">91.67</td>
<td valign="top" align="center">79.17</td>
<td valign="top" align="center">87.78 (9.23)</td>
</tr>
<tr>
<td valign="top" align="left">RBF- TLLH</td>
<td valign="top" align="center">89.58</td>
<td valign="top" align="center">87.08</td>
<td valign="top" align="center">100.00</td>
<td valign="top" align="center">100.00</td>
<td valign="top" align="center">93.75</td>
<td valign="top" align="center">85.83</td>
<td valign="top" align="center">92.71 (6.26)</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p><italic>SD, standard deviation</italic>.</p>
</table-wrap-foot>
</table-wrap>
<fig id="F6" position="float">
<label>Figure 6</label>
<caption><p>Bar chart of the mean accuracies when using different classifiers. &#x0002A;significantly different from control (<italic>p</italic> &#x0003C; 0.05); &#x0002A;&#x0002A;significantly different from control (<italic>p</italic> &#x0003C; 0.005).</p></caption>
<graphic xlink:href="fnbot-15-618408-g0006.tif"/>
</fig>
<p>To further evaluate the classification performance of the proposed RBF-TLLH, six metrics including the true positive (TP), true negative (TN), false positive (FP), false negative (FN), specificity/true negative rate [TNR = TN/(TN &#x0002B; FP)], and sensitivity/true positive rate [TPR = TP/(TP &#x0002B; FN)] (Chai et al., <xref ref-type="bibr" rid="B7">2017a</xref>,<xref ref-type="bibr" rid="B8">b</xref>), are computed from all subjects and summarized in <xref ref-type="table" rid="T2">Table 2</xref>. Compared to the ANN-BP and ANN-PSO models, the RBF-TLLH network model exhibits the best performance regardless of the specificity, sensitivity, and accuracy. In addition, the RBF-TLLH model significantly outperforms the ROLS&#x0002B;D-opt-based RBF model in sensitivity, demonstrating the superiority of the proposed approach to detect driving fatigue. Compared to the ROLS&#x0002B;D-opt-based RBF, the proposed RBF-TLLH model achieves a slightly lower specificity, but a much higher accuracy and sensitivity.</p>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p>Classification results of fatigue state <italic>vs</italic>. alert state for the validation set.</p></caption>
<table frame="hsides" rules="groups">
<thead><tr>
<th valign="top" align="left"><bold>Classification metrics</bold></th>
<th valign="top" align="center" colspan="4" style="border-bottom: thin solid #000000;"><bold>Classification model</bold></th>
</tr>
<tr>
<th/>
<th valign="top" align="center"><bold>ANN-BP</bold></th>
<th valign="top" align="center"><bold>ANN-PSO</bold></th>
<th valign="top" align="center"><bold>RBF-(ROLS&#x0002B;D-opt)</bold></th>
<th valign="top" align="center"><bold>RBF-TLLH</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">TP</td>
<td valign="top" align="center">552</td>
<td valign="top" align="center">517</td>
<td valign="top" align="center">576</td>
<td valign="top" align="center">665</td>
</tr>
<tr>
<td valign="top" align="left">TN</td>
<td valign="top" align="center">554</td>
<td valign="top" align="center">452</td>
<td valign="top" align="center">688</td>
<td valign="top" align="center">670</td>
</tr>
<tr>
<td valign="top" align="left">FN</td>
<td valign="top" align="center">168</td>
<td valign="top" align="center">203</td>
<td valign="top" align="center">144</td>
<td valign="top" align="center">55</td>
</tr>
<tr>
<td valign="top" align="left">FP</td>
<td valign="top" align="center">166</td>
<td valign="top" align="center">268</td>
<td valign="top" align="center">32</td>
<td valign="top" align="center">50</td>
</tr>
<tr>
<td valign="top" align="left">Sensitivity/TPR (%)</td>
<td valign="top" align="center">76.67%</td>
<td valign="top" align="center">71.81%</td>
<td valign="top" align="center">80.00%</td>
<td valign="top" align="center">92.36%</td>
</tr>
<tr>
<td valign="top" align="left">Specificity/TNR (%)</td>
<td valign="top" align="center">76.94%</td>
<td valign="top" align="center">62.78%</td>
<td valign="top" align="center">95.56%</td>
<td valign="top" align="center">93.06%</td>
</tr>
<tr>
<td valign="top" align="left">Accuracy (%)</td>
<td valign="top" align="center">76.81%</td>
<td valign="top" align="center">67.29%</td>
<td valign="top" align="center">87.78%</td>
<td valign="top" align="center">92.71%</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<p><italic>True represents the fatigue state; false represents the alert state.</italic></p> 
<p><italic>TP, true positive; TN, true negative; FN, false negative; FP, false positive</italic>.</p>
</table-wrap-foot>
</table-wrap>
<p>The receiver operating characteristic (ROC) curve analysis is also conducted, and the results are summarized in <xref ref-type="fig" rid="F7">Figure 7</xref>. The ROC curve is a plot of TPR vs. false-positive rate (FPR/1-specificity) by varying different threshold ratios as a sweeping variable. A random classification model is expected to show a straight line connecting (0, 0) to (1, 1) (diagonal dash&#x02013;dot line in <xref ref-type="fig" rid="F7">Figure 7</xref>). Any ROC curve located in the lower-right triangle indicates that the classifier is worse than random guessing, while the ROC curve that lies in the upper-left triangle indicates that the model performs better than random guessing (Fawcett, <xref ref-type="bibr" rid="B14">2006</xref>; Chai et al., <xref ref-type="bibr" rid="B8">2017b</xref>). The area under the curve (AUC) of the ROC curve is then calculated to evaluate the model performance. As shown in <xref ref-type="fig" rid="F7">Figure 7</xref>, the proposed RBF-TLLH achieves the best upper-left ROC curve and yields the highest AUC value (0.9199) among all classifiers, demonstrating the best performance in the detection of driving fatigue.</p>
<fig id="F7" position="float">
<label>Figure 7</label>
<caption><p>Receiver operating characteristic plot with area under the curve values for different classification models: (1) artificial neural network (ANN) using back-propagation algorithm, (2) ANN using particle swarm optimization, (3) radial basis function (RBF) network using ROLS&#x0002B;D-opt algorithm, and (4) RBF network using two-level learning hierarchy method.</p></caption>
<graphic xlink:href="fnbot-15-618408-g0007.tif"/>
</fig>
</sec>
<sec sec-type="discussion" id="s4">
<title>Discussion</title>
<p>EEG has the advantages of non-invasiveness and high temporal resolution for brain activity measurement and has been widely considered as a good indicator of the transition between the alert and fatigue states. Power spectral density (PSD), which converts the time domain of EEG data into the frequency domain, has been widely employed in traditional EEG-based fatigue detection studies. EEG signals can then be generally divided into five bands, i.e., Delta (0.5&#x02013;4 Hz), Theta (4&#x02013;8 Hz), Alpha (8&#x02013;13 Hz), Beta (13&#x02013;30 Hz), and Gamma (30&#x02013;42 Hz) waves, according to frequency and amplitude characteristics (Sikander and Anwar, <xref ref-type="bibr" rid="B46">2019</xref>). It has been found that the increase of EEG alpha band spindles is associated with the fatigue state when participants drive in the actual monotonous driving environment (Simon et al., <xref ref-type="bibr" rid="B47">2011</xref>). It has also been demonstrated that EEG is sensitive to fluctuations in vigilance and has been shown to predict performance degradation due to sustained mental workload. During the monotonous driving task, the EEG alpha bursts will be dominant in the central and posterior EEG channels, which is a signal of drowsiness and reduced vigilance (Simon et al., <xref ref-type="bibr" rid="B47">2011</xref>).</p>
<p>Taking subject 1 and subject 3 as examples, <xref ref-type="fig" rid="F8">Figure 8</xref> shows the PSD distributions of the alpha (8&#x02013;13 Hz) and whole (1&#x02013;45 Hz) wave bands of the two states (alert and fatigue), respectively. It can be observed that the PSD distributions between the alert and fatigue states show an apparent characteristic difference. The PSD difference between the alert and fatigue states of subject 3 is also more significant compared with the PSD distributions of subject 1. This is consistent with the results in <xref ref-type="table" rid="T1">Table 1</xref> when using the RBF-TLLH classifier, that is, the average classification accuracy achieved in subject 3 (100%) is higher than that achieved in subject 1 (89.58%). In addition, regarding the PSD distributions of the subjects during the fatigue state, the alpha band of EEG signals carries the majority of the information among the whole PSD distributions. These findings validate that the EEG has a distinct difference in characteristics between the alert and fatigue states, demonstrating the feasibility of using EEG as an effective approach to detect driving fatigue.</p>
<fig id="F8" position="float">
<label>Figure 8</label>
<caption><p>Power spectral density (PSD) distributions of EEG signals for subjects 1 and 3. <bold>(A)</bold> PSD distributions of the alpha band of EEG signals in the alert state (a1) and in the fatigue state (a2). PSD distributions of the whole band of EEG signals in the alert state (a3) and in the fatigue state (a4) for subject 1. <bold>(B)</bold> PSD distributions of the alpha band of EEG signals in the alert state (b1) and in the fatigue state (b2). PSD distributions of the whole band of EEG signals in the alert state (b3) and in the fatigue state (b4) for subject 3.</p></caption>
<graphic xlink:href="fnbot-15-618408-g0008.tif"/>
</fig>
<p>Although EEG signals provide distinct characteristics associated with between the alert and fatigue brain states, it is still necessary and critical to develop a high-performance classifier in order to monitor the brain state alteration during driving. Studies have demonstrated that the RBF neural network is a promising classifier due to its linear-in-the-parameters network structure, strong non-linear approximation ability, and desired generalization property (Li Y. et al., <xref ref-type="bibr" rid="B28">2017</xref>; Bose et al., <xref ref-type="bibr" rid="B6">2019</xref>; Li et al., <xref ref-type="bibr" rid="B27">2019</xref>). The performance of the RBF network heavily relies on the number of hidden nodes, center vectors, and output weights. These parameters can be learned using some global optimization methods; however, direct optimizing of all the parameters using the global optimization algorithm is hampered by the high evaluation cost and slow convergence. This study aims to enhance the performance of the EEG-based driving fatigue classification model using a two-level learning hierarchy RBF network (RBF-TLLH). The RBF-TLLH is constructed by integrating the ROLS&#x0002B;D-opt algorithm, which combines the regularized orthogonal least squares and D-optimality experimental design at the lower level and the PSO at the upper level.</p>
<p>At the lower level of the RBF-TLLH, the ROLS&#x0002B;D-opt learning algorithm is employed. With the ROLS&#x0002B;D-opt learning algorithm, all the candidate centers of the RBF network are chosen from the input vectors of the training samples, and the output weights in (1) can be obtained by linear learning algorithm (Chen et al., <xref ref-type="bibr" rid="B11">2003</xref>). Moreover, the entire RBF network model construction procedure is terminated automatically when condition (6) is reached. Therefore, there are only three parameters left in the ROLS&#x0002B;D-opt algorithm, i.e., the uniform width, the regularization parameter, and the D-optimality weighting parameter, to be determined. At the upper level of the RBF-TLLH, PSO is employed. PSO is typically characterized as an algorithm with a simple concept, easy implementation, and good computational efficiency (Kennedy and Eberhart, <xref ref-type="bibr" rid="B24">1995</xref>; Shi and Eberhart, <xref ref-type="bibr" rid="B45">1995</xref>). As a swarm intelligent optimization method, PSO has the characteristic of parallel computation. Therefore, PSO is employed to optimize the three core parameters of the ROLS&#x0002B;D-opt algorithm at the upper level, while the ROLS&#x0002B;D-opt algorithm automatically constructs RBF networks at the lower level to enhance the classification performance. As shown in <xref ref-type="table" rid="T1">Tables 1</xref>, <xref ref-type="table" rid="T2">2</xref>, the RBF network obtained from the proposed learning hierarchy has demonstrated its superior performance with a mean classification accuracy of 92.71% and an AUC-ROC value of 0.9199 against other methods, making it a promising candidate for driving fatigue detection in the future.</p>
<p>Experiment EEG data were collected in six healthy subjects in a simulated driving environment and were utilized to evaluate the performance of the proposed RBF-TLLH algorithm by comparing it against three other classifiers. The results show that the proposed RBF-TLLH achieves a substantial increase in classification accuracy compared to other approaches. Particularly, the sensitivity of the proposed RBF-TLLH model is much higher than the other three methods. The high sensitivity performance suggests that the RBF-TLLH-based driving fatigue detection system is more sensitive in detecting fatigue states, which is critical to ensure safe driving.</p>
<p>It is noteworthy that, prior to the classification using the RBF-TLLH method, PCA is necessarily adopted to alleviate the high dimension problem of multi-channel EEG signals. In this study, the PCA method was applied for dimensionality reduction of the EEG signals, and the first 10 PCs of each channel were selected to obtain better driving fatigue detection power. Apparently, the number of preserved PCs would affect the performance of the feature extraction, which would further affect the performance of the driving fatigue detection model. This number of preserved PCs is determined based on multiple trial calculations to ensure that the preserved PCs account for over 80% of the total variance of the original signals.</p>
<p>The classification performance of the neural network is directly related to its network structure and weights. For the ANN classifier, the three-layer forward ANN is formed with 320 input nodes, 30 hidden nodes, and one output node, yielding 9,661 weight and threshold parameters to be optimized. It is generally very difficult to deal with such a high-dimension optimization problem for the back-propagation (BP) algorithm mainly because the gradient-based BP algorithm is sensitive to the initial parameters and easily trapped in the problem of local minima (McLoone et al., <xref ref-type="bibr" rid="B34">1998</xref>). The premature and stagnation phenomenon will also occur during the later stage of evolution when the PSO solves this complex problem. These shortcomings eventually result in the poor performance of the ANN-based classifier for classifying driving fatigue.</p>
<p>Computation efficiency is also evaluated in this study to test the application feasibility of the proposed RBF-TLLH classifier in real-time driving fatigue detection. During the operation process of the real-time classification, based on the obtained features and the parameters of the RBF network for the detection system, the classifier can rapidly determine the driving fatigue detection result through Equation (1). The testing results show that the execution time is only about 0.011 s in a MATLAB environment [an Intel(R) Core(TM) i7-4500U CPU&#x00040; 1.8 GHz, 8 GB RAM]. This is because there is no necessity to train the classifier again for the operation of real-time classification. Specifically, with the saved parameters and particular features, the classifier only needs to compute the feedforward neural network function based on (1) for classification system, which can take &#x0003C;0.1 s when developed in C language.</p>
<p>Despite the improvements achieved in this study, there are limitations that can be addressed in future studies. Only six subjects participated in the simulated driving fatigue experiment, so the sample size of this study is small. Our future efforts will be devoted to collecting a larger sample size from either simulated or real driving fatigue test to further evaluate the performance of the proposed RBF-TLLH in detecting driving fatigue. Furthermore, deep neural network models have attracted increasing attention in recent years because of their powerful non-linear fitting capability, high dimensional data processing capability, large fault tolerance, and strong feature extraction capability. The proposed RBF-TLLH will be compared with deep neural network models, such as LSTM, to further evaluate its performance in driving fatigue detection. In addition, recent research on latent analysis have proved its power in feature extraction, and this method will be used in a future study (Wu et al., <xref ref-type="bibr" rid="B50">2019</xref>, <xref ref-type="bibr" rid="B49">2020</xref>). Lastly, labeling the driving states for a larger sample size could be expensive and time-consuming. In order to solve this problem, semi-supervised classification algorithms will be considered in the future work (She et al., <xref ref-type="bibr" rid="B42">2018</xref>, <xref ref-type="bibr" rid="B43">2019</xref>, <xref ref-type="bibr" rid="B41">2020a</xref>,<xref ref-type="bibr" rid="B44">b</xref>; Wu et al., <xref ref-type="bibr" rid="B51">2018a</xref>,<xref ref-type="bibr" rid="B52">b</xref>).</p>
</sec>
<sec sec-type="conclusions" id="s5">
<title>Conclusion</title>
<p>In this study, a two-level learning hierarchy RBF network has been developed for EEG-based driving fatigue detection to optimize the classification performance (fatigue vs. alert). The experimental results show that the proposed method achieved a superior classification performance compared to other methods in terms of prediction accuracy and computational efficiency. Due to the significantly fewer core parameters to be determined for training the RBF classifier, this proposed approach presents excellent ease of use and large potential application possibilities for the detection of driving fatigue in the future.</p>
</sec>
<sec sec-type="data-availability-statement" id="s6">
<title>Data Availability Statement</title>
<p>The raw data supporting the conclusions of this article will be made available by the authors, without undue reservation.</p>
</sec>
<sec id="s7">
<title>Ethics Statement</title>
<p>The studies involving human participants were reviewed and approved by Guangdong Provincial Work Injury Rehabilitation Hospital. The patients/participants provided their written informed consent to participate in this study.</p>
</sec>
<sec id="s8">
<title>Author Contributions</title>
<p>ZR conceived this study and contributed to the experimental design. ZR performed the computational analysis with the assistance of BC and HZ. CW and YM contributed to subject recruitment and data collection. ZR, RL, YL, and YZ analyzed the results and prepared the manuscript. All the authors reviewed the results and approved the final manuscript.</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>
</body>
<back>
<ack><p>The authors would like to thank Dr. Chuan Zhang for his helpful discussion and comments.</p>
</ack>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Akerstedt</surname> <given-names>T.</given-names></name> <name><surname>Peters</surname> <given-names>B.</given-names></name> <name><surname>Anund</surname> <given-names>A.</given-names></name> <name><surname>Kecklund</surname> <given-names>G.</given-names></name></person-group> (<year>2005</year>). <article-title>Impaired alertness and performance driving home from the night shift: a driving simulator study</article-title>. <source>J. Sleep Res.</source> <volume>14</volume>, <fpage>17</fpage>&#x02013;<lpage>20</lpage>. <pub-id pub-id-type="doi">10.1111/j.1365-2869.2004.00437.x</pub-id><pub-id pub-id-type="pmid">15743329</pub-id></citation></ref>
<ref id="B2">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Aljarah</surname> <given-names>I.</given-names></name> <name><surname>Faris</surname> <given-names>H.</given-names></name> <name><surname>Mirjalili</surname> <given-names>S.</given-names></name> <name><surname>AI-Madi</surname> <given-names>N.</given-names></name></person-group> (<year>2018</year>). <article-title>Training radial basis function networks using biogeography-based optimizer</article-title>. <source>Neural Comput. Appl.</source> <volume>29</volume>, <fpage>529</fpage>&#x02013;<lpage>553</lpage>. <pub-id pub-id-type="doi">10.1007/s00521-016-2559-2</pub-id></citation></ref>
<ref id="B3">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Artoni</surname> <given-names>F.</given-names></name> <name><surname>Delorme</surname> <given-names>A.</given-names></name> <name><surname>Makeig</surname> <given-names>S.</given-names></name></person-group> (<year>2018</year>). <article-title>Applying dimension reduction to EEG data by principal component analysis reduces the quality of its subsequent Independent Component decomposition</article-title>. <source>Neuroimage</source> <volume>175</volume>, <fpage>176</fpage>&#x02013;<lpage>187</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuroimage.2018.03.016</pub-id><pub-id pub-id-type="pmid">29526744</pub-id></citation></ref>
<ref id="B4">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Aruna</surname> <given-names>D. B.</given-names></name> <name><surname>Kalaivani</surname> <given-names>A.</given-names></name></person-group> (<year>2016</year>). <article-title>Fuzzy neural network based real-time driver fatigue detection and warning system using EEG waves</article-title>. <source>Asian J. Res. Soc. Sci. Hum</source>. <volume>6</volume>, <fpage>791</fpage>&#x02013;<lpage>812</lpage>. <pub-id pub-id-type="doi">10.5958/2249-7315.2016.00153.2</pub-id></citation></ref>
<ref id="B5">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Billings</surname> <given-names>S. A.</given-names></name> <name><surname>Zheng</surname> <given-names>G. L.</given-names></name></person-group> (<year>1995</year>). <article-title>Radial basis function network configuration using genetic algorithms</article-title>. <source>Neural Netw</source>. <volume>8</volume>, <fpage>877</fpage>&#x02013;<lpage>890</lpage>. <pub-id pub-id-type="doi">10.1016/0893-6080(95)00029-Y</pub-id></citation></ref>
<ref id="B6">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bose</surname> <given-names>R.</given-names></name> <name><surname>Wang</surname> <given-names>H.</given-names></name> <name><surname>Dragomir</surname> <given-names>A.</given-names></name> <name><surname>Thakor</surname> <given-names>N.</given-names></name> <name><surname>Bezerianos</surname> <given-names>A.</given-names></name> <name><surname>Li</surname> <given-names>J.</given-names></name></person-group> (<year>2019</year>). <article-title>Regression based continuous driving fatigue estimation: towards practical implementation</article-title>. <source>IEEE Transac. Cogn. Dev. Syst</source>. <volume>12</volume>, <fpage>323</fpage>&#x02013;<lpage>331</lpage> <pub-id pub-id-type="doi">10.1109/TCDS.2019.2929858</pub-id></citation></ref>
<ref id="B7">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chai</surname> <given-names>R.</given-names></name> <name><surname>Ling</surname> <given-names>S. H.</given-names></name> <name><surname>San</surname> <given-names>P. P.</given-names></name> <name><surname>Naik</surname> <given-names>G. R.</given-names></name> <name><surname>Nguyen</surname> <given-names>T. N.</given-names></name> <name><surname>Tran</surname> <given-names>Y.</given-names></name> <etal/></person-group>. (<year>2017a</year>). <article-title>Improving EEG-based driver fatigue classification using sparse-deep belief networks</article-title>. <source>Front. Neurosci</source>. <volume>11</volume>:<fpage>103</fpage>. <pub-id pub-id-type="doi">10.3389/fnins.2017.00103</pub-id><pub-id pub-id-type="pmid">28326009</pub-id></citation></ref>
<ref id="B8">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chai</surname> <given-names>R.</given-names></name> <name><surname>Naik</surname> <given-names>G. R.</given-names></name> <name><surname>Nguyen</surname> <given-names>T. N.</given-names></name> <name><surname>Ling</surname> <given-names>S. H.</given-names></name> <name><surname>Tran</surname> <given-names>Y.</given-names></name> <name><surname>Craig</surname> <given-names>A.</given-names></name> <etal/></person-group>. (<year>2017b</year>). <article-title>Driver fatigue classification with independent component by entropy rate bound minimization analysis in an EEG-based system</article-title>. <source>IEEE J. Biomed. Health Inform.</source> <volume>21</volume>, <fpage>715</fpage>&#x02013;<lpage>724</lpage>. <pub-id pub-id-type="doi">10.1109/JBHI.2016.2532354</pub-id><pub-id pub-id-type="pmid">26915141</pub-id></citation></ref>
<ref id="B9">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>J.</given-names></name> <name><surname>Ren</surname> <given-names>Z.</given-names></name> <name><surname>San</surname> <given-names>Y.</given-names></name></person-group> (<year>2008</year>). <article-title>A two-level learning hierarchy for the radial basis function networks</article-title>. <source>Control Theory Appl</source>. <volume>25</volume>, <fpage>655</fpage>&#x02013;<lpage>660</lpage>. <pub-id pub-id-type="doi">10.7641/j.issn.1000-8152.2008.4.012</pub-id></citation></ref>
<ref id="B10">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>S.</given-names></name> <name><surname>Chng</surname> <given-names>E. S.</given-names></name> <name><surname>Alkadhimi</surname> <given-names>K.</given-names></name></person-group> (<year>1996</year>). <article-title>Regularized orthogonal least squares algorithm for constructing radial basis function networks</article-title>. <source>Int. J. Contr.</source> <volume>64</volume>, <fpage>829</fpage>&#x02013;<lpage>837</lpage>. <pub-id pub-id-type="doi">10.1080/00207179608921659</pub-id></citation></ref>
<ref id="B11">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>S.</given-names></name> <name><surname>Hong</surname> <given-names>X.</given-names></name> <name><surname>Harris</surname> <given-names>C.</given-names></name></person-group> (<year>2003</year>). <article-title>Sparse kernel regression modeling using combined locally regularized orthogonal least squares and D-optimality experimental design</article-title>. <source>IEEE Trans. Automat. Contr.</source> <volume>48</volume>, <fpage>1029</fpage>&#x02013;<lpage>1036</lpage>. <pub-id pub-id-type="doi">10.1109/TAC.2003.812790</pub-id></citation></ref>
<ref id="B12">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>S.</given-names></name> <name><surname>Hong</surname> <given-names>X.</given-names></name> <name><surname>Luk</surname> <given-names>B. L.</given-names></name> <name><surname>Harris</surname> <given-names>C. J.</given-names></name></person-group> (<year>2009</year>). <article-title>Construction of tunable radial basis function networks using orthogonal forward selection</article-title>. <source>IEEE Transac. Syst. Man Cybernet. Part B</source> <volume>39</volume>, <fpage>457</fpage>&#x02013;<lpage>466</lpage>. <pub-id pub-id-type="doi">10.1109/TSMCB.2008.2006688</pub-id><pub-id pub-id-type="pmid">19095548</pub-id></citation></ref>
<ref id="B13">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>S.</given-names></name> <name><surname>Wu</surname> <given-names>Y.</given-names></name> <name><surname>Luk</surname> <given-names>B.</given-names></name></person-group> (<year>1999</year>). <article-title>Combined genetic algorithm optimization and regularized orthogonal least squares learning for radial basis function networks</article-title>. <source>IEEE Transac. Neural Netw</source>. <volume>10</volume>, <fpage>1239</fpage>&#x02013;<lpage>1243</lpage>. <pub-id pub-id-type="doi">10.1109/72.788663</pub-id><pub-id pub-id-type="pmid">18252625</pub-id></citation></ref>
<ref id="B14">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Fawcett</surname> <given-names>T.</given-names></name></person-group> (<year>2006</year>). <article-title>An introduction to ROC analysis</article-title>. <source>Pattern Recognit. Lett.</source> <volume>27</volume>, <fpage>861</fpage>&#x02013;<lpage>874</lpage>. <pub-id pub-id-type="doi">10.1016/j.patrec.2005.10.010</pub-id><pub-id pub-id-type="pmid">15064554</pub-id></citation></ref>
<ref id="B15">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gao</surname> <given-names>Y.</given-names></name> <name><surname>Wang</surname> <given-names>X.</given-names></name> <name><surname>Potter</surname> <given-names>T.</given-names></name> <name><surname>Zhang</surname> <given-names>J.</given-names></name> <name><surname>Zhang</surname> <given-names>Y.</given-names></name></person-group> (<year>2020</year>). <article-title>Single-trial EEG Emotion recognition using granger causality/transfer entropy analysis</article-title>. <source>J. Neurosci. Methods</source> <volume>346</volume>:<fpage>108904</fpage>. <pub-id pub-id-type="doi">10.1016/j.jneumeth.2020.108904</pub-id><pub-id pub-id-type="pmid">32898573</pub-id></citation></ref>
<ref id="B16">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hong</surname> <given-names>X.</given-names></name> <name><surname>Harris</surname> <given-names>C.</given-names></name></person-group> (<year>2002</year>). <article-title>Nonlinear model structure design and construction using orthogonal least squares and D-optimality design</article-title>. <source>IEEE Transac. Neural Netw</source>. <volume>13</volume>, <fpage>1245</fpage>&#x02013;<lpage>1250</lpage>. <pub-id pub-id-type="doi">10.1109/TNN.2002.1031959</pub-id><pub-id pub-id-type="pmid">18244524</pub-id></citation></ref>
<ref id="B17">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hong</surname> <given-names>X.</given-names></name> <name><surname>Harris</surname> <given-names>C. J.</given-names></name> <name><surname>Chen</surname> <given-names>S.</given-names></name> <name><surname>Sharkey</surname> <given-names>P. M.</given-names></name></person-group> (<year>2003</year>). <article-title>Robust nonlinear model identification methods using forward regression</article-title>. <source>IEEE Transac. Syst. Man Cybernet. Part A Syst. Hum.</source> <volume>33</volume>, <fpage>514</fpage>&#x02013;<lpage>523</lpage>. <pub-id pub-id-type="doi">10.1109/TSMCA.2003.809217</pub-id></citation></ref>
<ref id="B18">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hotelling</surname> <given-names>H.</given-names></name></person-group> (<year>1933</year>). <article-title>Analysis of a complex of statistical variables into principal components</article-title>. <source>J. Educ. Psychol</source>. <volume>24</volume>, <fpage>417</fpage>&#x02013;<lpage>441</lpage>. <pub-id pub-id-type="doi">10.1037/h0071325</pub-id><pub-id pub-id-type="pmid">19405797</pub-id></citation></ref>
<ref id="B19">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hsieh</surname> <given-names>C. S.</given-names></name> <name><surname>Tai</surname> <given-names>C. C.</given-names></name></person-group> (<year>2013</year>). <article-title>An improved and portable eye-blink duration detection system to warn of driver fatigue</article-title>. <source>Instrument. Sci. Technol.</source> <volume>41</volume>, <fpage>429</fpage>&#x02013;<lpage>444</lpage>. <pub-id pub-id-type="doi">10.1080/10739149.2013.796560</pub-id></citation></ref>
<ref id="B20">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hu</surname> <given-names>S.</given-names></name> <name><surname>Zheng</surname> <given-names>G.</given-names></name></person-group> (<year>2009</year>). <article-title>Driver drowsiness detection with eyelid related parameters by support vector machine</article-title>. <source>Expert Syst. Appl.</source> <volume>36</volume>, <fpage>7651</fpage>&#x02013;<lpage>7658</lpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2008.09.030</pub-id></citation></ref>
<ref id="B21">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Huang</surname> <given-names>K. C.</given-names></name> <name><surname>Huang</surname> <given-names>T. Y.</given-names></name> <name><surname>Chuang</surname> <given-names>C. H.</given-names></name> <name><surname>King</surname> <given-names>J. T.</given-names></name> <name><surname>Wang</surname> <given-names>Y. K.</given-names></name> <name><surname>Lin</surname> <given-names>C. T.</given-names></name> <etal/></person-group>. (<year>2016</year>). <article-title>An EEG-based fatigue detection and mitigation system</article-title>. <source>Int. J. Neural Syst.</source> <volume>26</volume>:<fpage>1650018</fpage>. <pub-id pub-id-type="doi">10.1142/S0129065716500180</pub-id><pub-id pub-id-type="pmid">27121994</pub-id></citation></ref>
<ref id="B22">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jimenez-Pinto</surname> <given-names>J.</given-names></name> <name><surname>Torres-Torriti</surname> <given-names>M.</given-names></name></person-group> (<year>2012</year>). <article-title>Face salient points and eyes tracking for robust drowsiness detection</article-title>. <source>Robotica</source> <volume>30</volume>, <fpage>731</fpage>&#x02013;<lpage>741</lpage>. <pub-id pub-id-type="doi">10.1017/S0263574711000749</pub-id></citation></ref>
<ref id="B23">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jung</surname> <given-names>S.</given-names></name> <name><surname>Shin</surname> <given-names>H.</given-names></name> <name><surname>Chung</surname> <given-names>W.</given-names></name></person-group> (<year>2014</year>). <article-title>Driver fatigue and drowsiness monitoring system with embedded electrocardiogram sensor on steering wheel</article-title>. <source>IET Intellig. Transport Syst.</source> <volume>8</volume>, <fpage>43</fpage>&#x02013;<lpage>50</lpage>. <pub-id pub-id-type="doi">10.1049/iet-its.2012.0032</pub-id></citation></ref>
<ref id="B24">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kennedy</surname> <given-names>J.</given-names></name> <name><surname>Eberhart</surname> <given-names>R.</given-names></name></person-group> (<year>1995</year>). <article-title>Particle swarm optimization</article-title>. <source>Proc. ICNN&#x00027;95 Int. Conf. Neural Netw.</source> <volume>4</volume>, <fpage>1942</fpage>&#x02013;<lpage>1948</lpage>. <pub-id pub-id-type="doi">10.1109/ICNN.1995.488968</pub-id></citation></ref>
<ref id="B25">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lever</surname> <given-names>J.</given-names></name> <name><surname>Krzywinski</surname> <given-names>M.</given-names></name> <name><surname>Altman</surname> <given-names>N.</given-names></name></person-group> (<year>2017</year>). <article-title>Principal component analysis</article-title>. <source>Nat. Method</source> <volume>14</volume>, <fpage>641</fpage>&#x02013;<lpage>642</lpage>. <pub-id pub-id-type="doi">10.1038/nmeth.4346</pub-id></citation></ref>
<ref id="B26">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>C.</given-names></name> <name><surname>Liu</surname> <given-names>X.</given-names></name></person-group> (<year>2016</year>). <article-title>An improved PSO-BP neural network and its application to earthquake prediction</article-title>, in <source>2016 Chinese Control and Decision Conference (CCDC)</source> (<publisher-loc>Yinchuan</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>3434</fpage>&#x02013;<lpage>3438</lpage>. <pub-id pub-id-type="doi">10.1109/CCDC.2016.7531576</pub-id></citation></ref>
<ref id="B27">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>Y.</given-names></name> <name><surname>Cui</surname> <given-names>W. G.</given-names></name> <name><surname>Huang</surname> <given-names>H.</given-names></name> <name><surname>Guo</surname> <given-names>Y. Z.</given-names></name> <name><surname>Li</surname> <given-names>K.</given-names></name> <name><surname>Tan</surname> <given-names>T.</given-names></name></person-group> (<year>2019</year>). <article-title>Epileptic seizure detection in EEG signals using sparse multiscale radial basis function networks and the Fisher vector approach</article-title>. <source>Knowl. Based Syst.</source> <volume>164</volume>, <fpage>96</fpage>&#x02013;<lpage>106</lpage>. <pub-id pub-id-type="doi">10.1016/j.knosys.2018.10.029</pub-id></citation></ref>
<ref id="B28">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>Y.</given-names></name> <name><surname>Wang</surname> <given-names>X. D.</given-names></name> <name><surname>Luo</surname> <given-names>M. L.</given-names></name> <name><surname>Li</surname> <given-names>K.</given-names></name> <name><surname>Yang</surname> <given-names>X. F.</given-names></name> <name><surname>Guo</surname> <given-names>Q.</given-names></name></person-group> (<year>2017</year>). <article-title>Epileptic seizure classification of EEGs using time&#x02013;frequency analysis based multiscale radial basis functions</article-title>. <source>IEEE J. Biomed. Health Informat</source>. <volume>22</volume>, <fpage>386</fpage>&#x02013;<lpage>397</lpage>. <pub-id pub-id-type="doi">10.1109/JBHI.2017.2654479</pub-id><pub-id pub-id-type="pmid">28362595</pub-id></citation></ref>
<ref id="B29">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>Z.</given-names></name> <name><surname>Chen</surname> <given-names>L.</given-names></name> <name><surname>Peng</surname> <given-names>J.</given-names></name> <name><surname>Wu</surname> <given-names>Y.</given-names></name></person-group> (<year>2017</year>). <article-title>Automatic detection of driver fatigue using driving operation information for transportation safety</article-title>. <source>Sensors</source> <volume>17</volume>:<fpage>1212</fpage>. <pub-id pub-id-type="doi">10.3390/s17061212</pub-id><pub-id pub-id-type="pmid">28587072</pub-id></citation></ref>
<ref id="B30">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ma</surname> <given-names>Y.</given-names></name> <name><surname>Chen</surname> <given-names>B.</given-names></name> <name><surname>Li</surname> <given-names>R.</given-names></name> <name><surname>Wang</surname> <given-names>C.</given-names></name> <name><surname>Wang</surname> <given-names>J.</given-names></name> <name><surname>She</surname> <given-names>Q.</given-names></name> <etal/></person-group>. (<year>2019</year>). <article-title>Driving fatigue detection from EEG using a modified PCANet method</article-title>. <source>Comput. Intellig. Neurosci.</source> <volume>2019</volume>:<fpage>4721863</fpage>. <pub-id pub-id-type="doi">10.1155/2019/4721863</pub-id><pub-id pub-id-type="pmid">31396270</pub-id></citation></ref>
<ref id="B31">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ma</surname> <given-names>Y.</given-names></name> <name><surname>Zhang</surname> <given-names>S.</given-names></name> <name><surname>Qi</surname> <given-names>D.</given-names></name> <name><surname>Luo</surname> <given-names>Z.</given-names></name> <name><surname>Li</surname> <given-names>R.</given-names></name> <name><surname>Potter</surname> <given-names>T.</given-names></name> <etal/></person-group>. (<year>2020</year>). <article-title>Driving drowsiness detection with EEG using a modified hierarchical extreme learning machine algorithm with particle swarm optimization: a pilot study</article-title>. <source>Electronics</source> <volume>9</volume>:<fpage>775</fpage>. <pub-id pub-id-type="doi">10.3390/electronics9050775</pub-id></citation></ref>
<ref id="B32">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>MacKayi</surname> <given-names>D. J. C.</given-names></name></person-group> (<year>1992</year>). <article-title>Bayesian interpolation</article-title>. <source>Neural Comput.</source> <volume>4</volume>, <fpage>415</fpage>&#x02013;<lpage>447</lpage>. <pub-id pub-id-type="doi">10.1162/neco.1992.4.3.415</pub-id></citation></ref>
<ref id="B33">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Masic</surname> <given-names>N.</given-names></name> <name><surname>Pfurtscheller</surname> <given-names>G.</given-names></name></person-group> (<year>1993</year>). <article-title>Neural network based classification of single-trial EEG data</article-title>. <source>Artif. Intell. Med</source>. <volume>5</volume>, <fpage>503</fpage>&#x02013;<lpage>513</lpage> <pub-id pub-id-type="doi">10.1016/0933-3657(93)90040-A</pub-id><pub-id pub-id-type="pmid">8136890</pub-id></citation></ref>
<ref id="B34">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>McLoone</surname> <given-names>S.</given-names></name> <name><surname>Brown</surname> <given-names>M. D.</given-names></name> <name><surname>Irwin</surname> <given-names>G.</given-names></name> <name><surname>Lightbody</surname> <given-names>A.</given-names></name></person-group> (<year>1998</year>). <article-title>A hybrid linear/nonlinear training algorithm for feedforward neural networks</article-title>. <source>IEEE Transac. Neural Netw</source>. <volume>9</volume>, <fpage>669</fpage>&#x02013;<lpage>684</lpage>. <pub-id pub-id-type="doi">10.1109/72.701180</pub-id><pub-id pub-id-type="pmid">18252490</pub-id></citation></ref>
<ref id="B35">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Michielsen</surname> <given-names>H. J.</given-names></name> <name><surname>Vries</surname> <given-names>J. D.</given-names></name> <name><surname>Heck</surname> <given-names>G. L. V.</given-names></name> <name><surname>de Vijver</surname> <given-names>F. V.</given-names></name> <name><surname>Sijtsma</surname> <given-names>K.</given-names></name></person-group> (<year>2004</year>). <article-title>Examination of the dimensionality of fatigue: the construction of the Fatigue Assessment Scale (FAS)</article-title>. <source>Eur. J. Psychol. Assess.</source> <volume>20</volume>, <fpage>39</fpage>&#x02013;<lpage>48</lpage>. <pub-id pub-id-type="doi">10.1027/1015-5759.20.1.39</pub-id></citation></ref>
<ref id="B36">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Nguyen</surname> <given-names>T.</given-names></name> <name><surname>Zhou</surname> <given-names>T.</given-names></name> <name><surname>Potter</surname> <given-names>T.</given-names></name> <name><surname>Zou</surname> <given-names>L.</given-names></name> <name><surname>Zhang</surname> <given-names>Y.</given-names></name></person-group> (<year>2019</year>). <article-title>The cortical network of emotion regulation: insights from advanced EEG-fMRI integration analysis</article-title>. <source>IEEE Trans. Med. Imaging</source> <volume>38</volume>, <fpage>2423</fpage>&#x02013;<lpage>2433</lpage>. <pub-id pub-id-type="doi">10.1109/TMI.2019.2900978</pub-id><pub-id pub-id-type="pmid">30802854</pub-id></citation></ref>
<ref id="B37">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>O&#x00027;Hanlon</surname> <given-names>J. F.</given-names></name> <name><surname>Kelley</surname> <given-names>G. R.</given-names></name></person-group> (<year>1977</year>). <article-title>Comparison of performance and physiological changes between drivers who perform well and poorly during prolonged vehicular operation</article-title>, in <source>Vigilance. NATO Conference Series</source>, Vol 3, ed R. R. Mackie (<publisher-loc>Boston, MA: Springer</publisher-loc>). p. <fpage>189</fpage>&#x02013;<lpage>202</lpage>.</citation></ref>
<ref id="B38">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Petkovi&#x00107;</surname> <given-names>D.</given-names></name> <name><surname>Gocic</surname> <given-names>M.</given-names></name> <name><surname>Shamshirband</surname> <given-names>S.</given-names></name> <name><surname>Qasem</surname> <given-names>S. N.</given-names></name> <name><surname>Trajkovic</surname> <given-names>S.</given-names></name></person-group> (2016) <article-title>Particle swarm optimization-based radial basis function network for estimation of reference evapotranspiration</article-title>. Theoret. Appl. Climatol. 125, 555&#x02013;563. <pub-id pub-id-type="doi">10.1007/s00704-015-1522-y</pub-id></citation></ref>
<ref id="B39">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Picot</surname> <given-names>A.</given-names></name> <name><surname>Charbonnier</surname> <given-names>S.</given-names></name> <name><surname>Caplier</surname> <given-names>A.</given-names></name></person-group> (<year>2012</year>). <article-title>On-line detection of drowsiness using brain and visual information</article-title>. <source>IEEE Transac. Syst. Man Cybern.Part A Syst. Hum.</source> <volume>42</volume>, <fpage>764</fpage>&#x02013;<lpage>775</lpage>. <pub-id pub-id-type="doi">10.1109/TSMCA.2011.2164242</pub-id></citation></ref>
<ref id="B40">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sahayadhas</surname> <given-names>A.</given-names></name> <name><surname>Sundaraj</surname> <given-names>K.</given-names></name> <name><surname>Murugappan</surname> <given-names>M.</given-names></name></person-group> (<year>2012</year>). <article-title>Detecting driver drowsiness based on sensors: review</article-title>. <source>Sensors</source> <volume>12</volume>, <fpage>16937</fpage>&#x02013;<lpage>16953</lpage>. <pub-id pub-id-type="doi">10.3390/s121216937</pub-id><pub-id pub-id-type="pmid">33440914</pub-id></citation></ref>
<ref id="B41">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>She</surname> <given-names>Q.</given-names></name> <name><surname>Chen</surname> <given-names>K.</given-names></name> <name><surname>Luo</surname> <given-names>Z.</given-names></name> <name><surname>Nguyen</surname> <given-names>T.</given-names></name> <name><surname>Potter</surname> <given-names>T.</given-names></name> <name><surname>Zhang</surname> <given-names>Y.</given-names></name></person-group> (<year>2020a</year>). <article-title>Double-criteria active learning for multiclass brain-computer interfaces</article-title>. <source>Comput. Intell. Neurosci</source>. <volume>2020</volume>:<fpage>3287589</fpage>. <pub-id pub-id-type="doi">10.1155/2020/3287589</pub-id><pub-id pub-id-type="pmid">32256550</pub-id></citation></ref>
<ref id="B42">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>She</surname> <given-names>Q.</given-names></name> <name><surname>Hu</surname> <given-names>B.</given-names></name> <name><surname>Gan</surname> <given-names>H.</given-names></name> <name><surname>Fan</surname> <given-names>Y.</given-names></name> <name><surname>Nguyen</surname> <given-names>T.</given-names></name> <name><surname>Potter</surname> <given-names>T.</given-names></name> <etal/></person-group>. (<year>2018</year>). <article-title>Safe semi-supervised extreme learning machine for EEG signal classification</article-title>. <source>IEEE Access</source> <volume>6</volume>, <fpage>49399</fpage>&#x02013;<lpage>49407</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2018.2868713</pub-id></citation></ref>
<ref id="B43">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>She</surname> <given-names>Q.</given-names></name> <name><surname>Hu</surname> <given-names>B.</given-names></name> <name><surname>Luo</surname> <given-names>Z.</given-names></name> <name><surname>Nguyen</surname> <given-names>T.</given-names></name> <name><surname>Zhang</surname> <given-names>Y.</given-names></name></person-group> (<year>2019</year>). <article-title>A hierarchical semi-supervised extreme learning machine method for EEG recognition</article-title>. <source>Med. Biol. Eng. Comput.</source> <volume>57</volume>, <fpage>147</fpage>&#x02013;<lpage>157</lpage>. <pub-id pub-id-type="doi">10.1007/s11517-018-1875-3</pub-id><pub-id pub-id-type="pmid">30054779</pub-id></citation></ref>
<ref id="B44">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>She</surname> <given-names>Q.</given-names></name> <name><surname>Zou</surname> <given-names>J.</given-names></name> <name><surname>Luo</surname> <given-names>Z.</given-names></name> <name><surname>Nguyen</surname> <given-names>T.</given-names></name> <name><surname>Li</surname> <given-names>R.</given-names></name> <name><surname>Zhang</surname> <given-names>Y.</given-names></name></person-group> (<year>2020b</year>). <article-title>Multi-class motor imagery EEG classification using collaborative representation-based semi-supervised extreme learning machine</article-title>. <source>Med. Biol. Eng. Comput</source>. <volume>58</volume>, <fpage>2119</fpage>&#x02013;<lpage>2130</lpage>. <pub-id pub-id-type="doi">10.1007/s11517-020-02227-4</pub-id><pub-id pub-id-type="pmid">32676841</pub-id></citation></ref>
<ref id="B45">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Shi</surname> <given-names>Y.</given-names></name> <name><surname>Eberhart</surname> <given-names>R.</given-names></name></person-group> (<year>1995</year>). <article-title>A modified particle swarm optimizer</article-title>, in <source>1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360)</source> (<publisher-loc>Anchorage, AK</publisher-loc>), 69&#x02013;73. <pub-id pub-id-type="doi">10.1109/ICEC.1998.699146</pub-id><pub-id pub-id-type="pmid">30947415</pub-id></citation></ref>
<ref id="B46">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sikander</surname> <given-names>G.</given-names></name> <name><surname>Anwar</surname> <given-names>S.</given-names></name></person-group> (<year>2019</year>). <article-title>Driver fatigue detection systems: a review</article-title>. <source>IEEE Transac. Intellig. Transport. Syst.s</source> <volume>20</volume>, <fpage>2339</fpage>&#x02013;<lpage>2352</lpage>. <pub-id pub-id-type="doi">10.1109/TITS.2018.2868499</pub-id></citation></ref>
<ref id="B47">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Simon</surname> <given-names>M.</given-names></name> <name><surname>Schmidt</surname> <given-names>E. A.</given-names></name> <name><surname>Kincses</surname> <given-names>W. E.</given-names></name> <name><surname>Fritzsche</surname> <given-names>M.</given-names></name> <name><surname>Bruns</surname> <given-names>A.</given-names></name> <name><surname>Aufmuth</surname> <given-names>C.</given-names></name> <etal/></person-group>. (<year>2011</year>). <article-title>EEG alpha spindle measures as indicators of driver fatigue under real traffic conditions</article-title>. <source>Clin. Neurophysiol</source>. <volume>122</volume>, <fpage>1168</fpage>&#x02013;<lpage>1178</lpage>. <pub-id pub-id-type="doi">10.1016/j.clinph.2010.10.044</pub-id><pub-id pub-id-type="pmid">21333592</pub-id></citation></ref>
<ref id="B48">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Vuckovic</surname> <given-names>A.</given-names></name> <name><surname>Radivojevic</surname> <given-names>V. C. N.</given-names></name> <name><surname>Chen</surname> <given-names>A.</given-names></name> <name><surname>Popovic</surname> <given-names>D.</given-names></name></person-group> (<year>2002</year>). <article-title>Automatic recognition of alertness and drowsiness from EEG by an artificial neural network</article-title>. <source>Med. Eng. Phys</source>. <volume>24</volume>, <fpage>349</fpage>&#x02013;<lpage>360</lpage>. <pub-id pub-id-type="doi">10.1016/S1350-4533(02)00030-9</pub-id><pub-id pub-id-type="pmid">12052362</pub-id></citation></ref>
<ref id="B49">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wu</surname> <given-names>D.</given-names></name> <name><surname>Luo</surname> <given-names>X.</given-names></name> <name><surname>Shang</surname> <given-names>M.</given-names></name> <name><surname>He</surname> <given-names>Y.</given-names></name> <name><surname>Wang</surname> <given-names>G.</given-names></name> <name><surname>Wu</surname> <given-names>X.</given-names></name></person-group> (<year>2020</year>). <article-title>A data-characteristic-aware latent factor model for web services QoS prediction</article-title>. <source>IEEE Trans. Knowl. Data Eng.</source> <volume>32</volume>:<fpage>1</fpage>. <pub-id pub-id-type="doi">10.1109/TKDE.2020.3014302</pub-id></citation></ref>
<ref id="B50">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wu</surname> <given-names>D.</given-names></name> <name><surname>Luo</surname> <given-names>X.</given-names></name> <name><surname>Shang</surname> <given-names>M.</given-names></name> <name><surname>He</surname> <given-names>Y.</given-names></name> <name><surname>Wang</surname> <given-names>G.</given-names></name> <name><surname>Zhou</surname> <given-names>M.</given-names></name></person-group> (<year>2019</year>). <article-title>A deep latent factor model for high-dimensional and sparse matrices in recommender systems</article-title>. <source>IEEE Transac. Syst Man Cybernet. Syst.</source> <volume>50</volume>, <fpage>1</fpage>&#x02013;<lpage>12</lpage>. <pub-id pub-id-type="doi">10.1109/TSMC.2019.2931393</pub-id></citation></ref>
<ref id="B51">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wu</surname> <given-names>D.</given-names></name> <name><surname>Luo</surname> <given-names>X.</given-names></name> <name><surname>Wang</surname> <given-names>G.</given-names></name> <name><surname>Shang</surname> <given-names>M.</given-names></name> <name><surname>Yuan</surname> <given-names>Y.</given-names></name> <name><surname>Yan</surname> <given-names>H.</given-names></name></person-group> (<year>2018a</year>). <article-title>A highly accurate framework for self-labeled semisupervised classification in industrial applications</article-title>. <source>IEEE Transac. Indust. Informat.</source> <volume>14</volume>, <fpage>909</fpage>&#x02013;<lpage>920</lpage>. <pub-id pub-id-type="doi">10.1109/TII.2017.2737827</pub-id></citation></ref>
<ref id="B52">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wu</surname> <given-names>D.</given-names></name> <name><surname>Shang</surname> <given-names>M.</given-names></name> <name><surname>Luo</surname> <given-names>X.</given-names></name> <name><surname>Xu</surname> <given-names>J.</given-names></name> <name><surname>Yan</surname> <given-names>H.</given-names></name> <name><surname>Den</surname> <given-names>W.</given-names></name> <etal/></person-group>. (<year>2018b</year>). <article-title>Self-training semi-supervised classification based on density peaks of data</article-title>. <source>Neurocomputing</source> <volume>275</volume>, <fpage>180</fpage>&#x02013;<lpage>191</lpage>. <pub-id pub-id-type="doi">10.1016/j.neucom.2017.05.072</pub-id></citation></ref>
<ref id="B53">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yang</surname> <given-names>G.</given-names></name> <name><surname>Lin</surname> <given-names>Y.</given-names></name> <name><surname>Bhattacharya</surname> <given-names>P.</given-names></name></person-group> (<year>2010</year>). <article-title>A driver fatigue recognition model based on information fusion and dynamic Bayesian network</article-title>. <source>Inf. Sci</source>. <volume>180</volume>, <fpage>1942</fpage>&#x02013;<lpage>1954</lpage>. <pub-id pub-id-type="doi">10.1016/j.ins.2010.01.011</pub-id></citation></ref>
<ref id="B54">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Zaw</surname> <given-names>T.</given-names></name> <name><surname>Tun</surname> <given-names>K. M. M.</given-names></name> <name><surname>Oo</surname> <given-names>A. N.</given-names></name></person-group> (<year>2019</year>). <article-title>Price forecasting by back propagation neural network model</article-title>, in <source>2019 International Conference on Advanced Information Technologies (ICAIT)</source> (<publisher-loc>Yangon</publisher-loc>: <publisher-name>IEEE</publisher-name>), 84&#x02013;89. <pub-id pub-id-type="doi">10.1109/AITC.2019.8921396</pub-id></citation></ref>
<ref id="B55">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>L.</given-names></name> <name><surname>Pu</surname> <given-names>J.</given-names></name></person-group> (<year>2020</year>). <article-title>An improved back propagation neural network in objects recognition</article-title>, in <source>2011 IEEE International Conference on Automation and Logistics (ICAL)</source> (<publisher-loc>IEEE</publisher-loc>), <fpage>507</fpage>&#x02013;<lpage>511</lpage>.</citation></ref>
<ref id="B56">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zhao</surname> <given-names>C.</given-names></name> <name><surname>Zhao</surname> <given-names>M.</given-names></name> <name><surname>Yang</surname> <given-names>Y.</given-names></name> <name><surname>Gao</surname> <given-names>J.</given-names></name> <name><surname>Rao</surname> <given-names>N.</given-names></name> <name><surname>Lin</surname> <given-names>P.</given-names></name></person-group> (<year>2017</year>). <article-title>The reorganization of human brain networks modulated by driving mental fatigue</article-title>. <source>IEEE J. Biomed. Health Informat</source>. <volume>21</volume>, <fpage>743</fpage>&#x02013;<lpage>755</lpage>. <pub-id pub-id-type="doi">10.1109/JBHI.2016.2544061</pub-id><pub-id pub-id-type="pmid">28113875</pub-id></citation></ref>
</ref-list>
<fn-group>
<fn fn-type="financial-disclosure"><p><bold>Funding.</bold> This study was supported in part by the National Natural Science Foundation of China (No. 51675358), State Key Laboratory of Robotics and Systems (HIT) (No. SKLRS-2020-KF-01), and the University of Houston.</p>
</fn>
</fn-group>
</back>
</article> 