<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">30790</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2023.030790</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>RBEBT: A ResNet-Based BA-ELM for Brain Tumor Classification</article-title>
<alt-title alt-title-type="left-running-head">RBEBT: A ResNet-Based BA-ELM for Brain Tumor Classification</alt-title>
<alt-title alt-title-type="right-running-head">RBEBT: A ResNet-Based BA-ELM for Brain Tumor Classification</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Zhu</surname><given-names>Ziquan</given-names>
</name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Khan</surname><given-names>Muhammad Attique</given-names>
</name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Wang</surname><given-names>Shui-Hua</given-names>
</name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-4" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Zhang</surname><given-names>Yu-Dong</given-names>
</name><xref ref-type="aff" rid="aff-1">1</xref><email>yudongzhang@ieee.org</email></contrib>
<aff id="aff-1"><label>1</label><institution>University of Leicester</institution>, <addr-line>Leicester, LE1 7RH</addr-line>, <country>UK</country></aff>
<aff id="aff-2"><label>2</label><institution>HITEC University Taxila</institution>, <addr-line>Taxila, 47080</addr-line>, <country>Pakistan</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Yu-Dong Zhang. Email: <email>yudongzhang@ieee.org</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-08-16"><day>16</day>
<month>08</month>
<year>2022</year></pub-date>
<volume>74</volume>
<issue>1</issue>
<fpage>101</fpage>
<lpage>111</lpage>
<history>
<date date-type="received">
<day>01</day>
<month>4</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>20</day>
<month>5</month>
<year>2022</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Zhu et al.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Zhu et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_30790.pdf"></self-uri>
<abstract>
<p>Brain tumor refers to the formation of abnormal cells in the brain. It can be divided into benign and malignant. The main diagnostic methods for brain tumors are plain X-ray film, Magnetic resonance imaging (MRI), and so on. However, these artificial diagnosis methods are easily affected by external factors. Scholars have made such impressive progress in brain tumors classification by using convolutional neural network (CNN). However, there are still some problems: (i) There are many parameters in CNN, which require much calculation. (ii) The brain tumor data sets are relatively small, which may lead to the overfitting problem in CNN. In this paper, our team proposes a novel model (RBEBT) for the automatic classification of brain tumors. We use fine-tuned ResNet18 to extract the features of brain tumor images. The RBEBT is different from the traditional CNN models in that the randomized neural network (RNN) is selected as the classifier. Meanwhile, our team selects the bat algorithm (BA) to optimize the parameters of RNN. We use five-fold cross-validation to verify the superiority of the RBEBT. The accuracy (ACC), specificity (SPE), precision (PRE), sensitivity (SEN), and F1-score (F1) are 99.00%, 95.00%, 99.00%, 100.00%, and 100.00%. The classification performance of the RBEBT is greater than 95%, which can prove that the RBEBT is an effective model to classify brain tumors.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Brain tumor</kwd>
<kwd>randomized neural network</kwd>
<kwd>bat algorithm</kwd>
<kwd>ResNet</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Brain tumor refers to the formation of abnormal cells in the brain. It can be divided into benign and malignant. The cause of the brain tumor is not clear. The etiological investigation can be divided into environmental factors and host factors. At present, the main diagnostic methods of brain tumors are plain X-ray film, Magnetic resonance imaging (MRI), and so on. However, these artificial diagnosis methods are easily affected by external factors, such as fatigue, emotion, and so on. At the same time, the early symptoms of brain tumors are not obvious and are easy to be ignored. Now more and more researchers try to use the artificial intelligence to diagnose brain tumors.</p>
<p>Rehman&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-1">1</xref>] designed a new deep learning method for the classification of brain tumors. Firstly, a 3D convolutional neural network (CNN) was proposed to extract the features. Then, these features were passed to the feed-forward neural network for classification. The new deep learning method got 98.32%, 96.97%, and 92.67% accuracy on the 2015, 2017, and 2018 BraTS datasets, respectively. Deepak&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-2">2</xref>] proposed a new combination that was based on the CNN and support vector machine (SVM). They used CNN to extract features, and the SVM was used for the classification. Finally, they obtained 95.82% accuracy. Mzoughi&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-3">3</xref>] explored a 3D CNN to classify the brain tumor. The intensity normalization and adaptive contrast enhancement were used to deal with the data heterogeneity. The final accuracy was 96.49%. Kesav&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-4">4</xref>] proposed a novel RCNN method for the classification of brain tumors. In the proposed method, there were two channels to classify the brain tumors. Srinivas&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-5">5</xref>] designed a new model (CNN-KNN) to classify brain tumors. KNN used the features which were extracted by CNN for classification. They got 96.25% accuracy on the test set. Belaid&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-6">6</xref>] used the pre-trained CNN model (VGG-16) to classify brain tumors and got 96.5% accuracy. Sarkar&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-7">7</xref>] proposed a 2D CNN to detect brain tumors based on MRI. The 2D CNN method achieved 91.3% accuracy. Agarwal&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-8">8</xref>] classified the brain MRI images based on the pre-trained VGG16. They got 90% test accuracy. Sal&#x00E7;in [<xref ref-type="bibr" rid="ref-9">9</xref>] utilized the faster R-CNN to classify and detect brain tumors. The faster R-CNN could achieve 91.66% accuracy. Hossain&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-10">10</xref>] used a Fuzzy C-Means clustering algorithm to extract features. There were six classifiers used in this method. Finally, the CNN was implemented to improve the performance. The accuracy was 97.87% based on this method. Hemanth&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-11">11</xref>] proposed the BPNN for the segmentation of brain tumors images. Nayef&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-12">12</xref>] introduced a new method (LVQNN) to classify brain tumors. Chen&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-13">13</xref>] proposed the LRC to classify brain tumors. Zhang,&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-14">14</xref>] proposed a new model to deal with the accurate interaction of soft tissue. The new model was based on the BP neural network. Sun&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-15">15</xref>] introduced the fine-tuned VTC which was based on the light CNN with feature optimization. Xiao&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-16">16</xref>] proposed the novel model (TReC) to detect brain diseases on MRI. The TReC was based on ResNet and Convolutional block attention module.</p>
<p>Above reviewing the aforementioned research, scholars have done much impressive progress in brain tumors classification. However, there are several problems: (i) There are many parameters in CNN, which require much calculation. (ii) The brain tumor data sets are relatively small, which may lead to the overfitting problem in CNN.</p>
<p>Our team proposes a novel model (RBEBT) for the automatic classification of brain tumors to solve these above problems. We want to propose a model which can achieve great classification performance in small brain tumors data set. The main contributions of this paper are summarized as: (i) Our team proposes a new model that can accurately classify brain tumors. (ii) A new classifier is proposed to classify the brain tumor faster and more accurately than the traditional CNNs. (iii) The proposed novel model has superior classification to state-of-the-art methods.</p>
<p>The rest structure of this paper is as follows: We introduce the public brain tumor data set in Section 2. The details of the proposed model are presented in Section 3. Several experiments, results, and the corresponding discussions are shown in Section 4. Section 5 is mainly about the conclusion.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Materials</title>
<p>We obtain the brain tumor images from the public data set on the Harvard Medical School website (<uri xlink:href="https://www.med.harvard.edu/aanlib">https://www.med.harvard.edu/aanlib</uri>.). There are five types on this website: normal brain, cerebrovascular disease, neoplastic disease, degenerative disease, and infectious disease. In this paper, our team classifies this public data set into two categories: the normal brain and the abnormal brain. Some images of this public data set are presented in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Samples in the public brain tumor data set</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_30790-fig-1.png"/>
</fig>
</sec>
<sec id="s3">
<label>3</label>
<title>Methodology</title>
<sec id="s3_1">
<label>3.1</label>
<title>Proposed RBEBT</title>
<p>For image recognition and classification, extracting key features from images is one of the most important steps. Before, people tried to extract features from images by hand, but manually extracting features needs a lot of time and energy, and the results were not very satisfactory. The continuous development of machine learning in computers [<xref ref-type="bibr" rid="ref-17">17</xref>] has been applied to image classification and achieved great success. A sea number of CNN models have been proposed, such as AlexNet, VGG, MobileNet, ResNet, and so on. Scholars use these CNN models to classify and segment brain tumors. Nevertheless, there are some problems: (i) These proposed CNN models are generally tested on large data sets. However, brain tumors&#x2019; data sets are relatively small, which can lead to overfitting problems. (II) CNN model contains many layers and parameters, so it may take a long time to complete the training. Our team proposes a novel model (RBEBT) to deal with these problems as mentioned above. The pipeline of the proposed model is shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>The pipeline of the proposed model</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_30790-fig-2.png"/>
</fig>
<p>In the RBEBT, we use fine-tuned ResNet18 to extract the features of brain tumor images. The RBEBT is different from the traditional CNN models in that the randomized neural network (RNN) is selected as the classifier. The training time of RNN is shorter than that of the CNN models because of the simpler structure of RNN. What&#x2019;s more, it is not easy to produce overfitting problems on small data sets in RNN. However, it may also cause some other problems because the parameters in the RNN are random, such as redundant nodes. We use the bat algorithm (BA) to optimize it to get the ideal parameters. The five-fold cross-validation is chosen to verify the superiority of the RBEBT.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Backbone of the Proposed RBEBT</title>
<p>Scholars hope that the increasing number of layers in the CNN models could improve the performance. However, the increase in the number of layers leads to the problem of gradient explosion. Many methods have been proposed to alleviate such problems, such as batch normalization (BN). However, gradient degradation has not been well solved. He&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-18">18</xref>] coped with the gradient degradation problem by the residual connection, as shown in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>. The formula of the residual connection is as follows:</p>
<p><disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mi>R</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>T</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>x</mml:mi></mml:math></disp-formula>where <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mi>x</mml:mi></mml:math></inline-formula> is the input, <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mi>T</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the learned feature, and <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mi>R</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is learned from the residual connection. The conversion of the above formula is shown as:</p>
<p><disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mi>T</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>R</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mi>x</mml:mi></mml:math></disp-formula></p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>The structure of the residual connection</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_30790-fig-3.png"/>
</fig>
<p>The data set in this paper is classified into two categories, but the output nodes of the pre-trained ResNet18 are 1000. In this paper, our team classifies this public data set into two categories. Therefore, we fine-tune the ResNet18, as given in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. Fully connected and batch normalization are abbreviated as FC and BN, respectively. Then, we replace the last five layers of fine-tuned ResNet18 (ReLU, BN, FC2, Softmax, and Classification layer) with the RNN.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>The fine-tuned ResNet18</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_30790-fig-4.png"/>
</fig>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Classifier Optimization</title>
<p>This paper chooses the RNN as the classifier. The advantages of RNN are to shorten the training time and avoid the overfitting problem. RNN used in this paper is the extreme learning machine (ELM). The structure of ELM is presented in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>The structure of extreme learning machine (ELM)</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_30790-fig-5.png"/>
</fig>
<p>Given a data set with the <italic>i</italic>-th sample as (<inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msub><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>), the calculation steps of ELM are as follows:</p>
<p><disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mtext>R</mml:mtext></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi><mml:mo>,</mml:mo></mml:math></disp-formula></p>
<p><disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:msub><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mtext>R</mml:mtext></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mi>n</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mi>m</mml:mi></mml:math></inline-formula> represents the input and output dimension, respectively.</p>
<p>The formula of the output matrix of the hidden layer is shown as:</p>
<p><disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:msub><mml:mrow><mml:mi mathvariant="bold">Q</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold">E</mml:mi><mml:mi mathvariant="bold">L</mml:mi><mml:mi mathvariant="bold">M</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msubsup><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi><mml:mo>.</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mi>r</mml:mi></mml:math></inline-formula> is the number of hidden nodes, the weight vector is given as <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:msub><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, the bias of the j-th hidden node is <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, and <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mi>f</mml:mi></mml:math></inline-formula> is the sigmoid function.</p>
<p>The calculation of final output weight (<inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mrow><mml:mi mathvariant="bold">v</mml:mi></mml:mrow></mml:math></inline-formula>) is as follows:</p>
<p><disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:mi mathvariant="bold">v</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mi mathvariant="bold">Q</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold">E</mml:mi><mml:mi mathvariant="bold">L</mml:mi><mml:mi mathvariant="bold">M</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mo>+</mml:mo></mml:mrow></mml:msubsup><mml:mrow><mml:mi mathvariant="bold">Y</mml:mi></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula></p>
<p>However, the parameters assigned at random may not be the optimal solution. Our team selects the bat algorithm (BA) to optimize it. Suppose the velocity of the <italic>u</italic>-th bat is <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:msubsup><mml:mi>l</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and the position is <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:msubsup><mml:mi>p</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> at the time <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>t</mml:mi></mml:math></inline-formula>.</p>
<p><disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mi>&#x03B1;</mml:mi></mml:math></disp-formula></p>
<p><disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:msubsup><mml:mi>l</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>l</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>p</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p><disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:msubsup><mml:mi>p</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>p</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mi>l</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup></mml:math></disp-formula>where <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula>, and <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, are the maximum, minimum, and current frequency, respectively, <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x2208;</mml:mo><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:math></inline-formula> is randomized, <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow></mml:msub></mml:math></inline-formula> is the best position at present.</p>
<p>The optimal position will be updated as:</p>
<p><disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mrow><mml:mtext>new</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mrow><mml:mtext>old</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:msup><mml:mi>s</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup></mml:math></disp-formula>where <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mi>&#x03B2;</mml:mi><mml:mo>&#x2208;</mml:mo><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:math></inline-formula> is randomized, the loudness is <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:msup><mml:mi>s</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>.</p>
<p>The emission rate and loudness will be generated when the <italic>u</italic>-th bat gets the prey:</p>
<p><disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mn>0.9</mml:mn><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup></mml:math></disp-formula></p>
<p><disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:msubsup><mml:mi>h</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>h</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mrow><mml:mtext>e</mml:mtext></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>0.99</mml:mn><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Evaluation</title>
<p>Five-fold cross-validation is chosen to verify the superiority of the RBEBT. In this paper, the abnormal brain and the normal brain are defined as the positive and the negative, respectively. Five indexes are selected in this paper, which are accuracy (ACC), specificity (SPE), precision (PRE), sensitivity (SEN), and F1-score (F1). Their equations are shown as below:</p>
<p><disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:mrow><mml:mtext>ACC</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>TP</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>TN</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext>TP</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>TN</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>FP</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>FN</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>SPE</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mtext>TN</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>TN</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>FP</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>PRE</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mtext>TP</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>TP</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>FP</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>SEN</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mtext>TP</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>TP</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>FN</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mtext>F</mml:mtext></mml:mrow><mml:mn>1</mml:mn><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mtext>TP</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mrow><mml:mtext>TP</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>FP</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>FN</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:mstyle></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula></p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Results and Discussion</title>
<sec id="s4_1">
<label>4.1</label>
<title>The Classification Performance of the RBEBT</title>
<p>The five-fold cross-validation is chosen to verify the superiority of the RBEBT, as shown in <xref ref-type="table" rid="table-1">Tab. 1</xref>. Average and standard deviation are abbreviated as Avr and Std, respectively. The ACC, SPE, PRE, SEN, and F1 are 99.00%, 95.00%, 99.00%, 100.00%, and 100.00%. The results of the RBEBT are greater than 95%, which can prove that the RBEBT is an effective model to classify brain tumors.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>The classification performance</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Methods</th>
<th>Fold</th>
<th>ACC</th>
<th>SPE</th>
<th>PRE</th>
<th>SEN</th>
<th>F1</th>
</tr>
</thead>
<tbody>
<tr>
<td rowspan="7">RBEBT (Ours)</td>
<td>F 1</td>
<td>0.97</td>
<td>0.75</td>
<td>0.97</td>
<td>1.00</td>
<td>0.99</td>
</tr>
<tr>
<td>F 2</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
</tr>
<tr>
<td>F 3</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
</tr>
<tr>
<td>F 4</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
</tr>
<tr>
<td>F 5</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
</tr>
<tr>
<td>Avr</td>
<td>0.99</td>
<td>0.95</td>
<td>0.99</td>
<td>1.00</td>
<td>1.00</td>
</tr>
<tr>
<td>Std</td>
<td>&#x00B1;0.01</td>
<td>&#x00B1;0.10</td>
<td>&#x00B1;0.01</td>
<td>&#x00B1;0.00</td>
<td>&#x00B1;0.01</td>
</tr>
<tr>
<td rowspan="7">AlexNet-BA-ELM</td>
<td>F 1</td>
<td>0.97</td>
<td>1.00</td>
<td>1.00</td>
<td>0.97</td>
<td>0.99</td>
</tr>
<tr>
<td>F 2</td>
<td>0.87</td>
<td>0.25</td>
<td>0.92</td>
<td>0.94</td>
<td>0.93</td>
</tr>
<tr>
<td>F 3</td>
<td>0.95</td>
<td>0.50</td>
<td>0.95</td>
<td>1.00</td>
<td>0.97</td>
</tr>
<tr>
<td>F 4</td>
<td>0.95</td>
<td>0.50</td>
<td>0.95</td>
<td>1.00</td>
<td>0.97</td>
</tr>
<tr>
<td>F 5</td>
<td>0.95</td>
<td>0.50</td>
<td>0.95</td>
<td>1.00</td>
<td>0.97</td>
</tr>
<tr>
<td>Avr</td>
<td>0.94</td>
<td>0.55</td>
<td>0.95</td>
<td>0.98</td>
<td>0.97</td>
</tr>
<tr>
<td>Std</td>
<td>&#x00B1;0.03</td>
<td>&#x00B1;0.24</td>
<td>&#x00B1;0.02</td>
<td>&#x00B1;0.02</td>
<td>&#x00B1;0.02</td>
</tr>
<tr>
<td rowspan="7">MobileNet-BA-ELM</td>
<td>F 1</td>
<td>0.95</td>
<td>0.50</td>
<td>0.95</td>
<td>1.00</td>
<td>0.97</td>
</tr>
<tr>
<td>F 2</td>
<td>0.95</td>
<td>0.50</td>
<td>0.95</td>
<td>1.00</td>
<td>0.97</td>
</tr>
<tr>
<td>F 3</td>
<td>0.97</td>
<td>0.75</td>
<td>0.97</td>
<td>1.00</td>
<td>0.99</td>
</tr>
<tr>
<td>F 4</td>
<td>0.97</td>
<td>0.75</td>
<td>0.97</td>
<td>1.00</td>
<td>0.99</td>
</tr>
<tr>
<td>F 5</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
</tr>
<tr>
<td>Avr</td>
<td>0.97</td>
<td>0.70</td>
<td>0.97</td>
<td>1.00</td>
<td>0.98</td>
</tr>
<tr>
<td>Std</td>
<td>&#x00B1;0.02</td>
<td>&#x00B1;0.19</td>
<td>&#x00B1;0.02</td>
<td>&#x00B1;0.00</td>
<td>&#x00B1;0.01</td>
</tr>
<tr>
<td rowspan="7">ResNet50-BA-ELM</td>
<td>F 1</td>
<td>0.90</td>
<td>0.75</td>
<td>0.97</td>
<td>0.91</td>
<td>0.94</td>
</tr>
<tr>
<td>F 2</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
</tr>
<tr>
<td>F 3</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
</tr>
<tr>
<td>F 4</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
</tr>
<tr>
<td>F 5</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
</tr>
<tr>
<td>Avr</td>
<td>0.98</td>
<td>0.95</td>
<td>0.99</td>
<td>0.98</td>
<td>0.99</td>
</tr>
<tr>
<td>Std</td>
<td>&#x00B1;0.04</td>
<td>&#x00B1;0.10</td>
<td>&#x00B1;0.01</td>
<td>&#x00B1;0.03</td>
<td>&#x00B1;0.02</td>
</tr>
<tr>
<td rowspan="7">VGG-BA-ELM</td>
<td>F 1</td>
<td>0.92</td>
<td>1.00</td>
<td>1.00</td>
<td>0.91</td>
<td>0.96</td>
</tr>
<tr>
<td>F 2</td>
<td>0.95</td>
<td>0.75</td>
<td>0.97</td>
<td>0.97</td>
<td>0.97</td>
</tr>
<tr>
<td>F 3</td>
<td>0.97</td>
<td>1.00</td>
<td>1.00</td>
<td>0.97</td>
<td>0.99</td>
</tr>
<tr>
<td>F 4</td>
<td>0.90</td>
<td>0.00</td>
<td>0.90</td>
<td>1.00</td>
<td>0.95</td>
</tr>
<tr>
<td>F 5</td>
<td>0.97</td>
<td>1.00</td>
<td>1.00</td>
<td>0.97</td>
<td>0.99</td>
</tr>
<tr>
<td>Avr</td>
<td>0.94</td>
<td>0.75</td>
<td>0.97</td>
<td>0.97</td>
<td>0.97</td>
</tr>
<tr>
<td>Std</td>
<td>&#x00B1;0.03</td>
<td>&#x00B1;0.39</td>
<td>&#x00B1;0.04</td>
<td>&#x00B1;0.03</td>
<td>&#x00B1;0.02</td>
</tr>
<tr>
<td rowspan="7">ResNet18-ELM</td>
<td>F 1</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
</tr>
<tr>
<td>F 2</td>
<td>0.97</td>
<td>0.75</td>
<td>0.97</td>
<td>1.00</td>
<td>0.99</td>
</tr>
<tr>
<td>F 3</td>
<td>0.97</td>
<td>1.00</td>
<td>1.00</td>
<td>0.97</td>
<td>0.99</td>
</tr>
<tr>
<td>F 4</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
</tr>
<tr>
<td>F 5</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
<td>1.00</td>
</tr>
<tr>
<td>Avr</td>
<td>0.99</td>
<td>0.95</td>
<td>0.99</td>
<td>0.99</td>
<td>0.99</td>
</tr>
<tr>
<td>Std</td>
<td>&#x00B1;0.01</td>
<td>&#x00B1;0.10</td>
<td>&#x00B1;0.01</td>
<td>&#x00B1;0.01</td>
<td>&#x00B1;0.01</td>
</tr>
<tr>
<td rowspan="7">Fine-tuned ResNet18</td>
<td>F 1</td>
<td>0.90</td>
<td>1.00</td>
<td>1.00</td>
<td>0.89</td>
<td>0.94</td>
</tr>
<tr>
<td>F 2</td>
<td>0.72</td>
<td>1.00</td>
<td>1.00</td>
<td>0.69</td>
<td>0.81</td>
</tr>
<tr>
<td>F 3</td>
<td>0.72</td>
<td>1.00</td>
<td>1.00</td>
<td>0.69</td>
<td>0.81</td>
</tr>
<tr>
<td>F 4</td>
<td>0.69</td>
<td>1.00</td>
<td>1.00</td>
<td>0.663</td>
<td>0.79</td>
</tr>
<tr>
<td>F 5</td>
<td>0.64</td>
<td>0.75</td>
<td>0.96</td>
<td>0.63</td>
<td>0.76</td>
</tr>
<tr>
<td>Avr</td>
<td>0.73</td>
<td>0.95</td>
<td>0.99</td>
<td>0.71</td>
<td>0.82</td>
</tr>
<tr>
<td>Std</td>
<td>&#x00B1;0.09</td>
<td>&#x00B1;0.10</td>
<td>&#x00B1;0.02</td>
<td>&#x00B1;0.09</td>
<td>&#x00B1;0.06</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Comparison of Different Backbones</title>
<p>In this paper, we test five different backbone models, which are ResNet18, AlexNet, MobileNet, ResNet50, and VGG. The results are shown in <xref ref-type="table" rid="table-1">Tab. 1</xref> and <xref ref-type="fig" rid="fig-6">Fig. 6</xref>. ResNet18 as the backbone model can obtain the best results than the other four backbone models.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>The comparison of five different backbone models</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_30790-fig-6.png"/>
</fig>
<p>The ResNet18 can deal with the problem of gradient explosion by residual connection. Other backbone models may meet the problem of gradient explosion. Therefore, our model can achieve the best performance than other models.</p>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Effects of Optimization</title>
<p>To prove the superiority of our network, we compare the proposed RBEBT with the fine-tuned model and the model with only RNN. The results are shown in <xref ref-type="table" rid="table-1">Tab. 1</xref>. The comparison figure is given in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>. We can conclude that the optimized network (RBEBT) will achieve better classification performance through comparison.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Effects of optimization</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_30790-fig-7.png"/>
</fig>
<p>The ELM can get better classification performance in small data set because of its simpler structure. What&#x2019;s more, the BA is selected to optimize the ELM. Based on these reasons, the RBEBT can get better results than the fine-tuned ResNet18 and ResNet18-ELM.</p>
</sec>
<sec id="s4_4">
<label>4.4</label>
<title>Comparison with Other State-of-the-Art Methods</title>
<p>The proposed RBEBT is compared with seven other state-of-the-art methods, which are 3D-CNN [<xref ref-type="bibr" rid="ref-1">1</xref>], SVM-CNN [<xref ref-type="bibr" rid="ref-2">2</xref>], KNN-CNN [<xref ref-type="bibr" rid="ref-5">5</xref>], 2D-CNN [<xref ref-type="bibr" rid="ref-7">7</xref>], BPNN [<xref ref-type="bibr" rid="ref-11">11</xref>], LVQNN [<xref ref-type="bibr" rid="ref-12">12</xref>], and LRC [<xref ref-type="bibr" rid="ref-13">13</xref>], as shown in <xref ref-type="table" rid="table-2">Tab. 2</xref>. In conclusion, the classification performance of our network is better than the other seven methods, which proves the superiority of our network.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Comparison with other state-of-the-art methods</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Methods</th>
<th>ACC</th>
<th>SPE</th>
<th>PRE</th>
<th>SEN</th>
<th>F1</th>
</tr>
</thead>
<tbody>
<tr>
<td>3D-CNN [<xref ref-type="bibr" rid="ref-1">1</xref>]</td>
<td>98.32</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>SVM-CNN [<xref ref-type="bibr" rid="ref-2">2</xref>]</td>
<td>95.82</td>
<td>99.30</td>
<td>97.30</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>KNN-CNN [<xref ref-type="bibr" rid="ref-5">5</xref>]</td>
<td>96.25</td>
<td>&#x2013;</td>
<td>96.67</td>
<td>&#x2013;</td>
<td>96.25</td>
</tr>
<tr>
<td>2D-CNN [<xref ref-type="bibr" rid="ref-7">7</xref>]</td>
<td>91.30</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>BPNN [<xref ref-type="bibr" rid="ref-11">11</xref>]</td>
<td>57.23</td>
<td>54.50</td>
<td>91.71</td>
<td>57.54</td>
<td>70.72</td>
</tr>
<tr>
<td>LVQNN [<xref ref-type="bibr" rid="ref-12">12</xref>]</td>
<td>60.05</td>
<td>61.00</td>
<td>93.08</td>
<td>59.94</td>
<td>72.92</td>
</tr>
<tr>
<td>LRC [<xref ref-type="bibr" rid="ref-13">13</xref>]</td>
<td>95.74</td>
<td>58.50</td>
<td>95.47</td>
<td>100.00</td>
<td>97.68</td>
</tr>
<tr>
<td><bold>RBEBT (Ours)</bold></td>
<td><bold>99.00</bold></td>
<td><bold>95.00</bold></td>
<td><bold>99.00</bold></td>
<td><bold>100.00</bold></td>
<td><bold>100.00</bold></td>
</tr>
</tbody>
</table>
<table-wrap-foot><fn id="table-2fn"><p>Note: Bold means the best results, - means not available.</p></fn></table-wrap-foot>
</table-wrap>
<p>In the RBEBT, we use fine-tuned ResNet18 to extract the features of brain tumor images and select ELM as the classifier. The fine-tuned ResNet18 can extract features accurately and ELM has good performance in small data sets. Therefore, the RBEBT can produce better classification performance than other methods.</p>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>In this paper, our team proposes a novel model (RBEBT) for the automatic classification of brain tumors. We use fine-tuned ResNet18 to extract the features of brain tumor images. The RBEBT is different from the traditional CNN models in that the RNN is selected as the classifier. The parameters assigned at random may not be the optimal solution. Our team selects the BA to optimize it. We use five-fold cross-validation to verify the superiority of the RBEBT. The ACC, SPE, PRE, SEN, and F1 are 99.00%, 95.00%, 99.00%, 100.00%, and 100.00%. The classification performance of the RBEBT is greater than 95%, which can prove that the RBEBT is an effective model to classify brain tumors.</p>
<p>The limitations of this paper are: (i) The data set used in this paper is small; (ii) There are only two categories in this paper. In the future, we will apply our model to more public brain tumors data sets to verify its classification performance. Meanwhile, our team will try more methods, such as VIT, U-Net, etc. In addition, we will test our model in other diseases classification.</p>
</sec>
</body>
<back>
<fn-group>
<fn fn-type="other"><p><bold>Funding Statement:</bold> The paper is partially supported by Hope Foundation for Cancer Research, UK (RM60G0680), Royal Society International Exchanges Cost Share Award, UK (RP202G0230), Medical Research Council Confidence in Concept Award, UK (MC_PC_17171), British Heart Foundation Accelerator Award, UK (AA/18/3/34220); Sino-UK Industrial Fund, UK (RP202G0289); Global Challenges Research Fund (GCRF), UK (P202PF11); LIAS Pioneering Partnerships award, UK (P202ED10); Data Science Enhancement Fund, UK (P202RE237).</p>
</fn>
<fn fn-type="conflict"><p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Rehman</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Saba</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Mehmood</surname></string-name>, <string-name><given-names>U.</given-names> <surname>Tariq</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Microscopic brain tumor detection and classification using 3D CNN and feature selection architecture</article-title>,&#x201D; <source>Microscopy Research and Technique</source>, vol. <volume>84</volume>, no. <issue>1</issue>, pp. <fpage>133</fpage>&#x2013;<lpage>149</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Deepak</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Ameer</surname></string-name></person-group>, &#x201C;<article-title>Automated categorization of brain tumor from MRI using CNN features and SVM</article-title>,&#x201D; <source>Journal of Ambient Intelligence and Humanized Computing</source>, vol. <volume>12</volume>, no. <issue>8</issue>, pp. <fpage>8357</fpage>&#x2013;<lpage>8369</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Mzoughi</surname></string-name>, <string-name><given-names>I.</given-names> <surname>Njeh</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Wali</surname></string-name>, <string-name><given-names>M. B.</given-names> <surname>Slima</surname></string-name>, <string-name><given-names>A.</given-names> <surname>BenHamida</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Deep multi-scale 3D convolutional neural network (CNN) for MRI gliomas brain tumor classification</article-title>,&#x201D; <source>Journal of Digital Imaging</source>, vol. <volume>33</volume>, no. <issue>4</issue>, pp. <fpage>903</fpage>&#x2013;<lpage>915</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N.</given-names> <surname>Kesav</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Jibukumar</surname></string-name></person-group>, &#x201C;<article-title>Efficient and low complex architecture for detection and classification of Brain Tumor using RCNN with Two Channel CNN</article-title>,&#x201D; <source>Journal of King Saud University-Computer and Information Sciences</source>, <year>2021</year>. <uri>https://www.sciencedirect.com/science/article/pii/S1319157821001221?via%3Dihub</uri>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Srinivas</surname></string-name> and <string-name><given-names>G. S.</given-names> <surname>Rao</surname></string-name></person-group>, &#x201C;<article-title>A hybrid CNN-KNN model for MRI brain tumor classification</article-title>,&#x201D; <source>International Journal of Recent Technology and Engineering (IJRTE) ISSN</source>, vol. <volume>8</volume>, pp. <fpage>2277</fpage>&#x2013;<lpage>3878</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>O. N.</given-names> <surname>Belaid</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Loudini</surname></string-name></person-group>, &#x201C;<article-title>Classification of brain tumor by combination of pre-trained VGG16 CNN</article-title>,&#x201D; <source>Journal of Information Technology Management</source>, vol. <volume>12</volume>, pp. <fpage>13</fpage>&#x2013;<lpage>25</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Sarkar</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Kumar</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Chakraborty</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Aich</surname></string-name>, <string-name><given-names>J.-S.</given-names> <surname>Sim</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>A CNN based approach for the detection of brain tumor using MRI scans</article-title>,&#x201D; <source>Test Engineering and Management</source>, vol. <volume>83</volume>, pp. <fpage>16580</fpage>&#x2013;<lpage>16586</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. K.</given-names> <surname>Agarwal</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Sharma</surname></string-name> and <string-name><given-names>M. K.</given-names> <surname>Jain</surname></string-name></person-group>, &#x201C;<article-title>Brain tumor classification using CNN</article-title>,&#x201D; <source>Advances and Applications in Mathematical Sciences</source>, vol. <volume>20</volume>, pp. <fpage>397</fpage>&#x2013;<lpage>407</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Sal&#x00E7;in</surname></string-name></person-group>, &#x201C;<article-title>Detection and classification of brain tumours from MRI images using faster R-CNN</article-title>,&#x201D; <source>Tehni&#x010D;ki Glasnik</source>, vol. <volume>13</volume>, no. <issue>4</issue>, pp. <fpage>337</fpage>&#x2013;<lpage>342</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Hossain</surname></string-name>, <string-name><given-names>F. S.</given-names> <surname>Shishir</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Ashraf</surname></string-name>, <string-name><given-names>M. A. Al</given-names> <surname>Nasim</surname></string-name> and <string-name><given-names>F. M.</given-names> <surname>Shah</surname></string-name></person-group>, &#x201C;<article-title>Brain tumor detection using convolutional neural network</article-title>,&#x201D; in <conf-name>2019 1st Int. Conf. on Advances in Science, Engineering and Robotics Technology (ICASERT)</conf-name>, Dhaka, Bangladesh, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>, <year>2019</year>. </mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D. J.</given-names> <surname>Hemanth</surname></string-name>, <string-name><given-names>C. K. S.</given-names> <surname>Vijila</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Anitha</surname></string-name></person-group>, &#x201C;<article-title>A high speed back propagation neural network for multistage MR brain tumor image segmentation</article-title>,&#x201D; <source>Neural Network World</source>, vol. <volume>21</volume>, no. <issue>1</issue>, pp. <fpage>51</fpage>, <year>2011</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>B. H.</given-names> <surname>Nayef</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Sahran</surname></string-name>, <string-name><given-names>R. I.</given-names> <surname>Hussain</surname></string-name> and <string-name><given-names>S. N. H. S.</given-names> <surname>Abdullah</surname></string-name></person-group>, &#x201C;<article-title>Brain imaging classification based on learning vector quantization</article-title>,&#x201D; in <conf-name>2013 1st Int. Conf. on Communications, Signal Processing, and their Applications (ICCSPA)</conf-name>, Sharjah, United Arab Emirates, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>, <year>2013</year>. </mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Shao</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Yan</surname></string-name>, <string-name><given-names>T.-F.</given-names> <surname>Yuan</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Qu</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>A feature-free 30-disease pathological brain detection system by linear regression classifier</article-title>,&#x201D; <source>CNS &#x0026; Neurological Disorders-Drug Targets (Formerly Current Drug Targets-CNS &#x0026; Neurological Disorders)</source>, vol. <volume>16</volume>, pp. <fpage>5</fpage>&#x2013;<lpage>10</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Wang</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Deformation expression of soft tissue based on BP neural network</article-title>,&#x201D; <source>Intelligent Automation and Soft Computing</source>, vol. <volume>32</volume>, pp. <fpage>1041</fpage>&#x2013;<lpage>1053</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name> and <string-name><given-names>N.</given-names> <surname>Ge</surname></string-name></person-group>, &#x201C;<article-title>Fine-grained vehicle type classification using lightweight convolutional neural network with feature optimization and joint learning strategy</article-title>,&#x201D; <source>Multimedia Tools and Applications</source>, vol. <volume>80</volume>, no. <issue>20</issue>, pp. <fpage>30803</fpage>&#x2013;<lpage>30816</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Xiao</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Yin</surname></string-name>, <string-name><given-names>S.-H.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>Y.-D.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>TReC: Transferred ResNet and CBAM for detecting brain diseases</article-title>,&#x201D; <source>Frontiers in Neuroinformatics</source>, vol. <volume>15</volume>, pp. <fpage>671</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Xiao</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Yin</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Qi</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Zhang</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>A dual-stage attention-based Conv-LSTM network for spatio-temporal correlation and multivariate time series prediction</article-title>,&#x201D; <source>International Journal of Intelligent Systems</source>, vol. <volume>36</volume>, no. <issue>5</issue>, pp. <fpage>2036</fpage>&#x2013;<lpage>2057</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>He</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Ren</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Sun</surname></string-name></person-group>, &#x201C;<article-title>Deep residual learning for image recognition</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, Las Vegas, NV, USA, pp. <fpage>770</fpage>&#x2013;<lpage>778</lpage>, <year>2016</year>. </mixed-citation></ref>
</ref-list>
</back>
</article>
