<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Hum. Neurosci.</journal-id>
<journal-title>Frontiers in Human Neuroscience</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Hum. Neurosci.</abbrev-journal-title>
<issn pub-type="epub">1662-5161</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fnhum.2022.895761</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>A Fusion-Based Technique With Hybrid Swarm Algorithm and Deep Learning for Biosignal Classification</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>Prabhakar</surname> <given-names>Sunil Kumar</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/1535439/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Rajaguru</surname> <given-names>Harikumar</given-names></name>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
</contrib>
<contrib contrib-type="author">
<name><surname>Kim</surname> <given-names>Chulho</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Won</surname> <given-names>Dong-Ok</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x002A;</sup></xref>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Department of Artificial Intelligence Convergence, Hallym University</institution>, <addr-line>Chuncheon</addr-line>, <country>South Korea</country></aff>
<aff id="aff2"><sup>2</sup><institution>Department of Electronics and Communication Engineering, Bannari Amman Institute of Technology</institution>, <addr-line>Sathyamangalam</addr-line>, <country>India</country></aff>
<aff id="aff3"><sup>3</sup><institution>Department of Neurology, Chuncheon Sacred Heart Hospital</institution>, <addr-line>Chuncheon</addr-line>, <country>South Korea</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Fares Al-Shargie, American University of Sharjah, United Arab Emirates</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Mohanad Alkhodari, Khalifa University, United Arab Emirates; Abdulhakim Al-Ezzi, University of Technology Petronas, Malaysia</p></fn>
<corresp id="c001">&#x002A;Correspondence: Dong-Ok Won, <email>dongok.won@hallym.ac.kr</email></corresp>
<fn fn-type="other" id="fn004"><p>This article was submitted to Brain-Computer Interfaces, a section of the journal Frontiers in Human Neuroscience</p></fn>
</author-notes>
<pub-date pub-type="epub">
<day>03</day>
<month>06</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="collection">
<year>2022</year>
</pub-date>
<volume>16</volume>
<elocation-id>895761</elocation-id>
<history>
<date date-type="received">
<day>14</day>
<month>03</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>02</day>
<month>05</month>
<year>2022</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x00A9; 2022 Prabhakar, Rajaguru, Kim and Won.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Prabhakar, Rajaguru, Kim and Won</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>The vital data about the electrical activities of the brain are carried by the electroencephalography (EEG) signals. The recordings of the electrical activity of brain neurons in a rhythmic and spontaneous manner from the scalp surface are measured by EEG. One of the most important aspects in the field of neuroscience and neural engineering is EEG signal analysis, as it aids significantly in dealing with the commercial applications as well. To uncover the highly useful information for neural classification activities, EEG studies incorporated with machine learning provide good results. In this study, a Fusion Hybrid Model (FHM) with Singular Value Decomposition (SVD) Based Estimation of Robust Parameters is proposed for efficient feature extraction of the biosignals and to understand the essential information it has for analyzing the brain functionality. The essential features in terms of parameter components are extracted using the developed hybrid model, and a specialized hybrid swarm technique called Hybrid Differential Particle Artificial Bee (HDPAB) algorithm is proposed for feature selection. To make the EEG more practical and to be used in a plethora of applications, the robust classification of these signals is necessary thereby relying less on the trained professionals. Therefore, the classification is done initially using the proposed Zero Inflated Poisson Mixture Regression Model (ZIPMRM) and then it is also classified with a deep learning methodology, and the results are compared with other standard machine learning techniques. This proposed flow of methodology is validated on a few standard Biosignal datasets, and finally, a good classification accuracy of 98.79% is obtained for epileptic dataset and 98.35% is obtained for schizophrenia dataset.</p>
</abstract>
<kwd-group>
<kwd>EEG</kwd>
<kwd>FHM</kwd>
<kwd>HDPAB</kwd>
<kwd>PMRM</kwd>
<kwd>deep learning</kwd>
</kwd-group>
<contract-sponsor id="cn001">Department of Artificial Intelligence, Korea University<named-content content-type="fundref-id">10.13039/501100020855</named-content></contract-sponsor>
<counts>
<fig-count count="4"/>
<table-count count="3"/>
<equation-count count="31"/>
<ref-count count="81"/>
<page-count count="15"/>
<word-count count="11860"/>
</counts>
</article-meta>
</front>
<body>
<sec id="S1" sec-type="intro">
<title>Introduction</title>
<p>A famous technique of assessing and measuring the electrical signals of the brain is done with the help of electroencephalography (EEG) (<xref ref-type="bibr" rid="B24">Jeong et al., 2020a</xref>). For the analysis of data concerned with both time and frequency domain, EEG is used and implemented as a powerful technique. The EEG can measure the voltage fluctuations arising due to the ionic current produced by the neurons of the brain (<xref ref-type="bibr" rid="B23">Jeong et al., 2020b</xref>). Over a period of time, the recording of the electrical activities across many scalp electrodes is done in a spontaneous manner to form an EEG signal. Cognitive behavior and major psychological activities can be easily traced by an EEG signal (<xref ref-type="bibr" rid="B33">Kwak and Lee, 2020</xref>), and various brain disorders can also be diagnosed and treated with the help of EEG signals such as stroke, epilepsy, sleep disorders, dementia, etc. (<xref ref-type="bibr" rid="B34">Lee et al., 2020a</xref>). EEG signals are also used for gaming purposes, to control objects using EEG monitoring, to manipulate different hardware utilizing brain waves, etc. (<xref ref-type="bibr" rid="B40">Marshall et al., 2013</xref>). The emotional transformation happening in the activities of the brain can also be specified by EEG (<xref ref-type="bibr" rid="B36">Lee et al., 2020b</xref>). The mechanisms which underlie the brain activity such as diagnosis of brain disease, human cognitive analysis, and brain computer interface (BCI) fields have gained a lot of attention too (<xref ref-type="bibr" rid="B35">Lee et al., 2020c</xref>). A simple operation principle coupled with a high-resolution time and low maintenance makes EEG more special than functional magnetic resonance imaging (fMRI) and computer tomography (CT) (<xref ref-type="bibr" rid="B37">Lee et al., 2019</xref>). Therefore, to study about the cognitive behavior in depth, to analyze the brain disorders, and to diagnose various mental disorders, the most famous non-intrusive approach is EEG. Machine learning and deep learning incorporated with EEG signal analysis is a very famous combination and has achieved wonders in the field of pattern recognition and soft computing (<xref ref-type="bibr" rid="B71">Suk et al., 2016</xref>). To improve the execution of a singular assignment, a collection of mathematical algorithms and models is used by machine learning. Training datasets are held as an input to be utilized as an escort for assembling estimates without the need for any distinct programming. Supervised and Unsupervised are the two main categories utilized in this space (<xref ref-type="bibr" rid="B70">Suk et al., 2015</xref>). With the help of machine learning methods, EEG signals are utilized as indicators to trace the specific medical conditions. From the EEG signal dataset, the noise and other outliers can be eliminated with the help of pre-processing. The spectrum of the grouping of data points to its corresponding features is expressed by feature extraction. Feature selection is utilized to select the most important features eliminating the redundant ones and finally the process of classification happens.</p>
<p>With respect to the discussion of previous studies and the necessity of this study, a few important and relevant studies with respect to epilepsy classification and schizophrenia classification from EEG signals are discussed below, as the proposed work in this study aims to classify them. Thousands of studies are available online in peer-reviewed journals and discussed in conferences for epilepsy classification from EEG signals, as this study has been under continuous development, modification, and improvement by various researchers at different instants of time. An overview to epilepsy and the revised classification of seizures was provided recently by <xref ref-type="bibr" rid="B51">Pack (2019)</xref>. A comprehensive review on various pattern detection methodologies utilized for epilepsy seizure detection from EEG signals was reported by <xref ref-type="bibr" rid="B64">Sharmila and Geethanjali (2019)</xref>. The applications of machine learning techniques for epileptic seizure detection and classification were analyzed by <xref ref-type="bibr" rid="B67">Siddiqui et al. (2020)</xref>. Both these survey papers (<xref ref-type="bibr" rid="B64">Sharmila and Geethanjali, 2019</xref>; <xref ref-type="bibr" rid="B67">Siddiqui et al., 2020</xref>), published in 2019 and 2020, give enough information about the previously used methods, different techniques analyzed, various results, and its respective interpretations. An exhaustive review on the application of deep learning techniques for automated detection of epileptic seizures was beautifully analyzed by <xref ref-type="bibr" rid="B66">Shoeibi et al. (2020)</xref>. Recent deep learning techniques, their implementation, datasets used, comparative analysis of results, and possible ways of future studies were thoroughly analyzed in the study. As far as the schizophrenia EEG signal classification is concerned, very few studies have made a commendable progress, and as it is an upcoming research field, only few studies are available in the literature. Some of the studies regarding schizophrenia EEG classification are mentioned as follows. A comprehensive information about the detection of schizophrenia using EEG signals was analyzed by <xref ref-type="bibr" rid="B39">Mahato et al. (2021)</xref>. The classification of EEG signals between healthy and schizophrenia adolescents was done using fractal theory with approximate entropy analysis in <xref ref-type="bibr" rid="B47">Namazi et al. (2019)</xref> and Largest Lyapunov Exponents (LLE) was utilized with the help of Rosenstein algorithm for the EEG analysis of schizophrenia patients in <xref ref-type="bibr" rid="B32">Kutepov et al. (2020)</xref>. The time and frequency domain features were combined with Convolutional Neural Network (CNN) and Long Short-Term Memory (LSTM) model reporting classification accuracies of 94.08 and 98.56% for healthy and schizophrenia patients, respectively (<xref ref-type="bibr" rid="B68">Singh et al., 2021</xref>). A deep convolutional network was designed where a classification accuracy of 98.07% was obtained for non-subject based testing and 81.26% for schizophrenia subject-based testing in <xref ref-type="bibr" rid="B49">Oh et al. (2019)</xref>. A hybrid deep neural network which combines the usage of LSTM with CNN to classify the healthy vs. schizophrenia patients with fuzzy entropy features was reported with an accuracy of 99.22% (<xref ref-type="bibr" rid="B72">Sun et al., 2021</xref>). Deep learning methods with Random Forest based voting classifiers were efficiently used for the classification of schizophrenia EEG signals reporting an average accuracy of 96.7% (<xref ref-type="bibr" rid="B12">Chu et al., 2018</xref>). Nature-inspired algorithms with varied versions of Adaboost algorithm were performed for classification of schizophrenia EEG signals where they achieved a high classification accuracy of 98.77% (<xref ref-type="bibr" rid="B56">Prabhakar et al., 2020a</xref>). Similarly, several statistical feature analyses were made use with many swarm intelligence and optimization techniques, where Black Hole optimization technique with Support Vector Machine-Radial Basis Function (SVM-RBF) technique produced a classification accuracy of 92.17% in <xref ref-type="bibr" rid="B55">Prabhakar et al. (2020b)</xref>. All the non-linear signal processing methods were comprehensively utilized for automated detection of schizophrenia reporting a classification accuracy of 92.91% with SVM (<xref ref-type="bibr" rid="B22">Jahmunah et al., 2019</xref>). An automated detection of schizophrenia using Empirical Mode Decomposition (EMD) and Intrinsic Mode Functions (IMFs) with several well-known classification methods produced a classification accuracy of 93.21% (<xref ref-type="bibr" rid="B69">Siuly et al., 2020</xref>), a multivariate iterative filtering technique was used for schizophrenia detection using SVM-cubic classifier reporting an accuracy of 98.9% (<xref ref-type="bibr" rid="B14">Das and Pachori, 2021</xref>), and finally, the concept of alpha band power during hyperventilation and post hyperventilation for the identification of schizophrenia was done reporting an accuracy of 83.33% (<xref ref-type="bibr" rid="B8">Bose et al., 2016</xref>). All the previous studies had equal merits and demerits depending on the algorithms and techniques employed to classify the signals. The main contributions of this study are mentioned as follows:</p>
<list list-type="simple">
<list-item>
<label>i)</label>
<p>To the best of our knowledge, no one has ever proposed a fusion model with Singular Value Decomposition (SVD) and of robust parameters for the purpose of feature extraction of biomedical signals, and we have attempted and succeeded in it.</p>
</list-item>
<list-item>
<label>ii)</label>
<p>The concept of a novel hybrid swarm algorithm was developed for the purpose of efficient feature selection, and it has performed well.</p>
</list-item>
<list-item>
<label>iii)</label>
<p>A ZIPMRM is utilized for the biomedical signal classification, especially epilepsy classification and schizophrenia classification, and it is the first of its kind to do so and no past studies have reported it or made it available online.</p>
</list-item>
<list-item>
<label>iv)</label>
<p>A deep learning methodology was also constructed for an efficient classification of the biomedical signals and the results are compared with the standard machine learning techniques.</p>
</list-item>
</list>
<p>The most important point to be observed in this research is the beautiful and novel convergence of the techniques such as the development and usage of the FHM for feature extraction, usage of a new hybrid swarm algorithm for feature selection, and utilization of ZIPMRM along with efficient deep learning methods for classification. The methods used in this study and the convergence of these techniques have not been reported in the literature so far and it is the first of its kind to implement it here. The simplified and structural flow of the study is expressed in <xref ref-type="fig" rid="F1">Figure 1</xref>. The organization or the flow of the study is discussed as follows. The &#x201C;Proposed fusion hybrid models (FHM) for feature extraction&#x201D; section explains the concept of the proposed FHM for feature extraction and the &#x201C;Proposed feature selection technique using HDPAB&#x201D; section explains the concept of the proposed HDPAB algorithm for feature selection. The &#x201C;Development of classification models&#x201D; section gives the explanation about the usage of the proposed ZIPMRM along with suitable deep learning models for classification and it is followed by the results and discussion and finally conclusion.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption><p>A very simplified workflow of the representation for an easy understanding.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnhum-16-895761-g001.tif"/>
</fig>
</sec>
<sec id="S2">
<title>Proposed Fusion Hybrid Models for Feature Extraction</title>
<p>Ensemble models prove to be a great asset in the fields of statistics and machine learning models. A theoretical analysis and working of hybrid ensemble models were expressed by <xref ref-type="bibr" rid="B21">Hsu (2017)</xref>. In different domains, ensemble learning has played a vital role such as visual tracking (<xref ref-type="bibr" rid="B4">Avidan, 2007</xref>), cancer classification (<xref ref-type="bibr" rid="B11">Cho and Won, 2007</xref>), email filtering (<xref ref-type="bibr" rid="B28">Katakis et al., 2010</xref>), intrusion detection (<xref ref-type="bibr" rid="B19">Govindarajan, 2014</xref>), fingerprint classification (<xref ref-type="bibr" rid="B9">Cappelli et al., 2002</xref>), protein food pattern recognition (<xref ref-type="bibr" rid="B65">Shen and Chou, 2006</xref>), and steganalysis (<xref ref-type="bibr" rid="B29">Kodovsk&#x00FD; et al., 2012</xref>). A review of ensemble techniques for bioinformatics was done by <xref ref-type="bibr" rid="B52">Pengyi et al. (2010)</xref>. Other applications of fusion learning and modeling with machine learning include development of a hybrid data minimum model with feature selection algorithms (<xref ref-type="bibr" rid="B30">Koutanaei et al., 2015</xref>), development of a data-driven ensemble classifier (<xref ref-type="bibr" rid="B20">Hsieh and HungA, 2010</xref>), detection of iron ore sintering characters (<xref ref-type="bibr" rid="B80">Wang et al., 2019</xref>), and detecting the temperature of molten steel in ladle furnace (<xref ref-type="bibr" rid="B75">Tian and Mao, 2010</xref>). The recent facilitation in machine learning representation assessing hybrid and ensemble methods was reported by <xref ref-type="bibr" rid="B3">Ardabili et al. (2020)</xref>. However, in the literature, such fusion models are not available for the purpose of feature extraction from biomedical signals and so this motivated the researchers to undertake this study.</p>
<p>For various types of data, the specific proposal of different mixture model techniques has been developed. The merits of various techniques have been integrated into one package. The specific model which fits the data in the best possible manner is done by this fusion approach and it is highly dependent on the data that have to be analyzed. For the fusion model developed here, the initial mixture model considered is the gamma-normal-gamma (GNG) model (<xref ref-type="bibr" rid="B15">Dean and Raftery, 2005</xref>; <xref ref-type="bibr" rid="B7">Bhunya et al., 2007</xref>). Multiple normal components are utilized in order to capture the data, and therefore, a unique case of gamma distribution is utilized. GNG was alter integrated with uniform-normal mixture model (NUDGE), which utilizes a single normal component and a single uniform component (<xref ref-type="bibr" rid="B15">Dean and Raftery, 2005</xref>). The NUDGE was later extended and termed as eNUDGE and it was called as an ensemble model as depicted in <xref ref-type="bibr" rid="B73">Taslim and Lin (2014)</xref> and was fused together by means of incorporating a SVD method for the estimation of robust parameters in this technique, thereby providing the term FHM for the proposed model. A versatile weighting scheme was also added to this fusion model. To enhance the flexibility of this fusion model based on the location and scale values, the differentiated observations are captured and classification of some of the normal components is allowed. Among the various classes, the overall model is selected, and the inference is provided, as it depends on the underlying distribution of the data.</p>
<sec id="S2.SS1">
<title>Fusion Model of Finite Mixtures</title>
<p>The multiple underlying observations are considered, and a fusion approach is developed, as it integrates the merits from various models. The various classes of mixture models are collectively utilized. To fit the normalized data, the design of each class of model is utilized and projected as differences between various experimental situations. For the normalized data point <italic>z</italic>, <italic>f</italic>(<italic>z</italic>) is assumed as the unknown density function and is expressed as follows:</p>
<disp-formula id="S2.E1"><label>(1)</label><mml:math id="M1"><mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>z</mml:mi><mml:mo>;</mml:mo><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:mi>&#x03C0;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>z</mml:mi><mml:mo>;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mi>&#x03C0;</mml:mi><mml:msub><mml:mi>f</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>z</mml:mi><mml:mo>;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>For the mixture, the underlying model parameters are expressed as &#x03A8;, &#x03A8;<sub>0</sub>, and &#x03A8;<sub>1</sub>, respectively. To capture the overdispersion elements, the designation of <italic>f</italic><sub>1</sub> is done, and to identify the more centrally situated ones, <italic>f</italic><sub>0</sub> is utilized. To trace the differential observations also, <italic>f</italic><sub>0</sub> is utilized effectively. The modeling of <italic>f</italic><sub>1</sub> and <italic>f</italic><sub>0</sub> is expressed as follows (<xref ref-type="bibr" rid="B73">Taslim and Lin, 2014</xref>):</p>
<disp-formula id="S2.E2"><label>(2)</label><mml:math id="M2"><mml:mrow><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>z</mml:mi><mml:mo>;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable displaystyle="true" rowspacing="0pt"><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>z</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mtable displaystyle="true"/></mml:mtd><mml:mtd columnalign="center"><mml:mrow><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mtable displaystyle="true"/></mml:mtd><mml:mtd/></mml:mtr></mml:mtable></mml:mtd><mml:mtd/></mml:mtr></mml:mtable></mml:mtd><mml:mtd/></mml:mtr></mml:mtable><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mtable displaystyle="true"/></mml:mtd><mml:mtd/></mml:mtr></mml:mtable></mml:mtd><mml:mtd/></mml:mtr></mml:mtable></mml:mtd><mml:mtd/><mml:mtd columnalign="center"><mml:mrow><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mtable displaystyle="true"/></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mi>e</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mi>N</mml:mi><mml:mi>U</mml:mi><mml:mi>D</mml:mi><mml:mi>G</mml:mi><mml:mi>E</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mi>&#x03C1;</mml:mi><mml:msub><mml:mi>E</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mo>-</mml:mo><mml:mi>z</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>I</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mrow><mml:mo>{</mml:mo><mml:mi>z</mml:mi><mml:mo>&lt;</mml:mo><mml:mo>-</mml:mo><mml:msub><mml:mi>&#x03BE;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>}</mml:mo></mml:mrow><mml:mo>;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x03B2;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:mi>&#x03C1;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>z</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>I</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mrow><mml:mo>{</mml:mo><mml:mi>z</mml:mi><mml:mo>&gt;</mml:mo><mml:msub><mml:mi>&#x03BE;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>}</mml:mo></mml:mrow><mml:mo>;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x03B2;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo rspace="16.4pt">,</mml:mo><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:mtd><mml:mtd columnalign="center"><mml:mrow><mml:mi>G</mml:mi><mml:mi>N</mml:mi><mml:mi>G</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mi/></mml:mrow></mml:mrow></mml:math></disp-formula>
<disp-formula id="S2.E3"><label>(3)</label><mml:math id="M3"><mml:mrow><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>z</mml:mi><mml:mo>;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable displaystyle="true" rowspacing="0pt"><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>z</mml:mi><mml:mo>;</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi>&#x03C3;</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mstyle displaystyle="false"><mml:msubsup><mml:mo largeop="true" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>q</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>Q</mml:mi></mml:msubsup></mml:mstyle><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03B3;</mml:mi><mml:mi>q</mml:mi></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>z</mml:mi><mml:mo>;</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mi>q</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mi>q</mml:mi><mml:mn>2</mml:mn></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mtable displaystyle="true"/><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:mtd><mml:mtd columnalign="center"><mml:mrow><mml:mi>N</mml:mi><mml:mi>U</mml:mi><mml:mi>D</mml:mi><mml:mi>G</mml:mi><mml:mi>E</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mrow><mml:mstyle displaystyle="false"><mml:msubsup><mml:mo largeop="true" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>q</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>Q</mml:mi></mml:msubsup></mml:mstyle><mml:msub><mml:mi mathvariant="normal">&#x03B3;</mml:mi><mml:mi>q</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mtable displaystyle="true"/></mml:mtd><mml:mtd columnalign="center"><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd/><mml:mtd/><mml:mtd columnalign="center"><mml:mrow><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:mtd><mml:mtd columnalign="center"><mml:mrow><mml:mrow><mml:mi>e</mml:mi><mml:mi>N</mml:mi><mml:mi>U</mml:mi><mml:mi>D</mml:mi><mml:mi>G</mml:mi><mml:mi>E</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mi>G</mml:mi><mml:mi>N</mml:mi><mml:mi>G</mml:mi></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mi/></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>With the help of a uniform distribution or with the help of a mixture of two exponential distributions, the capturing of overdispersion in the data is done (<xref ref-type="bibr" rid="B73">Taslim and Lin, 2014</xref>). As a section of the model parameters, <italic>i</italic> and <italic>j</italic> are considered as parameters of the uniform distributions [i.e., (<italic>i</italic>, <italic>j</italic> &#x2208; &#x03A8;<sub>1</sub>)]. The model parameters also include the blending measure of the exponential distributions and the scale specifications, i.e., &#x03C1;, &#x03B2;<sub>1</sub>, &#x03B2;<sub>2</sub> &#x2208; &#x03A8;<sub>1</sub>.</p>
<p>Let <italic>&#x03BE;</italic><sub>1</sub>, <italic>&#x03BE;</italic><sub>2</sub> which are greater than zero be considered and known as the location parameters. The estimator of <italic>&#x03BE;</italic><sub>1</sub> and <italic>&#x03BE;</italic><sub>2</sub> is utilized by <inline-formula><mml:math id="INEQ17"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>&#x03BE;</mml:mi><mml:mo stretchy="false">^</mml:mo></mml:mover><mml:mn>1</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mi>max</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>z</mml:mi><mml:mo>&lt;</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="INEQ18"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>&#x03BE;</mml:mi><mml:mo stretchy="false">^</mml:mo></mml:mover><mml:mn>2</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mi>min</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>z</mml:mi><mml:mo>&gt;</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. With the help of normal distributions (single or mixture), the representation of more centrally situated data is done. As a section of model parameters, the location and scale parameters are involved here (i.e., <inline-formula><mml:math id="INEQ19"><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03BC;</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x03BC;</mml:mi><mml:mi>q</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msubsup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mi>q</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>). As a section of model parameters, the number of components in the mixture <italic>Q</italic> and the mixing proportions &#x03B3;<sub><italic>q</italic></sub> are also involved, i.e., &#x03B3;<sub><italic>q</italic></sub>, <italic>Q</italic> &#x2208; &#x03A8;<sub>0</sub>. Therefore, &#x03A8; = {&#x03C0;}&#x222A;&#x03A8;<sub>0</sub>&#x222A;&#x03A8;<sub>1</sub>. If the condition in {} is proved, then the Indicator function <italic>Ind</italic>{.} is equal to one or else it is zero. In the normal mixture, some terms along with it will be identified as &#x201C;differential,&#x201D; as any distribution can be identified by a specific combination of normal distributions.</p>
</sec>
<sec id="S2.SS2">
<title>Singular Value Decomposition-Based Estimation of Robust Parameters</title>
<p>For the model parameters, to obtain a good estimation in the fusion model, a weighted likelihood function is utilized as follows:</p>
<disp-formula id="S2.E4"><label>(4)</label><mml:math id="M4"><mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mi>l</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>m</mml:mi></mml:munderover><mml:mrow><mml:mi>w</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mrow><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>;</mml:mo><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>where for<italic>z</italic><sub><italic>k</italic></sub>, <italic>k</italic> = 1, 2, &#x2026;, <italic>m</italic> are the normalized data and the prespecified weights mentioned as 0 &#x2264; <italic>wei</italic><sub><italic>k</italic></sub> &#x2264; 1.</p>
<p>The SVD (<xref ref-type="bibr" rid="B41">Martinsson, 2012</xref>) is then implemented to obtain the Eigen value observations. From the Eigen value observations, the contributions are downgraded by means of using small intensities, and so, the weighted likelihood is utilized. With the similar log-ratio, the data points are distinguished, but at the same time, various magnitudes are present for their respective intensities. The average low intensities be considered as <italic>v</italic>, and therefore, the lower half Herbert&#x2019;s neglect function is expressed as follows:</p>
<disp-formula id="S2.E5"><label>(5)</label><mml:math id="M5"><mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mi>e</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>v</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable displaystyle="true" rowspacing="0pt"><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mi>v</mml:mi><mml:mo>&gt;</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:mrow></mml:mtd><mml:mtd/></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mstyle displaystyle="false"><mml:mfrac><mml:mi>g</mml:mi><mml:mrow><mml:mo>|</mml:mo><mml:mi>v</mml:mi><mml:mo>|</mml:mo></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>,</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mi>v</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mi>g</mml:mi></mml:mrow></mml:mrow></mml:mtd><mml:mtd/></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mi/></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>where g = 1.5 and is utilized to down weight those factors with less intensities. Under this fusion approach, the fitting of each model class is utilized by the standard Expectation Maximization (EM) algorithm. When a maximum number of iterations <italic>T</italic>are reached or when ||&#x03A8;<sub>(<italic>t</italic> + 1)</sub>&#x2212;&#x03A8;<sub>(<italic>t</italic>)</sub>|| &#x003C; &#x03B5;, then the stop criterion of EM algorithm is achieved. The values used in this experiment are chosen after several trial-and-error measures based on performance, and finally, &#x03B5; = 10<sup>&#x2212;8</sup> and <italic>T</italic> = 1,000 is used in our fusion approach.</p>
</sec>
<sec id="S2.SS3">
<title>Model Selection and Model-Based Identification of Features</title>
<p>In the proposed model, the total number of normal components <italic>Q</italic> must be determined. The models are examined with <italic>Q</italic> = 1, 2, &#x2026; and then <italic>Q</italic> is chosen so that Bayesian Information Criteria (BIC) is maximized (<xref ref-type="bibr" rid="B38">Lin et al., 2015</xref>). Within each class, the best model is identified, and then, the overall best model is selected by Akaike Information Criteria (AIC) (<xref ref-type="bibr" rid="B74">Tharmaratnam and Claeskens, 2013</xref>). By using this kind of a balanced model selection, too complex models or too simple models can be avoided easily. A two-step technique is utilized by the selection of best model to identify every observation as a differential category or not. A normal component <inline-formula><mml:math id="INEQ37"><mml:mrow><mml:mi>N</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x03BC;</mml:mi><mml:mi>q</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msubsup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mi>q</mml:mi><mml:mn>2</mml:mn></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is identified as a differential one in the initial step if the capturing of observations is done as outliers in the overall distribution as follows:</p>
<disp-formula id="S2.E6"><label>(6)</label><mml:math id="M6"><mml:mrow><mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mi>q</mml:mi></mml:msub><mml:mo>|</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mpadded width="+3.3pt"><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mi>q</mml:mi></mml:msub></mml:mpadded></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">&gt;</mml:mo><mml:mrow><mml:mrow><mml:mpadded width="+3.3pt"><mml:mn>1.5</mml:mn></mml:mpadded><mml:mo rspace="5.8pt">&#x00D7;</mml:mo><mml:mi>I</mml:mi></mml:mrow><mml:mi>D</mml:mi><mml:mi>R</mml:mi></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>where IDR represents the interquartile range for the dataset.</p>
<p>The non-differential category is the one in which the labeling of the normal component is not done as a differential one. For every observation, once the labeling of every normal component is done, then the false discovery rate (FDR) is computed as follows:</p>
<disp-formula id="S2.E7"><label>(7)</label><mml:math id="M7"><mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mover><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mo>&#x2322;</mml:mo></mml:mover><mml:mn>0</mml:mn></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>;</mml:mo><mml:mover><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mo>&#x2322;</mml:mo></mml:mover><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mo>&#x2200;</mml:mo><mml:mi>k</mml:mi></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:mrow><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
<p>where <italic>f</italic><sub><italic>norm</italic></sub> comprises of normal components that are termed as non-differential. For any threshold point <italic>y</italic><sub>0</sub>, the observation <italic>z</italic><sub><italic>k</italic></sub> is identified with weight <italic>wei</italic><sub><italic>k</italic></sub> to be a distinctive element if <italic>FDR</italic>(<italic>z</italic><sub><italic>k</italic></sub>)/<italic>wei</italic><sub><italic>k</italic></sub> &#x2264; <italic>y</italic><sub>0</sub>. Thus, the redundant components are completely eliminated and only the essential fusion hybrid modeled features are retained in the model.</p>
<p><xref ref-type="table" rid="T1">Table 1</xref> exhibits the analysis of statistical parameters for FHM models in various datasets. The statistical parameters are vital to extract the non-linear nature of the underlying physiological events. Here, six parameters, namely, mean, variance, skewness, kurtosis, sample entropy, and permutation entropy are calculated for the epilepsy dataset (<xref ref-type="bibr" rid="B2">Andrzejak et al., 2001</xref>) and schizophrenia datasets, namely (<xref ref-type="bibr" rid="B50">Olejarczyk and Jernajczyk, 2017</xref>), under FHM models. When utilizing the FHM model, the mean parameters are found with common ground values. In the variance and permutation entropy as well, there is not much variation among the models across the datasets. The skewness and kurtosis indicate the presence of non-linearity and non-Gaussian conditions among the datasets. Sample entropy is distinguished itself as a parameter of wide variation among the datasets and models. This finely indicates the presence of a non-peaked Gaussian density due to the feature extraction models and therefore feature selection is absolutely necessary.</p>
<table-wrap position="float" id="T1">
<label>TABLE 1</label>
<caption><p>Analysis of statistical parameters for Fusion Hybrid Model (FHM) in various biosignal datasets.</p></caption>
<table cellspacing="5" cellpadding="5" frame="hsides" rules="groups">
<thead>
<tr>
<td valign="top" align="left">Parameters</td>
<td valign="top" align="center">A-E</td>
<td valign="top" align="center">B-E</td>
<td valign="top" align="center">C-E</td>
<td valign="top" align="center">D-E</td>
<td valign="top" align="center">AB-E</td>
<td valign="top" align="center">CD-E</td>
<td valign="top" align="center">Schizophrenia</td>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Mean</td>
<td valign="top" align="center">0.38376</td>
<td valign="top" align="center">0.81425</td>
<td valign="top" align="center">0.196404</td>
<td valign="top" align="center">0.689723</td>
<td valign="top" align="center">1.262721</td>
<td valign="top" align="center">0.082903</td>
<td valign="top" align="center">0.49361</td>
</tr>
<tr>
<td valign="top" align="left">Variance</td>
<td valign="top" align="center">0.107887</td>
<td valign="top" align="center">0.000832</td>
<td valign="top" align="center">0.038601</td>
<td valign="top" align="center">0.01086</td>
<td valign="top" align="center">0.003261</td>
<td valign="top" align="center">0.002902</td>
<td valign="top" align="center">0.009318</td>
</tr>
<tr>
<td valign="top" align="left">Skewness</td>
<td valign="top" align="center">2.641229</td>
<td valign="top" align="center">0.015824</td>
<td valign="top" align="center">0.936748</td>
<td valign="top" align="center">&#x2013;0.08714</td>
<td valign="top" align="center">&#x2013;2.08109</td>
<td valign="top" align="center">7.461258</td>
<td valign="top" align="center">0.160928</td>
</tr>
<tr>
<td valign="top" align="left">Kurtosis</td>
<td valign="top" align="center">13.30222</td>
<td valign="top" align="center">&#x2013;0.07862</td>
<td valign="top" align="center">&#x2013;0.75852</td>
<td valign="top" align="center">0.159329</td>
<td valign="top" align="center">4.590378</td>
<td valign="top" align="center">75.3816</td>
<td valign="top" align="center">&#x2013;0.92298</td>
</tr>
<tr>
<td valign="top" align="left">Sample entropy</td>
<td valign="top" align="center">11.9076</td>
<td valign="top" align="center">6.2048</td>
<td valign="top" align="center">1.9800</td>
<td valign="top" align="center">6.9953</td>
<td valign="top" align="center">7.4203</td>
<td valign="top" align="center">9.8152</td>
<td valign="top" align="center">6.4148</td>
</tr>
<tr>
<td valign="top" align="left">Permutation entropy</td>
<td valign="top" align="center">1.5993</td>
<td valign="top" align="center">1.522</td>
<td valign="top" align="center">1.7095</td>
<td valign="top" align="center">1.7344</td>
<td valign="top" align="center">1.7407</td>
<td valign="top" align="center">1.4749</td>
<td valign="top" align="center">1.0926</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="S3">
<title>Proposed Feature Selection Technique Using Hybrid Differential Particle Artificial Bee</title>
<p>Once the features are extracted using the FHM model, then, the features have to be selected before feeding inside classification. For solving real-world optimization issues, the hybrid algorithms are of great use, as a better or high-quality solution can be obtained. A flourishing concept in the field of artificial intelligence (AI) is swarm intelligence, and it is the collective behavior of natural or artificial self-organized systems (<xref ref-type="bibr" rid="B57">Prabhakar et al., 2019</xref>). Some of the commonly used swarm intelligence techniques with its applications to various domains are reviewed in <xref ref-type="bibr" rid="B81">Yang (2014)</xref>. In this study, the concept of a hybrid swarm intelligence technique is proposed as an efficient feature selection technique. To solve various issues in different fields, many metaheuristic algorithms are utilized such as Central Force Optimization, Lightning Attachment Procedure Optimization, Genetic Bee Colony Optimization, etc. (<xref ref-type="bibr" rid="B53">Prabhakar and Lee, 2020a</xref>). To trace the global optimum point by means of achieving both exploration and exploitation qualities, these algorithms are used. Selecting the control parameters and adjusting or fine tuning it is a very important stage in these procedures (<xref ref-type="bibr" rid="B54">Prabhakar and Lee, 2020b</xref>). To get a solution with high quality, sometimes exploitation should be more than exploration or <italic>vice versa</italic> depending on the problem characteristics. Various properties are utilized by every optimization algorithm so that the appropriate goals are achieved. For some specific problems, some optimization algorithms perform better and some specific problems as well as some optimization algorithms perform worse. Therefore, many techniques are combined to address these difficulties in literature and are known as hybrid models. To have a steady balance between the exploitation and exploration qualities, control parameters utilized by the optimization algorithms should be perfect. To solve the optimization problems, solution quality is also very important. Sometimes, the algorithm may be very versatile and robust, but it can have a very low solution quality, and sometimes, the algorithm may be less versatile and robust, but it can have a better solution quality. Therefore, to achieve both the control parameters and high-quality solution, hybrid algorithms are proposed. The proposed algorithm is called HDPAB algorithm, and it utilizes the hybridization of differential evolution (DE) (<xref ref-type="bibr" rid="B45">Mohamed, 2015</xref>), particle swarm optimization (PSO) (<xref ref-type="bibr" rid="B1">Altamirano and Riff, 2012</xref>), and Artificial Bee Colony Optimization (ABC) (<xref ref-type="bibr" rid="B26">Karaboga and Basturk, 2008</xref>) to select the most important features, and the pictorial representation is expressed in <xref ref-type="fig" rid="F2">Figure 2</xref>.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption><p>Pictorial representation of Hybrid Differential Particle Artificial Bee (HDPAB).</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnhum-16-895761-g002.tif"/>
</fig>
<sec id="S3.SS1">
<title>Proposed Hybrid Differential Particle Artificial Bee Algorithm</title>
<p>A powerful algorithm called HDPAB is generated in the context of both robustness and high-quality solution. To select the control parameters of algorithms, random choosing of parameters from the required ranges is done. Without altering the characteristics, the primary operators of the designated algorithms are utilized by HDPAB. To select the candidate solutions, the implementation of operators of the merged techniques in a repeated mode is performed. Therefore, to select a particular algorithm, the suitable operators are implemented, and a number of solutions are found, and to the next algorithm, a new population is incorporated.</p>
<p><bold>Step 1:</bold> The candidate populations of solutions <italic>A</italic><sub><italic>i</italic></sub> is initialized, where <italic>i</italic> = {1, 2, 3, &#x2026;, <italic>NP</italic>}. The size of the population is denoted by <italic>NP</italic>.</p>
<p><bold>Step 2:</bold> With the following mathematical expressions, the crossover, mutation, and selection operators of DE algorithms are implemented as follows:</p>
<disp-formula id="S3.E8"><label>(8)</label><mml:math id="M8"><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>z</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mi>w</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<disp-formula id="S3.E9"><label>(9)</label><mml:math id="M9"><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable displaystyle="true" rowspacing="0pt"><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mi>i</mml:mi><mml:mi>f</mml:mi></mml:mrow></mml:mtd><mml:mtd columnalign="center"><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:mi>C</mml:mi><mml:mi>R</mml:mi></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mi>i</mml:mi><mml:mi>f</mml:mi></mml:mrow></mml:mtd><mml:mtd columnalign="center"><mml:mrow><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mi/></mml:mrow></mml:mrow></mml:math></disp-formula>
<disp-formula id="S3.E10"><label>(10)</label><mml:math id="M10"><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable displaystyle="true" rowspacing="0pt"><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mi>i</mml:mi><mml:mi>f</mml:mi></mml:mrow></mml:mtd><mml:mtd columnalign="center"><mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>V</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&lt;</mml:mo><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd/><mml:mtd columnalign="center"><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd/><mml:mtd columnalign="center"><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd/><mml:mtd columnalign="center"><mml:mrow><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mi/></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>For every member in the candidate population, using Equation (8), the calculation of the mutant vector <italic>Y</italic><sub><italic>i</italic></sub> is done. In this population, the distinct members are considered as <italic>A</italic><sub><italic>x</italic></sub>, <italic>A</italic><sub><italic>z</italic></sub>, and <italic>A</italic><sub><italic>w</italic></sub>. By using Equation (9), to generate <italic>V</italic><sub><italic>ij</italic></sub>, the crossover operator <italic>Y</italic><sub><italic>ij</italic></sub> is crossed with <italic>A</italic><sub><italic>ij</italic></sub>, where the <italic>j<sup>th</sup></italic> elements of the <italic>i<sup>th</sup></italic> solution vector <italic>A</italic><sub><italic>i</italic></sub> are denoted by <italic>Y</italic><sub><italic>ij</italic></sub> and <italic>A</italic><sub><italic>ij</italic></sub> respectively. For every <italic>j<sup>th</sup></italic> element of <italic>Y</italic><sub><italic>i</italic></sub>, a uniformly distributed number is represented as <italic>n</italic><sub><italic>j</italic></sub>. For the DE, the main control parameters are <italic>G</italic> and <italic>CR</italic>; for the sake of mutation and crossover operation, they are used. The determination of the novel candidates for <italic>A</italic><sub><italic>i</italic></sub> is done in the selection process depending on the fitness value of <italic>V</italic><sub><italic>i</italic></sub> and <italic>A</italic><sub><italic>i</italic></sub> by using Equation (10), where it is assessed either using the vector <italic>V</italic><sub><italic>i</italic></sub> or its preceding solution.</p>
<p><bold>Step 3:</bold> Utilizing the following expression, the PSO algorithm operators are applied as follows:</p>
<disp-formula id="S3.E11"><label>(11)</label><mml:math id="M11"><mml:mrow><mml:mrow><mml:mi>V</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:msub><mml:mi>o</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mrow><mml:mi>q</mml:mi><mml:mi>V</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:msub><mml:mi>o</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>-</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<disp-formula id="S3.E12"><label>(12)</label><mml:math id="M12"><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mi>V</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:msub><mml:mi>o</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>By utilizing Equation (11) to the <italic>Velo</italic><sub><italic>i</italic></sub>, the main control parameters are implemented as <italic>q</italic>, <italic>w</italic><sub>1</sub>, and <italic>w</italic><sub>2</sub>. Using Equation (12), the positions are updated using these particles. The best-known position is extended, and that point is known as <italic>global</italic><sub><italic>best</italic></sub> and the best position extended by the <italic>i<sup>th</sup></italic> particle in the swarm is expressed as <italic>P</italic><sub><italic>best</italic>, <italic>i</italic></sub></p>
<p><bold>Step 4:</bold> The operator of ABC algorithm is performed by means of implementing control parameters in order to update the respective candidate positions in search space. In a situation in which the further movement of the position cannot be guaranteed, then Equation (13) is utilized so that a new food source utilized by the scouts is used to replace the food source, which had been abandoned in the nectar by bees. Within a specific range of cycles, to assess the abandonment of food sources, the control parameter utilized is called &#x201C;limit&#x201D; in ABC algorithm.</p>
<disp-formula id="S3.E13"><label>(13)</label><mml:math id="M13"><mml:mrow><mml:msubsup><mml:mi>a</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:msubsup><mml:mi>a</mml:mi><mml:mi>min</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>+</mml:mo><mml:mrow><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msubsup><mml:mi>a</mml:mi><mml:mi>max</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>-</mml:mo><mml:msubsup><mml:mi>a</mml:mi><mml:mi>min</mml:mi><mml:mi>j</mml:mi></mml:msubsup></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p><bold>Step 5:</bold> Unless a chosen stopping criterion is satisfied, the steps (9), (10), and (11) are repeated. Unless the termination criterion is satisfied, the performance of the algorithm in a loop is done. At the end of every iteration, the best solution is preserved, and therefore, elitism is incorporated in HDPAB, thereby selection of the most important features suitable for classification is obtained.</p>
</sec>
</sec>
<sec id="S4">
<title>Development of Classification Models</title>
<p>The selected features have to be fed inside the classification models for the sake of classification of the healthy vs. the diseased ones. In this section, initially, the ZIPMRM for biosignal processing is developed, then suitable deep learning models are also developed, and finally, the results are analyzed with the standard machine learning techniques as well. A mixture model is a simple probabilistic model, which indicates the occupancy of sub-populations within a comprehensive population (<xref ref-type="bibr" rid="B42">Mclachlan, 2005</xref>). For the distribution of the mixture components, the familiar prospects are generally binomial distribution, multinomial distribution, log-normal distribution, multivariate t-distribution, negative binomial distribution, Poisson distribution, exponential distribution, etc. (<xref ref-type="bibr" rid="B76">Ueda et al., 2000</xref>). Various models are available in literature such as Gaussian Mixture Models (GMM) (<xref ref-type="bibr" rid="B13">Constantinopoulos and Likas, 2007</xref>), Hidden Markov Model (HMM) (<xref ref-type="bibr" rid="B31">Krogh et al., 1994</xref>), Categorical Mixture Model (CMM) (<xref ref-type="bibr" rid="B25">Kanzawa, 2017</xref>), Finite Mixture Model (FMM) (<xref ref-type="bibr" rid="B43">McLachlan and Peel, 2000</xref>), Multivariate Gaussian Mixture Model (MGMM), etc. (<xref ref-type="bibr" rid="B61">Scrucca et al., 2017</xref>), and they have been generally used for biomedical signal processing applications unlike the PMRM. The application of mixture models has been utilized in analyzing financial models, handwriting recognition, predictive maintenance, fuzzy image segmentation, house price evaluation, point set registration, etc. (<xref ref-type="bibr" rid="B17">Elguebaly and Bouguila, 2011</xref>). For the estimation of parameters in the mixture models, the commonly used techniques are EM algorithm, Markov Chain Monte Carlo, Graphical Methods, moment matching, and spectral methods (<xref ref-type="bibr" rid="B44">Meignen and Meignen, 2006</xref>). PMRM has been widely used in the literature for various purposes such as analysis of count data (<xref ref-type="bibr" rid="B78">Wang et al., 2007</xref>), biometrics (<xref ref-type="bibr" rid="B79">Wang et al., 1996</xref>), detection of maternity duration of hospital stays (<xref ref-type="bibr" rid="B77">Wang et al., 2002</xref>), financial data modeling and classification (<xref ref-type="bibr" rid="B18">Faria and Goncalves, 2013</xref>), defaulters behavior approach analysis (<xref ref-type="bibr" rid="B27">Karlis and Rahmouni, 2007</xref>), insurance ratemaking (<xref ref-type="bibr" rid="B5">Bermudez and Karlis, 2012</xref>), and heart disease prediction (<xref ref-type="bibr" rid="B46">Mufudza and Erol, 2016</xref>), but no literature has been available with respect to utilizing it for the classification of biomedical signals and so an attempt was made in this study successfully.</p>
<sec id="S4.SS1">
<title>Proposed Zero Inflated Poisson Mixture Regression Models</title>
<p>In this section, a general introduction to the mixture regression model, followed by the mixture of regression classes, and implementation of PMRM followed by the assessment of the proposed ZIPMRM for classification of the features are explained.</p>
<sec id="S4.SS1.SSS1">
<title>Mixture Regression Model</title>
<p>In the data acquisition procedure, there might be omission of certain vital covariates, and therefore, the occurrence of unobserved heterogeneity is high in regression. In such cases, the main features are not taken into consideration and thereby it leads to the estimation of biased parameter values. The homogeneous observations are grouped into certain categories or clusters so that the various heterogeneity issues can be solved by the mixture regression models (<xref ref-type="bibr" rid="B79">Wang et al., 1996</xref>). The uniform observations can be standard, fixed, or having saturated variables. The calculation of posterior probabilities has a profound influence on the mixture regression models for the specific variables. Depending on the discriminant analysis rule, the grouping of the standard variable models is done followed by the classification. For the mixture distribution, the joint distribution is mentioned and the response to the conditional distribution is analyzed. By utilizing mixture regression models for the distributions of parameter, the normality is relaxed, as it utilizes a generalized linear model (<xref ref-type="bibr" rid="B77">Wang et al., 2002</xref>). A mixture of <italic>q</italic> components is assumed in a finite mixture regression composition, where a specific parametric distribution is traced by every component in the model. For every observation, a weight probability is assured by all the components so that the weighted summation value over the <italic>q</italic> components is expressed by the mixture distribution. The classification can be improved in most segmented cases with the help of this mixture model. To the clustering model, a very high heterogeneous composition can be implemented if the regression parameters are assumed to be relaxed for the generalized linear model.</p>
</sec>
<sec id="S4.SS1.SSS2">
<title>Mixture Regression Classes</title>
<p>When analyzing the mixture regression models, two classes, namely, (a) standard variable mixture regression models and (b) concomitant values mixture regression models can be considered. A generalized linear model with similar error and link function is used to describe the component here, and it is done with various linear operators. For a generalized linear model, a standard mixture regression is expressed as follows:</p>
<disp-formula id="S4.E14"><label>(14)</label><mml:math id="M14"><mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>u</mml:mi><mml:mo lspace="2.5pt" rspace="2.5pt">|</mml:mo><mml:mrow><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:munder><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mi>q</mml:mi></mml:munder><mml:mrow><mml:msub><mml:mi>&#x03C0;</mml:mi><mml:mi>q</mml:mi></mml:msub><mml:msub><mml:mi>f</mml:mi><mml:mi>q</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>u</mml:mi><mml:mo lspace="2.5pt" rspace="2.5pt">|</mml:mo><mml:mrow><mml:mi>v</mml:mi><mml:mo>;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x03B2;</mml:mi><mml:mrow><mml:mn>0</mml:mn><mml:mi>q</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x03B2;</mml:mi><mml:mi>q</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>where <italic>u</italic> describes the response variable with an exponential distribution, which is dependent on component <italic>q</italic>. For the response variable, the conditional expectation is expressed as follows:</p>
<disp-formula id="S4.E15"><label>(15)</label><mml:math id="M15"><mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>u</mml:mi><mml:mo lspace="2.5pt" rspace="2.5pt">|</mml:mo><mml:mi>v</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03B2;</mml:mi><mml:mrow><mml:mn>0</mml:mn><mml:mi>q</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:msup><mml:mi>v</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:msub><mml:mi mathvariant="normal">&#x03B2;</mml:mi><mml:mi>q</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>where <italic>h</italic>(.) expresses the link function. Here, &#x03A6; = {&#x03B2;<sub>0</sub>, &#x03B2;, &#x03C0;}, &#x03B2;<sub>0</sub> = (&#x03B2;<sub>0<italic>q</italic></sub>), &#x03B2; = (&#x03B2;<sub><italic>q</italic></sub>). The commonly used probability distributions are Poisson, geometric, normal, binomial, and negative binomial (<xref ref-type="bibr" rid="B18">Faria and Goncalves, 2013</xref>). In the analysis of data, the nature of the counts should be analyzed, and so, the Poisson distribution is considered here. For every component involved, the assumption is that for the same parametric family, component-specific densities are considered, that is, <italic>f</italic><sub><italic>q</italic></sub> = <italic>f</italic> for simple notation representation. For all the components, the link function is similar and expressed as <italic>h</italic><sub><italic>q</italic></sub> = <italic>h</italic>. There is no prior knowledge about the distribution of family differences in this cluster-wise regression model.</p>
<p>For the prior class probabilities, the concomitant variable model forms as a popular extension, so that based on the set of explanatory variables, the weight &#x03C0;<sub><italic>q</italic></sub> can be fully dependent on it. The random effects do not have any influence on the data distributions and on the parameter estimates, and therefore, the substantial changes are not required. Depending on a regression model based on Equation (14), a concomitant variable mixture regression model is framed, which utilizes posterior probability parameterization so that it is fit into two distinct sets <italic>v</italic> = (<italic>v</italic><sub>1</sub>, <italic>v</italic><sub>2</sub>) and the range of concomitant variables can be conquered easily.</p>
<p>The initial set influences <italic>u</italic> along with the latter set influences the latent group specifier <italic>w</italic> variable as follows:</p>
<disp-formula id="S4.E16"><label>(16)</label><mml:math id="M16"><mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo lspace="2.5pt" rspace="2.5pt">|</mml:mo><mml:mrow><mml:mi>v</mml:mi><mml:mo>;</mml:mo><mml:mi mathvariant="normal">&#x03C0;</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C0;</mml:mi><mml:mi>q</mml:mi></mml:msub><mml:msub><mml:mi>&#x03C0;</mml:mi><mml:mrow><mml:mi>q</mml:mi><mml:mo lspace="2.5pt" rspace="2.5pt">|</mml:mo><mml:mi>v</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>For the response variable, the marginal distribution is expressed as follows:</p>
<disp-formula id="S4.E17"><label>(17)</label><mml:math id="M17"><mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>u</mml:mi><mml:mo lspace="2.5pt" rspace="2.5pt">|</mml:mo><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>;</mml:mo><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:munder><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mi>q</mml:mi></mml:munder><mml:mrow><mml:msub><mml:mi>&#x03C0;</mml:mi><mml:mrow><mml:mi>q</mml:mi><mml:mo lspace="2.5pt" rspace="2.5pt">|</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:msub><mml:msub><mml:mi>f</mml:mi><mml:mi>q</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>u</mml:mi><mml:mo lspace="2.5pt" rspace="2.5pt">|</mml:mo><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>;</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03B2;</mml:mi><mml:mrow><mml:mn>0</mml:mn><mml:mi>q</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:msub><mml:msub><mml:mi mathvariant="normal">&#x03B2;</mml:mi><mml:mi>q</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>Here, &#x03A6; = {&#x03B2;<sub>0</sub>, &#x03B2;, &#x03B3;<sub>0</sub>, &#x03B3;}, &#x03B2;<sub>0</sub> = (&#x03B2;<sub>0<italic>q</italic></sub>), &#x03B2; = (&#x03B2;<sub><italic>q</italic></sub>), &#x03B3;<sub>0</sub> = (&#x03B3;<sub>0<italic>q</italic></sub>) and <inline-formula><mml:math id="INEQ92"><mml:mrow><mml:mi mathvariant="normal">&#x03B3;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mpadded width="+3.3pt"><mml:mi mathvariant="normal">&#x03B3;</mml:mi></mml:mpadded><mml:mmultiscripts><mml:mo>)</mml:mo><mml:mprescripts/><mml:mi>q</mml:mi><mml:none/></mml:mmultiscripts></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
<p>The component indicator functions are used to derive &#x03B3;<sub><italic>q</italic></sub>, which are expressed as follows:</p>
<disp-formula id="S4.E18"><label>(18)</label><mml:math id="M18"><mml:mrow><mml:msub><mml:mi>&#x03C0;</mml:mi><mml:mrow><mml:mi>q</mml:mi><mml:mo lspace="2.5pt" rspace="2.5pt">|</mml:mo><mml:mi>v</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03B3;</mml:mi><mml:mrow><mml:mn>0</mml:mn><mml:mi>q</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:msup><mml:mi>v</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:msub><mml:mi mathvariant="normal">&#x03B3;</mml:mi><mml:mi>q</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03A3;</mml:mi><mml:mi>g</mml:mi></mml:msub><mml:mrow><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03B3;</mml:mi><mml:mrow><mml:mn>0</mml:mn><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:msup><mml:mi>v</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:msub><mml:mi mathvariant="normal">&#x03B3;</mml:mi><mml:mi>g</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula>
<p>Its identification is usually considered as zero. With the help of model intercept, the aliasing of the intercept parameters &#x03B2;<sub>0</sub> is done, which results in avoidance of the huge standard errors.</p>
</sec>
<sec id="S4.SS1.SSS3">
<title>Poisson Mixture Regression Model Implementation</title>
<p>In this model, the poison density function of a model, which has a distribution with response <italic>U</italic> and covariate vector <italic>v</italic>, is expressed as</p>
<disp-formula id="S4.E19"><label>(19)</label><mml:math id="M19"><mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#x03BB;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mi mathvariant="normal">&#x03BB;</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mi mathvariant="normal">&#x03BB;</mml:mi><mml:mi>u</mml:mi></mml:msup></mml:mrow><mml:mrow><mml:mi>u</mml:mi><mml:mo>!</mml:mo></mml:mrow></mml:mfrac><mml:mi>I</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mi>B</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>In Equation (19), <italic>E</italic>(<italic>u</italic>) = &#x03BB;, the link function <italic>h</italic>(&#x03BB;) = <italic>log</italic>&#x2061;(&#x03BB;) = &#x03B2;<italic><sup>T</sup>v</italic>, <italic>B</italic> = {0, 1, 2, &#x2026;}, represents the non-negative integer set and <italic>Ind</italic><sub><italic>B</italic></sub>(<italic>u</italic>) represents the indicator function. If <inline-formula><mml:math id="INEQ100"><mml:mmultiscripts><mml:mi>u</mml:mi><mml:none/><mml:mo>&#x2032;</mml:mo><mml:mprescripts/><mml:none/><mml:mo>&#x2032;</mml:mo></mml:mmultiscripts></mml:math></inline-formula>belongs to the set <italic>B</italic>, the value becomes one, otherwise its value is zero. The variance <italic>var</italic>(<italic>U</italic>) = <italic>E</italic>(<italic>U</italic>) = &#x03BB;, and dispersion issues are prevalent if <italic>var</italic>(<italic>U</italic>) &#x003E; <italic>E</italic>(<italic>U</italic>) for overdispersion and <italic>Var</italic>(<italic>U</italic>) &#x003C; <italic>E</italic>(<italic>U</italic>) for underdispersion. Underdispersion is less common than overdispersion (<xref ref-type="bibr" rid="B27">Karlis and Rahmouni, 2007</xref>). When analyzing the Poisson distribution, if the count data are relatively overdispersed, then it leads to misleading results. Therefore, extradispersion problems have to be dealt more carefully. In a population in which there is too much unobserved heterogeneity, the appropriate finite mixture model is utilized, which has two more sub collective groups and are highly mixed in different proportions.</p>
<p>When covariate information is present, the fitting of the extradispersed data can be done in PMRM provided the objectives are assumed to be obtained from a finite mixture. Sometimes, the distribution can vary in different intercepts and the explanatory variable is presumed to have a heterogeneous nature. The clustering of the count outcomes is considered and then the regression model is incorporated with random effects so that in between the observations, an inherent correlation can be observed. Some of the common Poisson Mixture Models (PMM) are Zero Inflated Poisson (ZIP), negative binomial, and Zero Inflated Negative binomial (ZINB) models, respectively (<xref ref-type="bibr" rid="B46">Mufudza and Erol, 2016</xref>). To manage heterogeneity and the additional zeros in the data, the ZIP model is usually utilized. Depending on Poisson distribution, a finite mixture model can be expressed as follows:</p>
<disp-formula id="S4.E20"><label>(20)</label><mml:math id="M20"><mml:mrow><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x03B8;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x03BB;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x03BB;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:msup></mml:mrow><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>!</mml:mo></mml:mrow></mml:mfrac><mml:mi>I</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mi>B</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>In Equation (20), <inline-formula><mml:math id="INEQ105"><mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x03BB;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msubsup><mml:mi mathvariant="normal">&#x03B2;</mml:mi><mml:mi>k</mml:mi><mml:mi>T</mml:mi></mml:msubsup><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mrow><mml:mo>:</mml:mo><mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>:</mml:mo><mml:mi>l</mml:mi></mml:mrow></mml:math></inline-formula> and for the <italic>l</italic> component mixture,</p>
<disp-formula id="S4.E21"><label>(21)</label><mml:math id="M21"><mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>l</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03C0;</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:msub><mml:mi mathvariant="normal">&#x03BB;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<disp-formula id="S4.E22"><label>(22)</label><mml:math id="M22"><mml:mrow><mml:mrow><mml:mi>V</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>U</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>v</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo lspace="2.5pt" rspace="2.5pt">|</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mi>v</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo lspace="2.5pt" rspace="2.5pt">|</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mrow><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>U</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>where <inline-formula><mml:math id="INEQ107"><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03BB;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msubsup><mml:mi mathvariant="normal">&#x03B2;</mml:mi><mml:mi>k</mml:mi><mml:mi>T</mml:mi></mml:msubsup><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> represents the mean of the <italic>i<sup>th</sup></italic> responsive situation to its respective membership in the <italic>k<sup>th</sup></italic> constituent of the mixture, <inline-formula><mml:math id="INEQ110"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03A3;</mml:mi><mml:msub><mml:mi mathvariant="normal">&#x03C0;</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:msubsup><mml:mi mathvariant="normal">&#x03BB;</mml:mi><mml:msub><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mn>2</mml:mn></mml:msubsup></mml:mrow><mml:mo>-</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x03A3;</mml:mi><mml:msub><mml:mi mathvariant="normal">&#x03C0;</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:msub><mml:mi mathvariant="normal">&#x03BB;</mml:mi><mml:msub><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow></mml:math></inline-formula> and <italic>W</italic><sub><italic>k</italic></sub> represents the component specifier of zeros and ones. Here, <italic>W</italic><sub><italic>ik</italic></sub> = (<italic>W</italic><sub><italic>k</italic></sub>)<italic>i</italic> belongs to one if it comes from component <italic>i</italic> and zero otherwise. <italic>y<sub>i<sub>k</sub></sub></italic> = 0, if &#x03BB;<sub>1<italic>i</italic></sub> = &#x03BB;<sub>2<italic>i</italic></sub> = &#x2026;&#x03BB;<sub><italic>li</italic></sub>, specifying that more than a homogeneous model, the mixture model performs much better. For PMRM, the heterogeneity is varied across individuals is such a manner that it has a discrete mixture distribution.</p>
</sec>
<sec id="S4.SS1.SSS4">
<title>Assessment of a Zero Inflated Poisson Mixture Regression Model</title>
<p>Depending on the total number of counts being generated in the model, the data with many zeros can be served with the help of ZIPMRM. To manage both the zeros and heterogeneity, ZIPMRM acts as a very special mixture regression case. It comprises of a normal count distribution, which can be either a negative binomial or Poisson along with binary distribution, which can be degenerated at zero. In the analysis, the zeros may or may not be included with the non-zeros. This mechanism is considered as a dual data-generating mechanism, where zeros are generated from one side and a full range of counts is generated from the other side. Here, the consideration of ZIP model is done as there were structured zeros inside the data, which is indicated as true zeros in terms of the counting process. The assumption in the ZIP model is as follows:</p>
<disp-formula id="S4.E23"><label>(23)</label><mml:math id="M23"><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable displaystyle="true" rowspacing="0pt"><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mrow><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mtable displaystyle="true"/></mml:mtd><mml:mtd/></mml:mtr></mml:mtable></mml:mtd><mml:mtd/></mml:mtr></mml:mtable></mml:mtd><mml:mtd/></mml:mtr></mml:mtable><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mtext>&#x00A0;</mml:mtext><mml:mtable displaystyle="true"/><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>u</mml:mi><mml:mi>r</mml:mi><mml:msub><mml:mi>e</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mtd><mml:mtd/></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mi>o</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x03BB;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#x03B2;</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#x03B3;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mtable displaystyle="true"/><mml:mtable columnspacing="5pt" displaystyle="true"><mml:mtr><mml:mtd columnalign="center"><mml:mrow><mml:mi>i</mml:mi><mml:mi>f</mml:mi></mml:mrow></mml:mtd><mml:mtd columnalign="center"><mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>u</mml:mi><mml:mi>r</mml:mi><mml:msub><mml:mi>e</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mi/></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>where <italic>feature</italic><sub><italic>i</italic></sub> indicates whether the constituent <italic>i</italic> has the disease or not (i.e., epileptic or not, schizophrenic or not).</p>
</sec>
</sec>
<sec id="S4.SS2">
<title>Deep Learning Model Using Bi-Long Short-Term Memory</title>
<p>By means of considering the selected features, the classification is also done by means of utilizing a deep learning model with the help of BiLSTM where a bidirectional recurrent network is constructed by means of utilizing LSTM units. The past and future information can be captured easily so that the features can be classified by means of utilizing non-linear functions (<xref ref-type="bibr" rid="B10">Chen et al., 2017</xref>). BiLSTM comprises of both forward LSTM and backward LSTM. The information, which is not useful for classification, is omitted completely by LSTM and only the valuable information is passed to the future time point. Every LSTM unit comprises of an input gate, an output gate, and a forget gate as projected in <xref ref-type="fig" rid="F3">Figure 3</xref>.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption><p>Simple representation of an Long Short-Term Memory (LSTM) unit.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnhum-16-895761-g003.tif"/>
</fig>
<p>In the LSTM unit, the transmission of information is dependent on the forget gate. To assess whether the information is useful or not for detection or classification of the disease, it receives the previous hidden state <italic>h</italic><sub><italic>t</italic>&#x2212;1</sub> and the current information <italic>x</italic><sub><italic>t</italic></sub> continuously. To obtain the current cell state <italic>C</italic>, the effective utilization of the previous cell state <italic>C</italic><sub><italic>t</italic>&#x2212;1</sub>, previous hidden state <italic>h</italic><sub><italic>t</italic>&#x2212;1</sub> along with the current information <italic>x</italic><sub><italic>t</italic></sub> is done by the input gate. The output gate is utilized to provide the probability of two cases (epileptic or not, schizophrenia or not) by means of utilizing current information or previous information. The calculation of each gate at time <italic>t</italic> for every LSTM unit is expressed as follows:</p>
<disp-formula id="S4.E24"><label>(24)</label><mml:math id="M24"><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x03B4;</mml:mi><mml:mi>g</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>.</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>]</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></disp-formula>
<disp-formula id="S4.E25"><label>(25)</label><mml:math id="M25"><mml:mrow><mml:msub><mml:mi>o</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03B4;</mml:mi><mml:mi>g</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>o</mml:mi></mml:msub><mml:mo>.</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>]</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mi>o</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></disp-formula>
<disp-formula id="S4.E26"><label>(26)</label><mml:math id="M26"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03B4;</mml:mi><mml:mi>g</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>f</mml:mi></mml:msub><mml:mo>.</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>]</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mi>f</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></disp-formula>
<disp-formula id="S4.E27"><label>(27)</label><mml:math id="M27"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:msub><mml:mi>&#x03B4;</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>.</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>]</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:math></disp-formula>
<disp-formula id="S4.E28"><label>(28)</label><mml:math id="M28"><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>o</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:msub><mml:mi>&#x03B4;</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>where the sigmoid function is represented as &#x03B4;<sub><italic>g</italic></sub>, the cell states are expressed by <italic>C</italic>, hyperbolic tangent function is expressed by &#x03B4;<sub><italic>c</italic></sub>, and the hidden states is denoted by <italic>h</italic>. The formulation of the forget gate, output gate, and input gate is done in terms of <italic>f</italic>, <italic>o</italic>, and <italic>i</italic>, respectively. The weight of each gate is represented as <italic>W</italic> and the bias value is specified by <italic>b</italic>. By utilizing the current signal value <italic>x</italic><sub><italic>t</italic></sub> along with the previous hidden state <italic>h</italic><sub><italic>t</italic>&#x2212;1</sub>, the computation of the input of each function is done.</p>
<p>The EEG-based epileptic/schizophrenia classification by means of utilizing Bi-LSTM is illustrated in <xref ref-type="fig" rid="F4">Figure 4</xref>, in which the input is nothing but the selected features. <italic>x</italic><sub><italic>t</italic></sub> specifies the value at <italic>t</italic>. The hidden state of the forward LSTM is specified by <inline-formula><mml:math id="INEQ138"><mml:msubsup><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mi>f</mml:mi></mml:msubsup></mml:math></inline-formula> and the hidden state of the backward LSTM is specified by <inline-formula><mml:math id="INEQ139"><mml:msubsup><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mi>b</mml:mi></mml:msubsup></mml:math></inline-formula>. The features are processed by the forward LSTM from left to right and the hidden layers are utilized to pass the information. Based on the current input <italic>x</italic><sub><italic>t</italic></sub> and the previous hidden state <inline-formula><mml:math id="INEQ141"><mml:msubsup><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>f</mml:mi></mml:msubsup></mml:math></inline-formula>, the computation of the current hidden state <inline-formula><mml:math id="INEQ142"><mml:msubsup><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mi>f</mml:mi></mml:msubsup></mml:math></inline-formula> is done. The future information is passed to the history unit by the backward LSTM, and based on the input <italic>x</italic><sub><italic>t</italic></sub> along with the current hidden state <inline-formula><mml:math id="INEQ144"><mml:msubsup><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mi>b</mml:mi></mml:msubsup></mml:math></inline-formula>, the calculation of the previous hidden state <inline-formula><mml:math id="INEQ145"><mml:msubsup><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>b</mml:mi></mml:msubsup></mml:math></inline-formula> is done. The weights of Bi-LSTM are formulated as <italic>W</italic> = {<italic>W</italic><sub><italic>f</italic></sub>, <italic>W</italic><sub><italic>i</italic></sub>, <italic>W</italic><sub><italic>o</italic></sub>, <italic>W</italic><sub><italic>c</italic></sub>}. The cross entropy is utilized to establish the loss function of the Bi-LSTM. For minimizing the loss function <italic>L</italic>, the training of the model is done to compute the weights <italic>W</italic> and bias <italic>b</italic>. To update the parameters <italic>W</italic> and <italic>b</italic>, the utilization of gradient descent algorithm is done where it is formulated as follows:</p>
<disp-formula id="S4.E29"><label>(29)</label><mml:math id="M29"><mml:mrow><mml:mi>W</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo>-</mml:mo><mml:mrow><mml:mi>&#x03B7;</mml:mi><mml:mfrac><mml:mrow><mml:mo>&#x2202;</mml:mo><mml:mo>&#x2061;</mml:mo><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x2202;</mml:mo><mml:mo>&#x2061;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<disp-formula id="S4.E30"><label>(30)</label><mml:math id="M30"><mml:mrow><mml:mi>b</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mi>b</mml:mi><mml:mo>-</mml:mo><mml:mrow><mml:mi>&#x03B7;</mml:mi><mml:mfrac><mml:mrow><mml:mo>&#x2202;</mml:mo><mml:mo>&#x2061;</mml:mo><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x2202;</mml:mo><mml:mo>&#x2061;</mml:mo><mml:mi>b</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>where the learning rate is indicated by &#x03B7;. The utilization of the backward propagation algorithm is done so that the parameters <italic>W</italic> and <italic>b</italic> at every layer are updated. The final output of the Bi-LSTM is followed by means of using a Fully Connected (FC) Layer, wherein the activation function utilized is softmax and this is done so that the mapping of the inputs is done successfully into the probability values. The softmax function is expressed as follows:</p>
<disp-formula id="S4.E31"><label>(31)</label><mml:math id="M31"><mml:mrow><mml:msubsup><mml:mi>y</mml:mi><mml:mi>j</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mfrac><mml:msup><mml:mi>e</mml:mi><mml:msubsup><mml:mi>z</mml:mi><mml:mi>j</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup></mml:msup><mml:mrow><mml:msubsup><mml:mo largeop="true" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>C</mml:mi></mml:msubsup><mml:msup><mml:mi>e</mml:mi><mml:msubsup><mml:mi>z</mml:mi><mml:mi>j</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup></mml:msup></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption><p>Utilization of Bi-Long Short-Term Memory (LSTM) for classification.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fnhum-16-895761-g004.tif"/>
</fig>
</sec>
</sec>
<sec id="S5" sec-type="results|discussion">
<title>Results and Discussion</title>
<p>The FHM is utilized for the sake of extracting the features in terms of parameter components from the EEG signals. The features are selected with the help of a hybrid swarm algorithm and later classified with the developed classification models. The proposed model has been validated on EEG datasets and the following results have been obtained in terms of classification accuracy. The EEG datasets considered were Bonn Epileptic dataset, which has five subsets such as set A, set B, set C, set D, and set E, respectively (<xref ref-type="bibr" rid="B2">Andrzejak et al., 2001</xref>) along with a Schizophrenia dataset (<xref ref-type="bibr" rid="B50">Olejarczyk and Jernajczyk, 2017</xref>). All the in-depth details of the datasets are provided in the respective reference links. As far as the epileptic dataset is considered, Set A and B are obtained from five healthy volunteers; Set C, D, and E are obtained from five epileptic patients. The recorded period of Set A and B belongs to normal category and the recorded period of Set C and D represents the inter-ictal state (seizure free intervals) and Set E represents the ictal state (seizure activity). Six classification problems were studied for the epileptic dataset such as A-E, B-E, C-E, D-E, AB-E, CD-E, and for schizophrenia dataset, the classification study is between healthy vs. schizophrenia patients. The signal datasets were initially preprocessed using independent component analysis (ICA) before implementing the proposed methodology. A total of [4,097 &#x00D7; 100] data are present in the epileptic dataset, and initially when the features are extracted by FHM model, it is reduced to [2,500 &#x00D7; 50], and when the essential features are selected by HDPAB, it is reduced to [1,500 &#x00D7; 25] and it is fed to classification. Similarly, in schizophrenia dataset, 225,000 samples are present, which is split into collections of 5,000 sample segment, wherein each channel represents the data with a matrix of [5,000 &#x00D7; 45] per patient and for all the 19 channels, it is represented as [5,000 &#x00D7; 45 &#x00D7; 19]. When the features are extracted by FHM model for a single channel, it is reduced to [2,500 &#x00D7; 35], and when the essential features are selected by HDPAB, it is reduced to [1,500 &#x00D7; 25] and it is fed into classification. The classification of dataset is in such a way that 80% is training data, 10% is validation data, and 10% is test data. A 10-fold cross-validation technique is utilized for the ZIPMRM, deep learning, and machine learning models. Randomly, the dataset which is to be classified is split into 10 different parts. As usual, nine parts of the data were utilized for training and validation purposes and the rest one part was utilized for testing purposes. This process was repeated for about 10 times so that under every circumstance, different parts of training, testing, and validation data can be used effectively. Other hyperparameter settings for the deep learning are as follows: The optimizer used is Adam, learning rate is set at 0.01, the batch size is set at 40, and the number of hidden units is set as 80. The L2 regularization rate is set as 10<sup>&#x2212;4</sup>. The other classifiers utilized for comparison along with the deep learning models are K-Nearest Neighbor (KNN), Na&#x00EF;ve Bayesian Classifier (NBC), Adaboost, Linear Discriminant Analysis (LDA), SVM-RBF, Quadratic Discriminant Analysis (QDA), HMM, and GMM.</p>
<p><xref ref-type="table" rid="T2">Table 2</xref> expresses the performance analysis of FHM and HDPAB for different datasets in terms of accuracy. When the KNN classifier is considered, for the all datasets, a minimum classification accuracy of 76.20% was obtained for AB-E dataset and a high classification accuracy of 83.98% was obtained for schizophrenia dataset. Similarly, when NBC is considered, a low classification accuracy of 77.21% was obtained for A-E dataset and a high classification accuracy of 85.54% was obtained for schizophrenia dataset. The other techniques such as Adaboost, LDA, and QDA are performed in an average manner producing accuracies in the range of seventies and eighties. SVM classifier performed well by producing a high classification accuracy of 95.67% for schizophrenia dataset and a low classification accuracy of 91.08% for AB-E dataset. Similarly, HMM and GMM also performed in an above average manner, as the classification accuracies are found in the range of eighties. The ZIPMRM too performed well by producing a high classification accuracy of 95.31% in the A-E dataset and a low classification accuracy of 91.82% in the C-E dataset. Finally, when classified with LSTM and Bi-LSTM, the performance is exemplary, as a very high classification accuracy is obtained easily, with LSTM reporting a higher accuracy of 98.61% for the A-E dataset and a lower accuracy of 94.92% in the D-E dataset. Similarly, Bi-LSTM reports the highest classification accuracy of 98.79% in the case of A-E dataset and a comparatively low accuracy of 97.14% in the case of AB-E dataset, thus concluding that it performs supremely well when compared with the other conventional classifiers.</p>
<table-wrap position="float" id="T2">
<label>TABLE 2</label>
<caption><p>Performance analysis of Fusion Hybrid Model (FHM) and Hybrid Differential Particle Artificial Bee (HDPAB) for different datasets in terms of accuracy.</p></caption>
<table cellspacing="5" cellpadding="5" frame="hsides" rules="groups">
<thead>
<tr>
<td valign="top" align="left">Classifier</td>
<td valign="top" align="center">A-E</td>
<td valign="top" align="center">B-E</td>
<td valign="top" align="center">C-E</td>
<td valign="top" align="center">D-E</td>
<td valign="top" align="center">AB-E</td>
<td valign="top" align="center">CD-E</td>
<td valign="top" align="center">Schizophrenia</td>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">KNN</td>
<td valign="top" align="center">80.11</td>
<td valign="top" align="center">76.67</td>
<td valign="top" align="center">77.34</td>
<td valign="top" align="center">80.49</td>
<td valign="top" align="center">76.20</td>
<td valign="top" align="center">80.88</td>
<td valign="top" align="center">83.98</td>
</tr>
<tr>
<td valign="top" align="left">NBC</td>
<td valign="top" align="center">77.21</td>
<td valign="top" align="center">79.82</td>
<td valign="top" align="center">77.92</td>
<td valign="top" align="center">84.33</td>
<td valign="top" align="center">77.35</td>
<td valign="top" align="center">84.22</td>
<td valign="top" align="center">85.54</td>
</tr>
<tr>
<td valign="top" align="left">Adaboost</td>
<td valign="top" align="center">87.42</td>
<td valign="top" align="center">87.82</td>
<td valign="top" align="center">87.58</td>
<td valign="top" align="center">87.10</td>
<td valign="top" align="center">89.37</td>
<td valign="top" align="center">85.36</td>
<td valign="top" align="center">88.47</td>
</tr>
<tr>
<td valign="top" align="left">LDA</td>
<td valign="top" align="center">81.67</td>
<td valign="top" align="center">77.53</td>
<td valign="top" align="center">80.01</td>
<td valign="top" align="center">86.71</td>
<td valign="top" align="center">83.78</td>
<td valign="top" align="center">77.39</td>
<td valign="top" align="center">77.14</td>
</tr>
<tr>
<td valign="top" align="left">SVM</td>
<td valign="top" align="center">96.88</td>
<td valign="top" align="center">93.89</td>
<td valign="top" align="center">95.97</td>
<td valign="top" align="center">92.93</td>
<td valign="top" align="center">91.08</td>
<td valign="top" align="center">94.6</td>
<td valign="top" align="center">95.67</td>
</tr>
<tr>
<td valign="top" align="left">QDA</td>
<td valign="top" align="center">81.47</td>
<td valign="top" align="center">85.81</td>
<td valign="top" align="center">83.34</td>
<td valign="top" align="center">84.05</td>
<td valign="top" align="center">82.02</td>
<td valign="top" align="center">84.85</td>
<td valign="top" align="center">88.59</td>
</tr>
<tr>
<td valign="top" align="left">HMM</td>
<td valign="top" align="center">92.31</td>
<td valign="top" align="center">91.92</td>
<td valign="top" align="center">88.11</td>
<td valign="top" align="center">89.18</td>
<td valign="top" align="center">89.37</td>
<td valign="top" align="center">85.11</td>
<td valign="top" align="center">86.11</td>
</tr>
<tr>
<td valign="top" align="left">GMM</td>
<td valign="top" align="center">82.31</td>
<td valign="top" align="center">79.12</td>
<td valign="top" align="center">81.29</td>
<td valign="top" align="center">82.38</td>
<td valign="top" align="center">81.83</td>
<td valign="top" align="center">78.59</td>
<td valign="top" align="center">79.71</td>
</tr>
<tr>
<td valign="top" align="left">ZIPMRM</td>
<td valign="top" align="center">95.31</td>
<td valign="top" align="center">92.58</td>
<td valign="top" align="center">91.82</td>
<td valign="top" align="center">92.47</td>
<td valign="top" align="center">93.59</td>
<td valign="top" align="center">93.48</td>
<td valign="top" align="center">94.83</td>
</tr>
<tr>
<td valign="top" align="left">LSTM</td>
<td valign="top" align="center">98.61</td>
<td valign="top" align="center">96.31</td>
<td valign="top" align="center">96.61</td>
<td valign="top" align="center">94.92</td>
<td valign="top" align="center">95.71</td>
<td valign="top" align="center">96.82</td>
<td valign="top" align="center">97.49</td>
</tr>
<tr>
<td valign="top" align="left">Bi-LSTM</td>
<td valign="top" align="center">98.79</td>
<td valign="top" align="center">97.71</td>
<td valign="top" align="center">98.66</td>
<td valign="top" align="center">98.75</td>
<td valign="top" align="center">97.14</td>
<td valign="top" align="center">96.49</td>
<td valign="top" align="center">98.35</td>
</tr>
</tbody>
</table>
</table-wrap>
<sec id="S5.SS1">
<title>Comparison of Our Results With the Previous Studies</title>
<p>The results with the proposed flow of methodology are compared with the existing studies and are shown in <xref ref-type="table" rid="T3">Table 3</xref> for the Bonn epileptic dataset and schizophrenia dataset. Few studies are available in the literature regarding schizophrenia classification because the research is still under progress, while as far as the epilepsy classification is concerned, the field is more established and so some of the prominent studies in recent years are compared with our results.</p>
<table-wrap position="float" id="T3">
<label>TABLE 3</label>
<caption><p>Comparison study with the works reported on the similar datasets used for both epilepsy classification and schizophrenia classification.</p></caption>
<table cellspacing="5" cellpadding="5" frame="hsides" rules="groups">
<thead>
<tr>
<td valign="top" align="left">Classification issue dealt</td>
<td valign="top" align="center">References</td>
<td valign="top" align="center">Technique utilized</td>
<td valign="top" align="center">Classification accuracy (%)</td>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">A vs. E</td>
<td valign="top" align="center"><xref ref-type="bibr" rid="B60">Samiee et al., 2015</xref></td>
<td valign="top" align="center">Discrete Short Time Fourier transform with Multilayer Perceptron</td>
<td valign="top" align="center">99.80</td>
</tr>
<tr>
<td/>
<td valign="top" align="left"><xref ref-type="bibr" rid="B6">Bhardwaj et al., 2016</xref></td>
<td valign="top" align="center">EMD combined with genetic programming</td>
<td valign="top" align="center">98.64</td>
</tr>
<tr>
<td/>
<td valign="top" align="left"><xref ref-type="bibr" rid="B16">Diykh et al., 2017</xref></td>
<td valign="top" align="center">Establishing a weighted complex network with SVM classification</td>
<td valign="top" align="center">100</td>
</tr>
<tr>
<td/>
<td valign="top" align="left"><xref ref-type="bibr" rid="B62">Sharma et al., 2018</xref></td>
<td valign="top" align="center">Orthogonal wavelet implementation with SVM</td>
<td valign="top" align="center">100</td>
</tr>
<tr>
<td/>
<td valign="top" align="left">Proposed method</td>
<td valign="top" align="center">FHM + HDPAB+ ZIPMRM</td>
<td valign="top" align="center">95.31</td>
</tr>
<tr>
<td/>
<td/>
<td valign="top" align="center">FHM + HDPAB+ LSTM</td>
<td valign="top" align="center">98.61</td>
</tr>
<tr>
<td/>
<td/>
<td valign="top" align="center">FHM + HDPAB +BiLSTM</td>
<td valign="top" align="center">98.79</td>
</tr>
<tr>
<td valign="top" align="left">B vs. E</td>
<td valign="top" align="center"><xref ref-type="bibr" rid="B16">Diykh et al., 2017</xref></td>
<td valign="top" align="center">Establishing a weighted complex network with SVM classification</td>
<td valign="top" align="center">99.76</td>
</tr>
<tr>
<td/>
<td valign="top" align="left"><xref ref-type="bibr" rid="B63">Sharma et al., 2017</xref></td>
<td valign="top" align="center">Analytic Time Frequency Flexible Wavelet Transform with SVM</td>
<td valign="top" align="center">82.88</td>
</tr>
<tr>
<td/>
<td valign="top" align="left"><xref ref-type="bibr" rid="B48">Nicolaou and Georgiou, 2012</xref></td>
<td valign="top" align="center">Permutation entropy with SVM</td>
<td valign="top" align="center">93.55</td>
</tr>
<tr>
<td/>
<td valign="top" align="left">Proposed method</td>
<td valign="top" align="center">FHM + HDPAB+ ZIPMRM</td>
<td valign="top" align="center">92.58</td>
</tr>
<tr>
<td/>
<td/>
<td valign="top" align="center">FHM + HDPAB+ LSTM</td>
<td valign="top" align="center">96.31</td>
</tr>
<tr>
<td/>
<td/>
<td valign="top" align="center">FHM + HDPAB +BiLSTM</td>
<td valign="top" align="center">97.71</td>
</tr>
<tr>
<td valign="top" align="left">C vs. E</td>
<td valign="top" align="center"><xref ref-type="bibr" rid="B60">Samiee et al., 2015</xref></td>
<td valign="top" align="center">Discrete Short Time Fourier transform with Multilayer Perceptron</td>
<td valign="top" align="center">98.50</td>
</tr>
<tr>
<td/>
<td valign="top" align="left"><xref ref-type="bibr" rid="B16">Diykh et al., 2017</xref></td>
<td valign="top" align="center">Establishing a weighted complex network with SVM classification</td>
<td valign="top" align="center">96.00</td>
</tr>
<tr>
<td/>
<td valign="top" align="left"><xref ref-type="bibr" rid="B63">Sharma et al., 2017</xref></td>
<td valign="top" align="center">Analytic Time Frequency Flexible Wavelet Transform with SVM</td>
<td valign="top" align="center">99.00</td>
</tr>
<tr>
<td/>
<td valign="top" align="left"><xref ref-type="bibr" rid="B48">Nicolaou and Georgiou, 2012</xref></td>
<td valign="top" align="center">Permutation Entropy with SVM</td>
<td valign="top" align="center">88.00</td>
</tr>
<tr>
<td/>
<td valign="top" align="left">Proposed method</td>
<td valign="top" align="center">FHM + HDPAB+ ZIPMRM</td>
<td valign="top" align="center">91.82</td>
</tr>
<tr>
<td/>
<td/>
<td valign="top" align="center">FHM + HDPAB+ LSTM</td>
<td valign="top" align="center">96.61</td>
</tr>
<tr>
<td/>
<td/>
<td valign="top" align="center">FHM + HDPAB +BiLSTM</td>
<td valign="top" align="center">98.66</td>
</tr>
<tr>
<td valign="top" align="left">D vs. E</td>
<td valign="top" align="center"><xref ref-type="bibr" rid="B60">Samiee et al., 2015</xref></td>
<td valign="top" align="center">Discrete Short Time Fourier transform with Multilayer Perceptron</td>
<td valign="top" align="center">94.90</td>
</tr>
<tr>
<td/>
<td valign="top" align="left"><xref ref-type="bibr" rid="B16">Diykh et al., 2017</xref></td>
<td valign="top" align="center">Establishing a weighted complex network with SVM classification</td>
<td valign="top" align="center">93.70</td>
</tr>
<tr>
<td/>
<td valign="top" align="left"><xref ref-type="bibr" rid="B48">Nicolaou and Georgiou, 2012</xref></td>
<td valign="top" align="center">Permutation Entropy with SVM</td>
<td valign="top" align="center">79.94</td>
</tr>
<tr>
<td/>
<td valign="top" align="left"><xref ref-type="bibr" rid="B59">Riaz et al., 2016</xref></td>
<td valign="top" align="center">EMD and SVM</td>
<td valign="top" align="center">93.00</td>
</tr>
<tr>
<td/>
<td valign="top" align="left">Proposed method</td>
<td valign="top" align="center">FHM + HDPAB+ ZIPMRM</td>
<td valign="top" align="center">92.47</td>
</tr>
<tr>
<td/>
<td/>
<td valign="top" align="center">FHM + HDPAB+ LSTM</td>
<td valign="top" align="center">94.92</td>
</tr>
<tr>
<td/>
<td/>
<td valign="top" align="center">FHM + HDPAB +BiLSTM</td>
<td valign="top" align="center">98.75</td>
</tr>
<tr>
<td valign="top" align="left">AB-E</td>
<td valign="top" align="center"><xref ref-type="bibr" rid="B16">Diykh et al., 2017</xref></td>
<td valign="top" align="center">Establishing a weighted complex network with SVM classification</td>
<td valign="top" align="center">96.40</td>
</tr>
<tr>
<td/>
<td valign="top" align="left"><xref ref-type="bibr" rid="B58">Raghu et al., 2019</xref></td>
<td valign="top" align="center">Analysis of Matrix Determinants with Multilayer Perceptron</td>
<td valign="top" align="center">97.10</td>
</tr>
<tr>
<td/>
<td valign="top" align="left">Proposed method</td>
<td valign="top" align="center">FHM + HDPAB+ ZIPMRM</td>
<td valign="top" align="center">93.59</td>
</tr>
<tr>
<td/>
<td/>
<td valign="top" align="center">FHM + HDPAB+ LSTM</td>
<td valign="top" align="center">95.71</td>
</tr>
<tr>
<td/>
<td/>
<td valign="top" align="center">FHM + HDPAB +BiLSTM</td>
<td valign="top" align="center">97.14</td>
</tr>
<tr>
<td valign="top" align="left">CD-E</td>
<td valign="top" align="center"><xref ref-type="bibr" rid="B16">Diykh et al., 2017</xref></td>
<td valign="top" align="center">Establishing a weighted complex network with SVM classification</td>
<td valign="top" align="center">94.50</td>
</tr>
<tr>
<td/>
<td valign="top" align="left"><xref ref-type="bibr" rid="B58">Raghu et al., 2019</xref></td>
<td valign="top" align="center">Analysis of Matrix Determinants with Multilayer Perceptron</td>
<td valign="top" align="center">96.85</td>
</tr>
<tr>
<td/>
<td valign="top" align="left">Proposed method</td>
<td valign="top" align="center">FHM + HDPAB+ ZIPMRM</td>
<td valign="top" align="center">93.48</td>
</tr>
<tr>
<td/>
<td/>
<td valign="top" align="center">FHM + HDPAB+ LSTM</td>
<td valign="top" align="center">96.82</td>
</tr>
<tr>
<td/>
<td/>
<td valign="top" align="center">FHM + HDPAB +BiLSTM</td>
<td valign="top" align="center">96.49</td>
</tr>
<tr>
<td valign="top" align="left">Schizophrenia dataset</td>
<td valign="top" align="center"><xref ref-type="bibr" rid="B49">Oh et al., 2019</xref></td>
<td valign="top" align="center">11 layered CNN</td>
<td valign="top" align="center">98.07 and 81.26</td>
</tr>
<tr>
<td/>
<td valign="top" align="left"><xref ref-type="bibr" rid="B56">Prabhakar et al., 2020a</xref></td>
<td valign="top" align="center">Nature inspired learning with machine learning</td>
<td valign="top" align="center">98.77</td>
</tr>
<tr>
<td/>
<td valign="top" align="left"><xref ref-type="bibr" rid="B55">Prabhakar et al., 2020b</xref></td>
<td valign="top" align="center">Swarm intelligence with machine learning</td>
<td valign="top" align="center">92.17</td>
</tr>
<tr>
<td/>
<td valign="top" align="left">Proposed method</td>
<td valign="top" align="center">FHM + HDPAB+ ZIPMRM</td>
<td valign="top" align="center">94.83</td>
</tr>
<tr>
<td/>
<td/>
<td valign="top" align="center">FHM + HDPAB+ LSTM</td>
<td valign="top" align="center">97.49</td>
</tr>
<tr>
<td/>
<td/>
<td valign="top" align="center">FHM + HDPAB +BiLSTM</td>
<td valign="top" align="center">98.35</td>
</tr>
</tbody>
</table></table-wrap>
<p>It is quite evident from <xref ref-type="table" rid="T3">Table 3</xref> that the proposed methods produced a very good result in comparison with the previous results. Although at some places, the obtained classification accuracy may be slightly less by a range of 1&#x2013;2%, but it should not deter the researchers and readers into concluding that the method is not versatile and innovative or even considering the necessity of the proposed method. In the field of machine learning and deep learning, every technique is pretty useful and has its own merits and demerits, and every proposed methodology has to be acknowledged unless it performs very worse. On considering this aspect, the proposed methodology performed very well by producing an overall high classification accuracy of 98.79% for epileptic dataset and 98.35% for the schizophrenia dataset. Moreover, previous methods have only concentrated on experimental analysis without any strong mathematical model to support it; however in our study, a good mathematical justification is also given, and it can be implemented to other biosignal processing datasets to obtain a good accuracy.</p>
</sec>
</sec>
<sec id="S6" sec-type="conclusion">
<title>Conclusion and Future Studies</title>
<p>In various fields of biomedical engineering, neural engineering, and neuroscience, the most widely used technique is EEG. Due to its low financial cost, very high temporal resolution accompanied by other exemplary attributes, it is widely used in different fields such as seizure detection, dementia analysis, alcoholism detection, analysis of sleep disorders, etc. To rely less on trained professionals, the efficient EEG signal classification is quite important. To the EEG data, a variety of conventional and advanced pattern recognition, soft computing, and machine learning algorithms were implemented. As the standardized EEG classification model of EEG includes preprocessing for removal of artifacts, feature extraction, feature selection, and classification, in our study, a fusion hybrid model called FHM was developed initially for feature extraction. A hybrid swarm algorithm called HDPAB was developed was feature selection and was followed by classification with ZIPMRM, deep learning, and eight other conventional classifiers. The best results are obtained for the A-E dataset wherein highest classification accuracy of 98.79% is obtained with Bi-LSTM, and for schizophrenia dataset, the highest classification accuracy of 98.35% is obtained. The second best results were obtained utilizing Bi-LSTM for D-E dataset reporting a classification accuracy of 98.75%, and for schizophrenia dataset, a higher classification accuracy of 97.49% is obtained when utilized with LSTM. The third best results were obtained when Bi-LSTM is utilized for C-E dataset reporting a classification accuracy of 98.66%, and for schizophrenia dataset, a classification accuracy of 95.67% is obtained with SVM. Future studies aim to develop efficient hybrid models and clubbing it with a variety of other deep learning techniques for the efficient classification of biosignals.</p>
</sec>
<sec id="S7" sec-type="data-availability">
<title>Data Availability Statement</title>
<p>The relevant programming codes of this work can be obtained from the corresponding author upon request.</p>
</sec>
<sec id="S8">
<title>Author Contributions</title>
<p>SP: visualization and experimentation. HR: experimentation and draft manuscript. CK: experimentation and critical analysis. D-OW: draft manuscript, writing and correction, and funding.</p>
</sec>
<sec id="conf1" sec-type="COI-statement">
<title>Conflict of Interest</title>
<p>The author declares that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec id="pudiscl1" sec-type="disclaimer">
<title>Publisher&#x2019;s Note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
</body>
<back>
<sec id="S9" sec-type="funding-information">
<title>Funding</title>
<p>This work was supported by Institute of Information and Communications Technology Planning and Evaluation (IITP) grant funded by the Korea Government (MSIT) (No. 2017-0-00451, Development of BCI based Brain and Cognitive Computing Technology for Recognizing User&#x2019;s Intentions using Deep Learning) and partly supported by the Korea Medical Device Development Fund grant funded by the Korea Government [the Ministry of Science and ICT (MSIT), the Ministry of Trade, Industry and Energy, the Ministry of Health &#x0026; Welfare, and the Ministry of Food and Drug Safety] (No. 1711139109, KMDF_PR_20210527_0005).</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Altamirano</surname> <given-names>L.</given-names></name> <name><surname>Riff</surname> <given-names>M. C.</given-names> <suffix>I</suffix></name></person-group> (<year>2012</year>). <article-title>Araya, and L. trilling, &#x201C;anesthesiology nurse scheduling using particle swarm optimization,&#x201D;.</article-title> <source><italic>Int. J. Comput. Intell. Syst.</italic></source> <volume>5</volume> <fpage>111</fpage>&#x2013;<lpage>125</lpage>. <pub-id pub-id-type="doi">10.1080/18756891.2012.670525</pub-id></citation></ref>
<ref id="B2"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Andrzejak</surname> <given-names>R. G.</given-names></name> <name><surname>Lehnertz</surname> <given-names>K. C.</given-names></name> <name><surname>Rieke</surname> <given-names>F.</given-names></name> <name><surname>Mormann</surname> <given-names>P.</given-names></name> <name><surname>Elger</surname> <given-names>C. E.</given-names></name></person-group> (<year>2001</year>). <article-title>Indications of non linear deterministic and finite dimensional structures in time series of brain electrical activity: dependence on recording region and brain state.</article-title> <source><italic>Phys. Rev. E Stat. Nonlin. Soft Matter Phys.</italic></source> <volume>64</volume>:<issue>061907</issue>. <pub-id pub-id-type="doi">10.1103/PhysRevE.64.061907</pub-id> <pub-id pub-id-type="pmid">11736210</pub-id></citation></ref>
<ref id="B3"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ardabili</surname> <given-names>S.</given-names></name> <name><surname>Mosavi</surname> <given-names>A.</given-names></name> <name><surname>V&#x00E1;rkonyi-K&#x00F3;czy</surname> <given-names>A. R.</given-names></name></person-group> (<year>2020</year>). &#x201C;<article-title>Advances in machine learning modeling reviewing hybrid and ensemble methods</article-title>,&#x201D; in <source><italic>Lecture Notes in Networks and Systems</italic></source>, <volume>Vol. 101</volume> (<publisher-loc>Berlin</publisher-loc>: <publisher-name>Springer</publisher-name>). <fpage>215</fpage>&#x2013;<lpage>227</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-030-36841-8_21</pub-id></citation></ref>
<ref id="B4"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Avidan</surname> <given-names>S.</given-names></name></person-group> (<year>2007</year>). <article-title>&#x201C;Ensemble tracking.&#x201D;.</article-title> <source><italic>IEEE Trans. Pattern Anal. Mach. Intell.</italic></source> <volume>29</volume> <fpage>261</fpage>&#x2013;<lpage>271</lpage>. <pub-id pub-id-type="doi">10.1109/TPAMI.2007.35</pub-id> <pub-id pub-id-type="pmid">17170479</pub-id></citation></ref>
<ref id="B5"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bermudez</surname> <given-names>L.</given-names></name> <name><surname>Karlis</surname> <given-names>D.</given-names></name></person-group> (<year>2012</year>). <article-title>A finite mixture of bivariate poisson regression models with an application to insurance ratemaking.</article-title> <source><italic>Comput. Stat. Data Anal.</italic></source> <volume>56</volume> <fpage>3988</fpage>&#x2013;<lpage>3999</lpage>. <pub-id pub-id-type="doi">10.1016/j.csda.2012.05.016</pub-id></citation></ref>
<ref id="B6"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bhardwaj</surname> <given-names>A.</given-names></name> <name><surname>Tiwari</surname> <given-names>A.</given-names></name> <name><surname>Krishna</surname> <given-names>R.</given-names></name> <name><surname>Varma</surname> <given-names>V.</given-names></name></person-group> (<year>2016</year>). <article-title>A novel genetic programming approach for epileptic seizure detection.</article-title> <source><italic>Comput. Methods Programs Biomed.</italic></source> <volume>124</volume> <fpage>2</fpage>&#x2013;<lpage>18</lpage>. <pub-id pub-id-type="doi">10.1016/j.cmpb.2015.10.001</pub-id> <pub-id pub-id-type="pmid">26645791</pub-id></citation></ref>
<ref id="B7"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bhunya</surname> <given-names>P. K.</given-names></name> <name><surname>Berndtsson</surname> <given-names>R.</given-names></name> <name><surname>Ojha</surname> <given-names>C. S. P.</given-names></name> <name><surname>Mishra</surname> <given-names>S. K.</given-names></name></person-group> (<year>2007</year>). <article-title>Suitability of gamma, chi-square, weibull, and beta distributions as synthetic unit hydrographs.</article-title> <source><italic>J. Hydrol.</italic></source> <volume>334</volume> <fpage>28</fpage>&#x2013;<lpage>38</lpage>. <pub-id pub-id-type="doi">10.1016/j.jhydrol.2006.09.022</pub-id></citation></ref>
<ref id="B8"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bose</surname> <given-names>T.</given-names></name> <name><surname>Sivakumar</surname> <given-names>S.</given-names></name> <name><surname>Kesavamurthy</surname> <given-names>B.</given-names></name></person-group> (<year>2016</year>). <article-title>Identification of schizophrenia using EEG alpha band power during hyperventilation and post-hyperventilation.</article-title> <source><italic>J. Med. Biol. Eng.</italic></source> <volume>36</volume> <fpage>901</fpage>&#x2013;<lpage>911</lpage>. <pub-id pub-id-type="doi">10.1007/s40846-016-0192-2</pub-id></citation></ref>
<ref id="B9"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cappelli</surname> <given-names>R.</given-names></name> <name><surname>Maio</surname> <given-names>D.</given-names></name> <name><surname>Maltoni</surname> <given-names>D.</given-names></name></person-group> (<year>2002</year>). <article-title>A multi-classifier approach to fingerprint classification.</article-title> <source><italic>Pattern Anal. App.</italic></source> <volume>5</volume> <fpage>136</fpage>&#x2013;<lpage>144</lpage>. <pub-id pub-id-type="doi">10.1007/s100440200012</pub-id></citation></ref>
<ref id="B10"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>T.</given-names></name> <name><surname>Xu</surname> <given-names>R.</given-names></name> <name><surname>He</surname> <given-names>Y.</given-names></name> <name><surname>Wang</surname> <given-names>X.</given-names></name></person-group> (<year>2017</year>). <article-title>Improving sentiment analysis via sentence type classification using BiLSTM-CRF and CNN.</article-title> <source><italic>Expert Syst. App.</italic></source> <volume>72</volume> <fpage>221</fpage>&#x2013;<lpage>230</lpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2016.10.065</pub-id></citation></ref>
<ref id="B11"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cho</surname> <given-names>S. B.</given-names></name> <name><surname>Won</surname> <given-names>H.-H.</given-names></name></person-group> (<year>2007</year>). <article-title>Cancer classification using ensemble of neural networks with multiple significant gene subsets.</article-title> <source><italic>Appl. Intell.</italic></source> <volume>26</volume> <fpage>243</fpage>&#x2013;<lpage>250</lpage>. <pub-id pub-id-type="doi">10.1007/s10489-006-0020-4</pub-id></citation></ref>
<ref id="B12"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chu</surname> <given-names>L.</given-names></name> <name><surname>Qiu</surname> <given-names>R.</given-names></name> <name><surname>Liu</surname> <given-names>H.</given-names></name> <name><surname>Ling</surname> <given-names>Z.</given-names></name> <name><surname>Zhang</surname> <given-names>T.</given-names></name> <name><surname>Wang</surname> <given-names>J.</given-names></name></person-group> (<year>2018</year>). <article-title>Individual Recognition in schizophrenia using deep learning methods with random forest and voting classifiers: insights from resting state EEG streams.</article-title> <source><italic>bioRixv</italic></source> [<comment>Preprint</comment>] arXiv:1707.03467v2 [cs.CV],</citation></ref>
<ref id="B13"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Constantinopoulos</surname> <given-names>C.</given-names></name> <name><surname>Likas</surname> <given-names>A.</given-names></name></person-group> (<year>2007</year>). <article-title>Unsupervised learning of gaussian mixtures based on variational component splitting.</article-title> <source><italic>IEEE Trans. Neural Netw.</italic></source> <volume>18</volume> <fpage>745</fpage>&#x2013;<lpage>755</lpage>. <pub-id pub-id-type="doi">10.1109/TNN.2006.891114</pub-id> <pub-id pub-id-type="pmid">17526341</pub-id></citation></ref>
<ref id="B14"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Das</surname> <given-names>K.</given-names></name> <name><surname>Pachori</surname> <given-names>R. B.</given-names></name></person-group> (<year>2021</year>). <article-title>Schizophrenia detection techniques using multivariate iterative filtering and multichannel EEG signals.</article-title> <source><italic>Biomed. Signal Process. Control</italic></source> <volume>67</volume>:<issue>102525</issue>. <pub-id pub-id-type="doi">10.1016/j.bspc.2021.102525</pub-id></citation></ref>
<ref id="B15"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dean</surname> <given-names>N.</given-names></name> <name><surname>Raftery</surname> <given-names>A. E.</given-names></name></person-group> (<year>2005</year>). <article-title>Normal uniform mixture differential gene expression detection for cDNA microarrays.</article-title> <source><italic>BMC Bioinformatics</italic></source> <volume>6</volume>:<fpage>173</fpage>&#x2013;<lpage>186</lpage>. <pub-id pub-id-type="doi">10.1186/1471-2105-6-173</pub-id> <pub-id pub-id-type="pmid">16011807</pub-id></citation></ref>
<ref id="B16"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Diykh</surname> <given-names>M.</given-names></name> <name><surname>Li</surname> <given-names>Y.</given-names></name> <name><surname>Wen</surname> <given-names>P.</given-names></name></person-group> (<year>2017</year>). <article-title>Classify epileptic EEG signals using weighted complex networks based community structure detection.</article-title> <source><italic>Experts Syst. Appl.</italic></source> <volume>90</volume> <fpage>87</fpage>&#x2013;<lpage>100</lpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2017.08.012</pub-id></citation></ref>
<ref id="B17"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Elguebaly</surname> <given-names>T.</given-names></name> <name><surname>Bouguila</surname> <given-names>N.</given-names></name></person-group> (<year>2011</year>). <article-title>Bayesian learning of finite generalized gaussian mixture models on images.</article-title> <source><italic>Signal Process.</italic></source> <volume>91</volume> <fpage>801</fpage>&#x2013;<lpage>820</lpage>. <pub-id pub-id-type="doi">10.1016/j.sigpro.2010.08.014</pub-id></citation></ref>
<ref id="B18"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Faria</surname> <given-names>S.</given-names></name> <name><surname>Goncalves</surname> <given-names>F.</given-names></name></person-group> (<year>2013</year>). <article-title>Financial data modelling by Poisson mixture regression.</article-title> <source><italic>J. Appl. Stat.</italic></source> <volume>40</volume> <fpage>2150</fpage>&#x2013;<lpage>2162</lpage>. <pub-id pub-id-type="doi">10.1080/02664763.2013.807332</pub-id></citation></ref>
<ref id="B19"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Govindarajan</surname> <given-names>M.</given-names></name></person-group> (<year>2014</year>). <article-title>Hybrid intrusion detection using ensemble of classification methods.</article-title> <source><italic>Int. J. Comput. Netw. Inf. Secur.</italic></source> <volume>6</volume> <fpage>45</fpage>&#x2013;<lpage>53</lpage>. <pub-id pub-id-type="doi">10.5815/ijcnis.2014.02.07</pub-id></citation></ref>
<ref id="B20"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hsieh</surname> <given-names>N. C.</given-names></name> <name><surname>HungA</surname> <given-names>L. P.</given-names></name></person-group> (<year>2010</year>). <article-title>data driven ensemble classifier for credit scoring analysis.</article-title> <source><italic>Expert Syst. Appl.</italic></source> <volume>37</volume> <fpage>534</fpage>&#x2013;<lpage>545</lpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2009.05.059</pub-id></citation></ref>
<ref id="B21"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hsu</surname> <given-names>K.-W.</given-names></name></person-group> (<year>2017</year>). <article-title>A Theoretical analysis of why hybrid ensembles work.</article-title> <source><italic>Comput. Intell. Neurosci.</italic></source> <volume>2017</volume>:<issue>1930702</issue>. <pub-id pub-id-type="doi">10.1155/2017/1930702</pub-id> <pub-id pub-id-type="pmid">28255296</pub-id></citation></ref>
<ref id="B22"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jahmunah</surname> <given-names>V.</given-names></name> <name><surname>Lih</surname> <given-names>Oh S</given-names></name> <name><surname>Rajinikanth</surname> <given-names>V.</given-names></name> <name><surname>Ciaccio</surname> <given-names>E. J.</given-names></name> <name><surname>Hao</surname> <given-names>Cheong K</given-names></name> <name><surname>Arunkumar</surname> <given-names>N.</given-names></name><etal/></person-group> (<year>2019</year>). <article-title>Automated detection of schizophrenia using nonlinear signal processing methods.</article-title> <source><italic>Artif. Intell. Med.</italic></source> <volume>100</volume>:<issue>101698</issue>. <pub-id pub-id-type="doi">10.1016/j.artmed.2019.07.006</pub-id> <pub-id pub-id-type="pmid">31607349</pub-id></citation></ref>
<ref id="B23"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jeong</surname> <given-names>J. H.</given-names></name> <name><surname>Lee</surname> <given-names>B. H.</given-names></name> <name><surname>Lee</surname> <given-names>D. H.</given-names></name> <name><surname>Yun</surname> <given-names>Y. D.</given-names></name> <name><surname>Lee</surname> <given-names>S. W.</given-names></name></person-group> (<year>2020b</year>). <article-title>EEG classification of forearm movement imagery using a hierarchical flow convolutional neural network.</article-title> <source><italic>IEEE Access</italic></source> <volume>8</volume> <fpage>66941</fpage>&#x2013;<lpage>66950</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2020.2983182</pub-id></citation></ref>
<ref id="B24"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jeong</surname> <given-names>J. H.</given-names></name> <name><surname>Shim</surname> <given-names>K. H.</given-names></name> <name><surname>Kim</surname> <given-names>D. J.</given-names></name> <name><surname>Lee</surname> <given-names>S. W.</given-names></name></person-group> (<year>2020a</year>). <article-title>Brain-Controlled robotic arm system based on multi-directional CNN-BiLSTM network using EEG signals.</article-title> <source><italic>IEEE Trans. Neural Syst. Rehabil. Eng.</italic></source> <volume>28</volume> <fpage>1226</fpage>&#x2013;<lpage>1238</lpage>. <pub-id pub-id-type="doi">10.1109/TNSRE.2020.2981659</pub-id> <pub-id pub-id-type="pmid">32191894</pub-id></citation></ref>
<ref id="B25"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kanzawa</surname> <given-names>Y.</given-names></name></person-group> (<year>2017</year>). &#x201C;<article-title>On fuzzy clustering for categorical multivariate data induced by polya mixture models</article-title>,&#x201D; in <source><italic>Modeling Decisions for Artificial Intelligence. MDAI 2017. Lecture Notes in Computer Science</italic></source>, <volume>Vol. 10571</volume> <role>eds</role> <person-group person-group-type="editor"><name><surname>Torra</surname> <given-names>V.</given-names></name> <name><surname>Narukawa</surname> <given-names>Y.</given-names></name> <name><surname>Honda</surname> <given-names>A.</given-names></name> <name><surname>Inoue</surname> <given-names>S.</given-names></name></person-group> (<publisher-loc>Berlin</publisher-loc>: <publisher-name>Springer</publisher-name>). <pub-id pub-id-type="doi">10.1007/978-3-319-67422-3_9</pub-id></citation></ref>
<ref id="B26"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Karaboga</surname> <given-names>D.</given-names></name> <name><surname>Basturk</surname> <given-names>B.</given-names></name></person-group> (<year>2008</year>). <article-title>On the performance of artificial bee colony (ABC) algorithm.</article-title> <source><italic>Appl. Soft Comput.</italic></source> <volume>8</volume> <fpage>687</fpage>&#x2013;<lpage>697</lpage>. <pub-id pub-id-type="doi">10.1016/j.asoc.2007.05.007</pub-id></citation></ref>
<ref id="B27"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Karlis</surname> <given-names>D.</given-names></name> <name><surname>Rahmouni</surname> <given-names>M.</given-names></name></person-group> (<year>2007</year>). <article-title>Analysis of defaulters&#x2019; behaviour using poisson-mixture approach.</article-title> <source><italic>IMA J. Math. Manage.</italic></source> <volume>18</volume> <fpage>297</fpage>&#x2013;<lpage>311</lpage>. <pub-id pub-id-type="doi">10.1093/imaman/dpm025</pub-id></citation></ref>
<ref id="B28"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Katakis</surname> <given-names>I.</given-names></name> <name><surname>Tsoumakas</surname> <given-names>G.</given-names></name> <name><surname>Vlahavas</surname> <given-names>I.</given-names></name></person-group> (<year>2010</year>). <article-title>Tracking recurring contexts using ensemble classifiers: an application to email filtering.</article-title> <source><italic>Knowl. Inf. Syst.</italic></source> <volume>22</volume> <fpage>371</fpage>&#x2013;<lpage>391</lpage>. <pub-id pub-id-type="doi">10.1007/s10115-009-0206-2</pub-id></citation></ref>
<ref id="B29"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kodovsk&#x00FD;</surname> <given-names>J.</given-names></name> <name><surname>Fridrich</surname> <given-names>J.</given-names></name> <name><surname>Holub</surname> <given-names>V.</given-names></name></person-group> (<year>2012</year>). <article-title>Ensemble classifiers for steganalysis of digital media.</article-title> <source><italic>IEEE Trans. Inf. Forensics Secur.</italic></source> <volume>7</volume> <fpage>432</fpage>&#x2013;<lpage>444</lpage>. <pub-id pub-id-type="doi">10.1109/TIFS.2011.2175919</pub-id></citation></ref>
<ref id="B30"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Koutanaei</surname> <given-names>F. N.</given-names></name> <name><surname>Sajedi</surname> <given-names>H.</given-names></name> <name><surname>Khanbabaei</surname> <given-names>M.</given-names></name></person-group> (<year>2015</year>). <article-title>A hybrid data mining model of feature selection algorithms and ensemble learning classifiers for credit scoring.</article-title> <source><italic>J. Retailing Consum. Serv.</italic></source> <volume>27</volume> <fpage>11</fpage>&#x2013;<lpage>23</lpage>. <pub-id pub-id-type="doi">10.1016/j.jretconser.2015.07.003</pub-id></citation></ref>
<ref id="B31"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Krogh</surname> <given-names>A.</given-names></name> <name><surname>Brown</surname> <given-names>M.</given-names></name> <name><surname>Mian</surname> <given-names>I. S.</given-names></name> <name><surname>Sjolander</surname> <given-names>K.</given-names></name> <name><surname>Haussler</surname> <given-names>D.</given-names></name></person-group> (<year>1994</year>). <article-title>Hidden markov models in computational biology: applications to protein modeling.</article-title> <source><italic>J. Mol. Biol.</italic></source> <volume>235</volume> <fpage>1501</fpage>&#x2013;<lpage>1531</lpage>. <pub-id pub-id-type="doi">10.1006/jmbi.1994.1104</pub-id> <pub-id pub-id-type="pmid">8107089</pub-id></citation></ref>
<ref id="B32"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kutepov</surname> <given-names>I. E.</given-names></name> <name><surname>Dobriyan</surname> <given-names>V. V.</given-names></name> <name><surname>Zhigalov</surname> <given-names>M. V.</given-names></name> <name><surname>StepanovAnton</surname> <given-names>M. F.</given-names></name> <name><surname>Krysko</surname> <given-names>A. V.</given-names></name> <name><surname>Yakovleva</surname> <given-names>T. V.</given-names></name><etal/></person-group> (<year>2020</year>). <article-title>EEG analysis in patients with schizophrenia based on Lyapunov exponents.</article-title> <source><italic>Inform. Med. Unlocked</italic></source> <volume>18</volume>:<issue>100289</issue>. <pub-id pub-id-type="doi">10.1016/j.imu.2020.100289</pub-id></citation></ref>
<ref id="B33"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kwak</surname> <given-names>N. S.</given-names></name> <name><surname>Lee</surname> <given-names>S. W.</given-names></name></person-group> (<year>2020</year>). <article-title>Error correction regression framework for enhancing the decoding accuracies of ear-EEG brain-computer interfaces.</article-title> <source><italic>IEEE Trans. Cybern.</italic></source> <volume>50</volume> <fpage>3654</fpage>&#x2013;<lpage>3667</lpage>. <pub-id pub-id-type="doi">10.1109/TCYB.2019.2924237</pub-id> <pub-id pub-id-type="pmid">31295141</pub-id></citation></ref>
<ref id="B34"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lee</surname> <given-names>D. H.</given-names></name> <name><surname>Jeong</surname> <given-names>J. H.</given-names></name> <name><surname>Kim</surname> <given-names>K. D.</given-names></name> <name><surname>Yu</surname> <given-names>B. W.</given-names></name> <name><surname>Lee</surname> <given-names>S. W.</given-names></name></person-group> (<year>2020a</year>). <article-title>Continuous EEG decoding of pilots&#x2019; mental states using multiple feature block-based convolutional neural network.</article-title> <source><italic>IEEE Access</italic></source> <volume>8</volume> <fpage>121929</fpage>&#x2013;<lpage>121941</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2020.3006907</pub-id></citation></ref>
<ref id="B35"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lee</surname> <given-names>M.</given-names></name> <name><surname>Shin</surname> <given-names>G.-H.</given-names></name> <name><surname>Lee</surname> <given-names>S. W.</given-names></name></person-group> (<year>2020c</year>). <article-title>Frontal EEG asymmetry of emotion for the same auditory stimulus.</article-title> <source><italic>IEEE Access</italic></source> <volume>12</volume> <fpage>107200</fpage>&#x2013;<lpage>107213</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2020.3000788</pub-id> <pub-id pub-id-type="pmid">24642416</pub-id></citation></ref>
<ref id="B36"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lee</surname> <given-names>M.</given-names></name> <name><surname>Yoon</surname> <given-names>J.-G.</given-names></name> <name><surname>Lee</surname> <given-names>S.-W.</given-names></name></person-group> (<year>2020b</year>). <article-title>Predicting motor imagery performance from resting-state EEG using dynamic causal modeling.</article-title> <source><italic>Front. Hum. Neurosci.</italic></source> <volume>14</volume>:<issue>321</issue>. <pub-id pub-id-type="doi">10.3389/fnhum.2020.00321</pub-id> <pub-id pub-id-type="pmid">32903663</pub-id></citation></ref>
<ref id="B37"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lee</surname> <given-names>M.-H.</given-names></name> <name><surname>Kwon</surname> <given-names>O.-Y.</given-names></name> <name><surname>Kim</surname> <given-names>Y.-J.</given-names></name> <name><surname>Kim</surname> <given-names>H.-K.</given-names></name> <name><surname>Lee</surname> <given-names>Y.-E.</given-names></name> <name><surname>Williamson</surname> <given-names>J.</given-names></name><etal/></person-group> (<year>2019</year>). <article-title>EEG Dataset and OpenBMI Toolbox for three BCI paradigms: an investigation into BCI illiteracy.</article-title> <source><italic>GigaScience</italic></source> <volume>8</volume> <fpage>1</fpage>&#x2013;<lpage>16</lpage>. <pub-id pub-id-type="doi">10.1093/gigascience/giz002</pub-id> <pub-id pub-id-type="pmid">30698704</pub-id></citation></ref>
<ref id="B38"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lin</surname> <given-names>D.</given-names></name> <name><surname>Lu</surname> <given-names>X.</given-names></name> <name><surname>Pu</surname> <given-names>F.</given-names></name></person-group> (<year>2015</year>). <article-title>Bayesian information criterion based feature filtering for the fusion of multiple features in high-spatial-resolution satellite scene classification.</article-title> <source><italic>J. Sens.</italic></source> <volume>2015</volume>:<issue>10</issue>. <pub-id pub-id-type="doi">10.1155/2015/142612</pub-id></citation></ref>
<ref id="B39"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mahato</surname> <given-names>S.</given-names></name> <name><surname>Pathak</surname> <given-names>L. K.</given-names></name> <name><surname>Kumari</surname> <given-names>K.</given-names></name></person-group> (<year>2021</year>). <source><italic>Detection of Schizophrenia Using EEG signals, Data Analytics in Bioinformatics: A Machine Learning Perspective.</italic></source> <publisher-loc>Beverly, MA</publisher-loc>: <publisher-name>Scrivener Publishing LLC</publisher-name>. <fpage>359</fpage>&#x2013;<lpage>390</lpage>. <pub-id pub-id-type="doi">10.1002/9781119785620.ch15</pub-id></citation></ref>
<ref id="B40"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Marshall</surname> <given-names>D.</given-names></name> <name><surname>Coyle</surname> <given-names>D.</given-names></name> <name><surname>Wilson</surname> <given-names>S.</given-names></name> <name><surname>Callaghan</surname> <given-names>M.</given-names></name></person-group> (<year>2013</year>). <article-title>Games, gameplay, and BCI: the state of the art.</article-title> <source><italic>IEEE Trans. Comput. Intell. AI Games</italic></source> <volume>5</volume> <fpage>82</fpage>&#x2013;<lpage>99</lpage>. <pub-id pub-id-type="doi">10.1109/TCIAIG.2013.2263555</pub-id></citation></ref>
<ref id="B41"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Martinsson</surname> <given-names>G.</given-names></name></person-group> (<year>2012</year>). &#x201C;<article-title>Randomized methods for computing the singular value decomposition of very large matrices</article-title>,&#x201D; in <source><italic>Proceedings of the Workshop on Algorithms for Modern Massive Data Sets</italic></source>, (<publisher-loc>Boulder, CO</publisher-loc>: <publisher-name>The University of Colorado at Boulder</publisher-name>).</citation></ref>
<ref id="B42"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mclachlan</surname> <given-names>G.</given-names></name></person-group> (<year>2005</year>). <source><italic>Discriminant Analysis and Statistical Pattern Recognition.</italic></source> <publisher-loc>Hoboken, NJ</publisher-loc>: <publisher-name>John Wiley and Sons</publisher-name>.</citation></ref>
<ref id="B43"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>McLachlan</surname> <given-names>G.</given-names></name> <name><surname>Peel</surname> <given-names>D.</given-names></name></person-group> (<year>2000</year>). <source><italic>Finite Mixture Models, Willey Series in Probability and Statistics.</italic></source> <publisher-loc>New York, NY</publisher-loc>: <publisher-name>John Wiley and Sons</publisher-name>. <pub-id pub-id-type="doi">10.1002/0471721182</pub-id></citation></ref>
<ref id="B44"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Meignen</surname> <given-names>S.</given-names></name> <name><surname>Meignen</surname> <given-names>H.</given-names></name></person-group> (<year>2006</year>). <article-title>On the modeling of small sample distributions with generalized gaussian density in a maximum likelihood framework.</article-title> <source><italic>IEEE Trans. Image Process.</italic></source> <volume>15</volume> <fpage>1647</fpage>&#x2013;<lpage>1652</lpage>. <pub-id pub-id-type="doi">10.1109/TIP.2006.873455</pub-id> <pub-id pub-id-type="pmid">16764288</pub-id></citation></ref>
<ref id="B45"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mohamed</surname> <given-names>A. W.</given-names></name></person-group> (<year>2015</year>). <article-title>An improved differential evolution algorithm with triangular mutation for global numerical optimization.</article-title> <source><italic>Comput. Ind. Eng.</italic></source> <volume>85</volume> <fpage>359</fpage>&#x2013;<lpage>375</lpage>. <pub-id pub-id-type="doi">10.1016/j.cie.2015.04.012</pub-id></citation></ref>
<ref id="B46"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mufudza</surname> <given-names>C.</given-names></name> <name><surname>Erol</surname> <given-names>H.</given-names></name></person-group> (<year>2016</year>). <article-title>Poisson mixture regression models for heart disease prediction.</article-title> <source><italic>Comput. Math. Methods Med.</italic></source> <volume>2016</volume>:<issue>4083089</issue>. <pub-id pub-id-type="doi">10.1155/2016/4083089</pub-id> <pub-id pub-id-type="pmid">27999611</pub-id></citation></ref>
<ref id="B47"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Namazi</surname> <given-names>H.</given-names></name> <name><surname>Aghasian</surname> <given-names>E.</given-names></name> <name><surname>Ala</surname> <given-names>T. S.</given-names></name></person-group> (<year>2019</year>). <article-title>Fractal-based classification of electroencephalography (EEG) signals in healthy adolescents and adolescents with symptoms of schizophrenia.</article-title> <source><italic>Technol. Health Care</italic></source> <volume>27</volume> <fpage>233</fpage>&#x2013;<lpage>241</lpage>. <pub-id pub-id-type="doi">10.3233/THC-181497</pub-id> <pub-id pub-id-type="pmid">30829625</pub-id></citation></ref>
<ref id="B48"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Nicolaou</surname> <given-names>N.</given-names></name> <name><surname>Georgiou</surname> <given-names>J.</given-names></name></person-group> (<year>2012</year>). <article-title>Detection of epileptic electroencephalogram based on permutation entropy and support vector machines.</article-title> <source><italic>Expert Syst. App.</italic></source> <volume>39</volume> <fpage>202</fpage>&#x2013;<lpage>209</lpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2011.07.008</pub-id></citation></ref>
<ref id="B49"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Oh</surname> <given-names>S. L.</given-names></name> <name><surname>Vicnesh</surname> <given-names>J.</given-names></name> <name><surname>Ciaccio</surname> <given-names>E. J.</given-names></name> <name><surname>Yuvaraj</surname> <given-names>R.</given-names></name> <name><surname>Acharya</surname> <given-names>U. R.</given-names></name></person-group> (<year>2019</year>). <article-title>Deep convolutional neural network model for automated diagnosis of schizophrenia using eeg signals.</article-title> <source><italic>Appl. Sci.</italic></source> <volume>9</volume>:<issue>2870</issue>. <pub-id pub-id-type="doi">10.3390/app9142870</pub-id></citation></ref>
<ref id="B50"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Olejarczyk</surname> <given-names>E.</given-names></name> <name><surname>Jernajczyk</surname> <given-names>W.</given-names></name></person-group> (<year>2017</year>). <article-title>&#x201C;Graph-based analysis of brain connectivity in schizophrenia,&#x201D;.</article-title> <source><italic>PLoS One</italic></source> <volume>12</volume>:<issue>e0188629</issue>. <pub-id pub-id-type="doi">10.1371/journal.pone.0188629</pub-id> <pub-id pub-id-type="pmid">29190759</pub-id></citation></ref>
<ref id="B51"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pack</surname> <given-names>A. M.</given-names></name></person-group> (<year>2019</year>). <article-title>Epilepsy overview and revised classification of seizures and epilepsies.</article-title> <source><italic>Continuum (Minneap Minn.)</italic></source> <volume>25</volume> <fpage>306</fpage>&#x2013;<lpage>321</lpage>. <pub-id pub-id-type="doi">10.1212/CON.0000000000000707</pub-id> <pub-id pub-id-type="pmid">30921011</pub-id></citation></ref>
<ref id="B52"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pengyi</surname> <given-names>Y.</given-names></name> <name><surname>Wang</surname> <given-names>Y. H.</given-names></name> <name><surname>Zhou</surname> <given-names>B. B.</given-names></name> <name><surname>Zomaya</surname> <given-names>A. Y.</given-names></name></person-group> (<year>2010</year>). <article-title>A review of ensemble methods in bioinformatics.</article-title> <source><italic>Curr. Bioinformatics</italic></source> <volume>5</volume> <fpage>296</fpage>&#x2013;<lpage>308</lpage>. <pub-id pub-id-type="doi">10.2174/157489310794072508</pub-id></citation></ref>
<ref id="B53"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Prabhakar</surname> <given-names>S. K.</given-names></name> <name><surname>Lee</surname> <given-names>S.-W.</given-names></name></person-group> (<year>2020a</year>). <article-title>An integrated approach for ovarian cancer classification with the application of stochastic optimization.</article-title> <source><italic>IEEE Access</italic></source> <volume>8</volume> <fpage>127866</fpage>&#x2013;<lpage>127882</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2020.3006154</pub-id></citation></ref>
<ref id="B54"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Prabhakar</surname> <given-names>S. K.</given-names></name> <name><surname>Lee</surname> <given-names>S.-W.</given-names></name></person-group> (<year>2020b</year>). <article-title>Transformation based tri-level feature selection approach using wavelets and swarm computing for prostate cancer classification.</article-title> <source><italic>IEEE Access</italic></source> <volume>8</volume> <fpage>127866</fpage>&#x2013;<lpage>127882</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2020.3006197</pub-id></citation></ref>
<ref id="B55"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Prabhakar</surname> <given-names>S. K.</given-names></name> <name><surname>Rajaguru</surname> <given-names>H.</given-names></name> <name><surname>Kim</surname> <given-names>S.-H.</given-names></name></person-group> (<year>2020b</year>). <article-title>Schizophrenia EEG signal classification based on swarm intelligence computing.</article-title> <source><italic>Comput. Intell. Neurosci.</italic></source> <volume>14</volume>:<issue>2020</issue>. <pub-id pub-id-type="doi">10.1155/2020/8853835</pub-id> <pub-id pub-id-type="pmid">33335544</pub-id></citation></ref>
<ref id="B56"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Prabhakar</surname> <given-names>S. K.</given-names></name> <name><surname>Rajaguru</surname> <given-names>H.</given-names></name> <name><surname>Lee</surname> <given-names>S.</given-names></name></person-group> (<year>2020a</year>). <article-title>A Framework for schizophrenia EEG signal classification with nature inspired optimization algorithms.</article-title> <source><italic>IEEE Access</italic></source> <volume>8</volume> <fpage>39875</fpage>&#x2013;<lpage>39897</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2020.2975848</pub-id></citation></ref>
<ref id="B57"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Prabhakar</surname> <given-names>S. K.</given-names></name> <name><surname>Rajaguru</surname> <given-names>H.</given-names></name> <name><surname>Lee</surname> <given-names>S.-W.</given-names></name></person-group> (<year>2019</year>). <article-title>Metaheuristic based dimensionality reduction and classification analysis of PPG signals for interpreting cardiovascular disease.</article-title> <source><italic>IEEE Access</italic></source> <volume>7</volume> <fpage>165181</fpage>&#x2013;<lpage>165206</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2019.2950220</pub-id></citation></ref>
<ref id="B58"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Raghu</surname> <given-names>S.</given-names></name> <name><surname>Sriraam</surname> <given-names>N.</given-names></name> <name><surname>Hegde</surname> <given-names>A. S.</given-names></name> <name><surname>Kubben</surname> <given-names>P. L.</given-names></name></person-group> (<year>2019</year>). <article-title>A novel approach for classification of epileptic seizures using matrix determinant.</article-title> <source><italic>Expert Syst. App.</italic></source> <volume>127</volume> <fpage>323</fpage>&#x2013;<lpage>341</lpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2019.03.021</pub-id></citation></ref>
<ref id="B59"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Riaz</surname> <given-names>F.</given-names></name> <name><surname>Hassan</surname> <given-names>A.</given-names></name> <name><surname>Rehman</surname> <given-names>S.</given-names></name> <name><surname>Niazi</surname> <given-names>I. K.</given-names></name> <name><surname>Dremstrup</surname> <given-names>K.</given-names></name></person-group> (<year>2016</year>). <article-title>EMD Based temporal and spectral features for the classification of EEG signals using supervised learning.</article-title> <source><italic>IEEE Trans. Neural Syst. Rehabil. Eng.</italic></source> <volume>24</volume> <fpage>28</fpage>&#x2013;<lpage>35</lpage>. <pub-id pub-id-type="doi">10.1109/TNSRE.2015.2441835</pub-id> <pub-id pub-id-type="pmid">26068546</pub-id></citation></ref>
<ref id="B60"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Samiee</surname> <given-names>K.</given-names></name> <name><surname>Kovacs</surname> <given-names>P.</given-names></name> <name><surname>Gabbouj</surname> <given-names>P.</given-names></name></person-group> (<year>2015</year>). <article-title>Epileptic seizure classification of EEG time-series using rational discrete short-time fourier transform.</article-title> <source><italic>IEEE Trans. Biomed. Eng.</italic></source> <volume>62</volume> <fpage>541</fpage>&#x2013;<lpage>552</lpage>. <pub-id pub-id-type="doi">10.1109/TBME.2014.2360101</pub-id> <pub-id pub-id-type="pmid">25265603</pub-id></citation></ref>
<ref id="B61"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Scrucca</surname> <given-names>L.</given-names></name> <name><surname>Fop</surname> <given-names>M.</given-names></name> <name><surname>Murphy</surname> <given-names>T. B.</given-names></name> <name><surname>Raftery</surname> <given-names>A. E.</given-names></name></person-group> (<year>2017</year>). <article-title>Mclust 5: clustering, classification and density estimation using Gaussian finite mixture models.</article-title> <source><italic>R J.</italic></source> <volume>8</volume> <fpage>205</fpage>&#x2013;<lpage>233</lpage>. <pub-id pub-id-type="doi">10.32614/RJ-2016-021</pub-id> <pub-id pub-id-type="pmid">27818791</pub-id></citation></ref>
<ref id="B62"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sharma</surname> <given-names>M.</given-names></name> <name><surname>Bhurane</surname> <given-names>A. A.</given-names></name> <name><surname>Acharya</surname> <given-names>U. R.</given-names></name></person-group> (<year>2018</year>). <article-title>MMSFL-OWFB: a novel class of orthogonal wavelet filters for epileptic seizure detection.</article-title> <source><italic>Knowl. Based Syst.</italic></source> <volume>160</volume> <fpage>265</fpage>&#x2013;<lpage>277</lpage>. <pub-id pub-id-type="doi">10.1016/j.knosys.2018.07.019</pub-id></citation></ref>
<ref id="B63"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sharma</surname> <given-names>M.</given-names></name> <name><surname>Pachori</surname> <given-names>R. B.</given-names></name> <name><surname>Acharya</surname> <given-names>U. R.</given-names></name></person-group> (<year>2017</year>). <article-title>A new approach to characterize epileptic seizures using analytic time-frequency flexible wavelet transform and fractal dimension.</article-title> <source><italic>Pattern Recognit. Lett.</italic></source> <volume>94</volume> <fpage>172</fpage>&#x2013;<lpage>179</lpage>. <pub-id pub-id-type="doi">10.1016/j.patrec.2017.03.023</pub-id></citation></ref>
<ref id="B64"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sharmila</surname> <given-names>A.</given-names></name> <name><surname>Geethanjali</surname> <given-names>P.</given-names></name></person-group> (<year>2019</year>). <article-title>A review on the pattern detection methods for epilepsy seizure detection from EEG signals.</article-title> <source><italic>Biomed. Tech. (Berl)</italic></source> <volume>64</volume> <fpage>507</fpage>&#x2013;<lpage>517</lpage>. <pub-id pub-id-type="doi">10.1515/bmt-2017-0233</pub-id> <pub-id pub-id-type="pmid">31026222</pub-id></citation></ref>
<ref id="B65"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Shen</surname> <given-names>H.-B.</given-names></name> <name><surname>Chou</surname> <given-names>K.-C.</given-names></name></person-group> (<year>2006</year>). <article-title>Ensemble classifier for protein fold pattern recognition.</article-title> <source><italic>Bioinformatics</italic></source> <volume>22</volume> <fpage>1717</fpage>&#x2013;<lpage>1722</lpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btl170</pub-id> <pub-id pub-id-type="pmid">16672258</pub-id></citation></ref>
<ref id="B66"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Shoeibi</surname> <given-names>A.</given-names></name> <name><surname>Ghassemi</surname> <given-names>N.</given-names></name> <name><surname>Khodatars</surname> <given-names>M.</given-names></name> <name><surname>Jafari</surname> <given-names>M.</given-names></name> <name><surname>Hussain</surname> <given-names>S.</given-names></name> <name><surname>Alizadehsani</surname> <given-names>R.</given-names></name><etal/></person-group> (<year>2020</year>). <article-title>Application of deep learning techniques for automated detection of epileptic seizures: a review.</article-title> <source><italic>bioRixv [Preprint]</italic></source> <comment>arXiv:2007.01276v2 [cs.LG]</comment>,</citation></ref>
<ref id="B67"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Siddiqui</surname> <given-names>M. K.</given-names></name> <name><surname>Menendez</surname> <given-names>R. M.</given-names></name> <name><surname>Huang</surname> <given-names>X.</given-names></name> <name><surname>Hussain</surname> <given-names>N.</given-names></name></person-group> (<year>2020</year>). <article-title>A review of epileptic seizure detection using machine learning classifiers.</article-title> <source><italic>Brain Inform.</italic></source> <volume>7</volume>:<issue>5</issue>. <pub-id pub-id-type="doi">10.1186/s40708-020-00105-1</pub-id> <pub-id pub-id-type="pmid">32451639</pub-id></citation></ref>
<ref id="B68"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Singh</surname> <given-names>K.</given-names></name> <name><surname>Singh</surname> <given-names>S.</given-names></name> <name><surname>Malhotra</surname> <given-names>J.</given-names></name></person-group> (<year>2021</year>). <article-title>Spectral features based convolutional neural network for accurate and prompt identification of schizophrenic patients.</article-title> <source><italic>Proc. Inst. Mech. Eng. H</italic></source> <volume>235</volume> <fpage>167</fpage>&#x2013;<lpage>184</lpage>. <pub-id pub-id-type="doi">10.1177/0954411920966937</pub-id> <pub-id pub-id-type="pmid">33124526</pub-id></citation></ref>
<ref id="B69"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Siuly</surname> <given-names>S.</given-names></name> <name><surname>Khare</surname> <given-names>S. K.</given-names></name> <name><surname>Bajaj</surname> <given-names>V.</given-names></name> <name><surname>Wang</surname> <given-names>H.</given-names></name> <name><surname>Zhang</surname> <given-names>Y.</given-names></name></person-group> (<year>2020</year>). <article-title>A Computerized method for automatic detection of schizophrenia using EEG signals.</article-title> <source><italic>IEEE Trans. Neural Syst. Rehabil. Eng.</italic></source> <volume>28</volume> <fpage>2390</fpage>&#x2013;<lpage>2400</lpage>. <pub-id pub-id-type="doi">10.1109/TNSRE.2020.3022715</pub-id> <pub-id pub-id-type="pmid">32897863</pub-id></citation></ref>
<ref id="B70"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Suk</surname> <given-names>H.-I.</given-names></name> <name><surname>Wee</surname> <given-names>C.-Y.</given-names></name> <name><surname>Lee</surname> <given-names>S.-W.</given-names></name> <name><surname>Shen</surname> <given-names>D.</given-names></name></person-group> (<year>2015</year>). <article-title>Supervised discriminative group sparse representation for mild cognitive impairment diagnosis.</article-title> <source><italic>Neuroinformatics</italic></source> <volume>13</volume> <fpage>277</fpage>&#x2013;<lpage>295</lpage>. <pub-id pub-id-type="doi">10.1007/s12021-014-9241-6</pub-id> <pub-id pub-id-type="pmid">25501275</pub-id></citation></ref>
<ref id="B71"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Suk</surname> <given-names>H.-I.</given-names></name> <name><surname>Wee</surname> <given-names>C.-Y.</given-names></name> <name><surname>Lee</surname> <given-names>S.-W.</given-names></name> <name><surname>Shen</surname> <given-names>D.</given-names></name></person-group> (<year>2016</year>). <article-title>State-Space model with deep learning for functional dynamicsestimation in resting-state fMRI.</article-title> <source><italic>NeuroImage</italic></source> <volume>129</volume> <fpage>292</fpage>&#x2013;<lpage>307</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuroimage.2016.01.005</pub-id> <pub-id pub-id-type="pmid">26774612</pub-id></citation></ref>
<ref id="B72"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sun</surname> <given-names>J.</given-names></name> <name><surname>Cao</surname> <given-names>R.</given-names></name> <name><surname>Zhou</surname> <given-names>M.</given-names></name> <name><surname>Hussain</surname> <given-names>W.</given-names></name> <name><surname>Wang</surname> <given-names>B.</given-names></name> <name><surname>Xue</surname> <given-names>J.</given-names></name><etal/></person-group> (<year>2021</year>). <article-title>A hybrid deep neural network for classification of schizophrenia using EEG Data.</article-title> <source><italic>Sci. Rep.</italic></source> <volume>11</volume>:<issue>4706</issue>. <pub-id pub-id-type="doi">10.1038/s41598-021-83350-6</pub-id> <pub-id pub-id-type="pmid">33633134</pub-id></citation></ref>
<ref id="B73"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Taslim</surname> <given-names>C.</given-names></name> <name><surname>Lin</surname> <given-names>S.</given-names></name></person-group> (<year>2014</year>). <article-title>A Mixture modelling framework for differential analysis of high-throughput data.</article-title> <source><italic>Adv. Stat. Med.</italic></source> <volume>2014</volume>:<issue>758718</issue>. <pub-id pub-id-type="doi">10.1155/2014/758718</pub-id> <pub-id pub-id-type="pmid">25057284</pub-id></citation></ref>
<ref id="B74"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tharmaratnam</surname> <given-names>K.</given-names></name> <name><surname>Claeskens</surname> <given-names>G.</given-names></name></person-group> (<year>2013</year>). <article-title>A comparison of robust versions of the AIC based on M-, S- and MM-estimators.</article-title> <source><italic>Statistics</italic></source> <volume>47</volume> <fpage>216</fpage>&#x2013;<lpage>235</lpage>. <pub-id pub-id-type="doi">10.1080/02331888.2011.568120</pub-id></citation></ref>
<ref id="B75"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tian</surname> <given-names>H. X.</given-names></name> <name><surname>Mao</surname> <given-names>Z. Z.</given-names></name></person-group> (<year>2010</year>). <article-title>An ensemble ELM based on modified adaboost.RT algorithm for predicting the temperature of molten steel in ladle furnace.</article-title> <source><italic>IEEE Trans. Autom. Sci. Eng.</italic></source> <volume>7</volume> <fpage>73</fpage>&#x2013;<lpage>80</lpage>. <pub-id pub-id-type="doi">10.1109/TASE.2008.2005640</pub-id></citation></ref>
<ref id="B76"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ueda</surname> <given-names>N.</given-names></name> <name><surname>Nakano</surname> <given-names>R.</given-names></name> <name><surname>Ghahramani</surname> <given-names>Z.</given-names></name> <name><surname>Hinton</surname> <given-names>G. E.</given-names></name></person-group> (<year>2000</year>). <article-title>SMEM algorithm for mixture models.</article-title> <source><italic>Neural Comput.</italic></source> <volume>12</volume> <fpage>2109</fpage>&#x2013;<lpage>2128</lpage>. <pub-id pub-id-type="doi">10.1162/089976600300015088</pub-id> <pub-id pub-id-type="pmid">10976141</pub-id></citation></ref>
<ref id="B77"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>K.</given-names></name> <name><surname>Yau</surname> <given-names>K. K. W.</given-names></name> <name><surname>Lee</surname> <given-names>A. H.</given-names></name></person-group> (<year>2002</year>). <article-title>A hierarchical poisson mixture regression model to analyse maternity length of hospital stay.</article-title> <source><italic>Stat. Med.</italic></source> <volume>21</volume> <fpage>3639</fpage>&#x2013;<lpage>3654</lpage>. <pub-id pub-id-type="doi">10.1002/sim.1307</pub-id> <pub-id pub-id-type="pmid">12436461</pub-id></citation></ref>
<ref id="B78"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>K.</given-names></name> <name><surname>Yau</surname> <given-names>K. K. W.</given-names></name> <name><surname>Lee</surname> <given-names>A. H.</given-names></name> <name><surname>McLachlan</surname> <given-names>G. J.</given-names></name></person-group> (<year>2007</year>). <article-title>Two-component poisson mixture regression modelling of count data with bivariate random effects.</article-title> <source><italic>Math. Comput. Model.</italic></source> <volume>46</volume> <fpage>1468</fpage>&#x2013;<lpage>1476</lpage>. <pub-id pub-id-type="doi">10.1016/j.mcm.2007.02.003</pub-id></citation></ref>
<ref id="B79"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>P.</given-names></name> <name><surname>Puterman</surname> <given-names>M. L.</given-names></name> <name><surname>Cockburn</surname> <given-names>I.</given-names></name> <name><surname>Le</surname> <given-names>N.</given-names></name></person-group> (<year>1996</year>). <article-title>Mixed poisson regression models with covariate dependent rates.</article-title> <source><italic>Biometrics</italic></source> <volume>52</volume> <fpage>381</fpage>&#x2013;<lpage>400</lpage>. <pub-id pub-id-type="pmid">10766499</pub-id></citation></ref>
<ref id="B80"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>S. H.</given-names></name> <name><surname>Li</surname> <given-names>H. F.</given-names></name> <name><surname>Zhang</surname> <given-names>Y. J.</given-names></name> <name><surname>Zou</surname> <given-names>Z. S.</given-names></name></person-group> (<year>2019</year>). <article-title>A hybrid ensemble model based on ELM and improved adaboost.RT algorithm for predicting the iron ore sintering characters.</article-title> <source><italic>Comput. Intell. Neurosci.</italic></source> <volume>2019</volume>:<issue>11</issue>. <pub-id pub-id-type="doi">10.1155/2019/4164296</pub-id> <pub-id pub-id-type="pmid">30800158</pub-id></citation></ref>
<ref id="B81"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yang</surname> <given-names>X.-S.</given-names></name></person-group> (<year>2014</year>). <source><italic>Nature-Inspired Optimization Algorithms</italic></source>, <edition>1st Edn</edition>. <pub-id pub-id-type="doi">10.1016/B978-0-12-416743-8.00001-4</pub-id></citation></ref>
</ref-list>
</back>
</article>
