<?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">33155</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2023.033155</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>A Hyperparameter Optimization for Galaxy Classification</article-title>
<alt-title alt-title-type="left-running-head">A Hyperparameter Optimization for Galaxy Classification</alt-title>
<alt-title alt-title-type="right-running-head">A Hyperparameter Optimization for Galaxy Classification</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>&#x015E;enel</surname><given-names>Fatih Ahmet</given-names></name><email>fatihsenel@sdu.edu.tr</email></contrib>
<aff id="aff-1"><institution>S&#x00FC;leyman Demirel University, Engineering Faculty, Department of Computer Engineering</institution>, <addr-line>Isparta</addr-line>, <country>Turkey</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Fatih Ahmet &#x015E;enel. Email: <email>fatihsenel@sdu.edu.tr</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-10-28"><day>28</day>
<month>10</month>
<year>2022</year></pub-date>
<volume>74</volume>
<issue>2</issue>
<fpage>4587</fpage>
<lpage>4600</lpage>
<history>
<date date-type="received"><day>09</day><month>6</month><year>2022</year></date>
<date date-type="accepted"><day>16</day><month>9</month><year>2022</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 &#x015E;ENEL</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>&#x015E;ENEL</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_33155.pdf"></self-uri>
<abstract>
<p>In this study, the morphological galaxy classification process was carried out with a hybrid approach. Since the Galaxy classification process may contain detailed information about the universe&#x2019;s formation, it remains the current research topic. Researchers divided more than 100 billion galaxies into ten different classes. It is not always possible to understand which class the galaxy types belong. However, Artificial Intelligence (AI) can be used for successful classification. There are studies on the automatic classification of galaxies into a small number of classes. As the number of classes increases, the success of the used methods decreases. Based on the literature, the classification using Convolutional Neural Network (CNN) is better. Three meta-heuristic algorithms are used to obtain the optimum architecture of CNN. These are Grey Wolf Optimizer (GWO), Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC) algorithms. A CNN architecture with nine hidden layers and two full connected layers was used. The number of neurons in the hidden layers and the fully connected layers, the learning coefficient and the batch size values were optimized. The classification accuracy of my model was 85&#x0025;. The best results were obtained using GWO. Manual optimization of CNN is difficult. It was carried out with the help of the GWO meta-heuristic algorithm.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Astronomy</kwd>
<kwd>classification</kwd>
<kwd>convolution neural network</kwd>
<kwd>galaxy</kwd>
<kwd>grey wolf optimizer</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1"><label>1</label><title>Introduction</title>
<p>A Galaxy consists of stars, dust, gas and dark matter held together by gravity. There are approximately 100 billion galaxies in the universe [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>]. Galaxies were formed by the formation of gas and dust clusters, which were hot at the beginning of the universe but later got colder. Galaxies are divided into spiral, elliptical, peculiar, and irregular. Galaxies can be further divided into classes [<xref ref-type="bibr" rid="ref-3">3</xref>,<xref ref-type="bibr" rid="ref-4">4</xref>]. Classification of galaxies is especially important to obtain information about the formation of the universe. Since the formation of galaxies is related to their current structures, the classification of galaxies is the subject of study of many researchers today.</p>
<p>Reza [<xref ref-type="bibr" rid="ref-5">5</xref>] classified galaxy types into four groups: spiral, merger, star and elliptical, using five different machine learning algorithms. Using the data set obtained by the Galaxy Zoo project, classification was made with Decision Trees, Random Forest (RF), ExtraTrees, K-Nearest Neighbors (KNN) and Artificial Neural Network (ANN). The best result was achieved using ANN with an accuracy of 98.2&#x0025;. Misra&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-6">6</xref>] classified galaxy clusters into three classes using Support Vector Machine (SVM), Naive Bayes and Convolution Neural Network (CNN). Their datasets consist of galaxies of elliptical, spiral, and irregular types. They achieved the best classification with a CNN of four hidden layers. Their method classified the images with an accuracy of 97.3958&#x0025;. Biswas&#x00A0;et&#x00A0;al.&#x00A0;showed that ANN can perform a faster classification than manual classification [<xref ref-type="bibr" rid="ref-7">7</xref>]. However, their studies remained at the basic level, and did not make a detailed classification process. Cheng et al., classified elliptical and spiral galaxies using CNN, KNN, Logistic Regression, SVM, RF, and ANN. They used the Dark Energy Survey dataset [<xref ref-type="bibr" rid="ref-8">8</xref>] and obtained an accuracy of 99&#x0025; with CNN method. Cheng&#x00A0;et&#x00A0;al.&#x00A0;classified elliptical and spiral galaxies using CNN [<xref ref-type="bibr" rid="ref-9">9</xref>]. Their classification studies used a CNN architecture with three convolutional layers and two dense layers. They binary classified galaxies with an accuracy of 99&#x0025;. Bastanfard&#x00A0;et&#x00A0;al.&#x00A0;classified the galaxies into two groups of spiral and elliptical galaxies [<xref ref-type="bibr" rid="ref-10">10</xref>] using SVM classifier with an accuracy of 97&#x0025;. Goyal&#x00A0;et&#x00A0;al.&#x00A0;classified galaxies into three groups: elliptical, lenticulars, and spirals. They used different machine learning algorithms [<xref ref-type="bibr" rid="ref-11">11</xref>] with CNN and an accuracy of 88&#x0025;.</p>
<p>Abd Elaziz et al., classified galaxies into three groups of elliptical, lenticulars, and spirals using a hybrid approach [<xref ref-type="bibr" rid="ref-12">12</xref>]. At first, they performed feature extraction using the Gegenbauer moment method. Then, feature selection was performed using the artificial bee colony optimization algorithm. They obtained the feature subset required for the classification. Finally, they classified the galaxies into three classes using the SVM classifier with an average accuracy of 91&#x0025;.</p>
<p>Based on the literature CNN method is generally used to achieve accurate classifications. This is the reason to use CNN method for this study. However, the deciding the architecture of the CNN is not easy. Abd Elaziz&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-12">12</xref>] used a meta-heuristic optimization algorithm for feature selection. This study uses a metaheuristic optimization algorithm to obtain the optimum CNN architecture. A hybrid approach that optimizes the CNN architecture while performing the classification process with CNN is discussed in this study. No similar study has been found in the literature. Therefore, this study will be innovative and contribute to the literature. Another innovative aspect is classifying galaxy types belonging to ten different classes whereas most studies have done two or three different classifications.</p>
<p>In Section 2, the hybrid approach of this study is presented. The experimental results are included in Section 3. In the last section, the conclusion is explained.</p>
</sec>
<sec id="s2"><label>2</label><title>Structure</title>
<p>In this study, galaxy classification was performed using CNN. CNN has been among the most popular classification methods in recent years. The CNN method was preferred in this study because it can successfully solve many classification problems [<xref ref-type="bibr" rid="ref-13">13</xref>&#x2013;<xref ref-type="bibr" rid="ref-19">19</xref>]. Based on the results of this study, it is a suitable method for solving the galaxy classification problem. The Grey Wolf Optimizer (GWO) algorithm is used to obtain the optimum CNN architecture to achieve the best classification result. The GWO algorithm is used in solving optimization problems [<xref ref-type="bibr" rid="ref-20">20</xref>&#x2013;<xref ref-type="bibr" rid="ref-23">23</xref>] and improving other metaheuristic optimization algorithms [<xref ref-type="bibr" rid="ref-24">24</xref>&#x2013;<xref ref-type="bibr" rid="ref-29">29</xref>]. It is preferred for hyperparameter optimization of the CNN architecture. CNN and GWO are explained in detail in the following sections.</p>
<sec id="s2_1"><label>2.1</label><title>Convolution Neural Network (CNN)</title>
<p>Convolution Neural Network has become the most popular topic in recent years with the development of hardware technology. The CNN has been adapted to many different disciplines because classical image processing stages can be performed automatically. The CNN method takes pictures as input and produces feature maps by passing them through layers. It then classifies images by feature selection. A CNN architecture consists of an input layer, convolution layer, pooling layer, fully connected (FC) layer, SoftMax, and output layers [<xref ref-type="bibr" rid="ref-30">30</xref>]. The CNN architecture is shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>.</p>
<fig id="fig-1"><label>Figure 1</label><caption><title>CNN architecture</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_33155-fig-1.png"/></fig>
<p>The input layer is where the image data is applied raw to the CNN architecture. The input layer size is determined according to the resolution of the image. The convolution layer extracts the features from the images. In this layer, many features are obtained using filters of different sizes such as 2&#x2009;&#x00D7;&#x2009;2, 3&#x2009;&#x00D7;&#x2009;3, and 5&#x2009;&#x00D7;&#x2009;5. This filter is moved over all the pixels in order, starting from one corner of the picture. A new value is obtained by multiplying and summing the overlapping pixel values on the picture with the filter. In this way, different features are brought to the fore from each filter. Rectified Linear Unit (ReLu) activation function is generally used in the convolution layer.</p>
<p>The pooling layer is used to reduce the load on the hardware while working on the CNN architecture. It may cause some features to be lost but, it also prevents overfitting. It does not have to be used in every CNN architecture. All features extracted in the fully connected layer are smoothed into a single vector. Among the features extracted by this layer, the most contributing and non-contributing features to the classification are determined by updating the weights. The feature selection process is performed with this layer. In the SoftMax layer, the outputs of the FC layer are passed through the activation function and the class predictions are transferred to the output layer. The output layer predicts the class labels.</p>
</sec>
<sec id="s2_2"><label>2.2</label><title>Grey Wolf Optimizer (GWO)</title>
<p>Grey Wolf Optimization (GWO) algorithm is a meta-heuristic optimization algorithm inspired by Grey wolves&#x2019; survival and hunting strategies in nature [<xref ref-type="bibr" rid="ref-31">31</xref>&#x2013;<xref ref-type="bibr" rid="ref-33">33</xref>]. Grey wolves have a chain in which alpha wolves are at the top, and beta, delta, and omega wolves are listed, respectively (<xref ref-type="fig" rid="fig-2">Fig. 2</xref>).</p>
<fig id="fig-2"><label>Figure 2</label><caption><title>GWO algorithm hierarchy chain [<xref ref-type="bibr" rid="ref-31">31</xref>]</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_33155-fig-2.png"/></fig>
<p>Alpha wolves represent the most dominant and commanding wolves, as seen from the chain structure. Beta wolves act as alpha wolves&#x2019; assistants and run the communication network between alpha wolves and other wolves. Omega wolves are the lowest level wolves chosen by alpha wolves. They are the ones who eat at last during hunting. Wolves that do not belong to the class of alpha, beta, or omega wolves are called delta wolves. Delta wolves are predominantly selected by alpha and beta wolves from omega wolves [<xref ref-type="bibr" rid="ref-34">34</xref>].</p>
<sec id="s2_2_1"><label>2.2.1</label><title>Hunting</title>
<p>Grey wolves hunt in the following three stages
<list list-type="bullet">
<list-item><p>Observing, tracking and approaching the prey</p></list-item>
<list-item><p>Encircling the prey and forcing it to move until it gets tired</p></list-item>
<list-item><p>Attacking the prey</p></list-item>
</list></p>
<p>In the GWO algorithm, alpha wolves represent the best solution. Beta and delta wolves represent the second and third best solutions, respectively. Finally, omega wolves represent candidate solutions.
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mi>D</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:mi>C</mml:mi><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>X</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mi>X</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>A</mml:mi><mml:mo>&#x2217;</mml:mo><mml:mi>D</mml:mi></mml:math></disp-formula></p>
<p><xref ref-type="disp-formula" rid="eqn-1">Eqs. (1)</xref> and <xref ref-type="disp-formula" rid="eqn-2">(2)</xref> in the GWO algorithm are used to express the encirclement of prey. It keeps the number of <italic>t</italic> instant iterations, <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> the position of the prey, <italic>X</italic> the position vector of a grey wolf. <italic>A</italic> and <italic>C</italic> represent the vector coefficients and are calculated as shown in <xref ref-type="disp-formula" rid="eqn-3">Eqs. (3)</xref> and <xref ref-type="disp-formula" rid="eqn-4">(4)</xref>.
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mi>a</mml:mi><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mi>C</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p>Here, the random <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> are in the range of <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mrow><mml:mo>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> and <italic>a</italic> denotes the linearly decreasing coefficient as the iteration progresses from 2 to 0.</p>
</sec>
<sec id="s2_2_2"><label>2.2.2</label><title>Search</title>
<p>In GWO, the search process starts randomly, and the availability value of each wolf is calculated according to the cost function. The top three positions with the best availability value are represented as alpha, beta, and delta wolves, respectively. The alpha wolf coordinates the hunting process, and beta and delta wolves can join as needed. The positions of alpha, beta and delta wolves are updated as shown in <xref ref-type="disp-formula" rid="eqn-5">Eqs. (5)</xref>, <xref ref-type="disp-formula" rid="eqn-6">(6)</xref>, and <xref ref-type="disp-formula" rid="eqn-7">(7)</xref>.
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>X</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>&#x03B2;</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>&#x03B2;</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>X</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>&#x03B4;</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>&#x03B4;</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>X</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>Here, <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>&#x03B2;</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>&#x03B4;</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represent the positions of alpha, beta, and delta wolves, respectively. The top three wolves are constantly updated in each iteration.
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>&#x03B2;</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>&#x03B2;</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>&#x03B2;</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>&#x03B4;</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>&#x03B4;</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>&#x03B4;</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mi>X</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mn>3</mml:mn></mml:mfrac></mml:math></disp-formula></p>
<p>Here, <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mi>X</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> denotes the new position of the prey.</p>
</sec>
<sec id="s2_2_3"><label>2.2.3</label><title>Attack</title>
<p>After the location of the prey is determined in GWO, attacking the prey is carried out. Attacking the prey takes place after the prey gets tired and stops moving. Considering the mathematical modeling process, the attack process takes place according to the <italic>A</italic> value specified in <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>. The <italic>A</italic> value is in [<inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mo>&#x2212;</mml:mo><mml:mn>2</mml:mn><mml:mrow><mml:mtext>a</mml:mtext></mml:mrow><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mrow><mml:mtext>a</mml:mtext></mml:mrow></mml:math></inline-formula>] and its value changes depending on the random variable <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula>. If the <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mrow><mml:mo>|</mml:mo><mml:mi>A</mml:mi><mml:mo>|</mml:mo></mml:mrow></mml:math></inline-formula> value is greater than or equal to 1, Grey wolves will move away from the prey and start looking for a more suitable prey. If <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mrow><mml:mo>|</mml:mo><mml:mi>A</mml:mi><mml:mo>|</mml:mo></mml:mrow></mml:math></inline-formula> is less than 1, the grey wolves are forced to attack the prey. This prevents getting blocked by local minimums. In GWO, the hunting process is continued until the stopping criterion is met or the specified number of iterations is reached.</p>
</sec>
</sec>
</sec>
<sec id="s3"><label>3</label><title>Experimental Results</title>
<p>In this study, galaxy classification was made using the CNN method. Optimization of the CNN architecture with the support of the GWO algorithm has been carried out. In addition, a comparison was made with the Particle Swarm Optimization (PSO) [<xref ref-type="bibr" rid="ref-35">35</xref>] and Artificial Bee Colony (ABC) [<xref ref-type="bibr" rid="ref-36">36</xref>] algorithms, which are well known in the literature to compare the success of the GWO algorithm. The dataset and the CNN architecture used in the experimental studies are described in the following sections.</p>
<sec id="s3_1"><label>3.1</label><title>Dataset</title>
<p>Galaxy images used in this study were created by Galaxy Zoo Project. Galaxy10 Sloan Digital Sky Survey (SDSS) Dataset [<xref ref-type="bibr" rid="ref-37">37</xref>] consists of ten classes, accepted by more than 55&#x0025; of researchers. This dataset consists of 21785 images, that are 69&#x2009;&#x00D7;&#x2009;69 in size. <xref ref-type="table" rid="table-1">Table 1</xref> presents the classes of the dataset and the number of samples in each class.</p>
<table-wrap id="table-1"><label>Table 1</label><caption><title>Galaxy10 SDSS dataset</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Class name</th>
<th align="left">The number of sample</th>
<th align="left">Class label</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Disk, Face-on, No spiral</td>
<td align="left">3461</td>
<td align="left">0</td>
</tr>
<tr>
<td align="left">Smooth, Completely round</td>
<td align="left">6997</td>
<td align="left">1</td>
</tr>
<tr>
<td align="left">Smooth, in-between round</td>
<td align="left">6292</td>
<td align="left">2</td>
</tr>
<tr>
<td align="left">Smooth, Cigar shaped</td>
<td align="left">394</td>
<td align="left">3</td>
</tr>
<tr>
<td align="left">Disk, Edge-on, Rounded bulge</td>
<td align="left">1534</td>
<td align="left">4</td>
</tr>
<tr>
<td align="left">Disk, Edge-on, Boxy bulge</td>
<td align="left">17</td>
<td align="left">5</td>
</tr>
<tr>
<td align="left">Disk, Edge-on, No bulge</td>
<td align="left">589</td>
<td align="left">6</td>
</tr>
<tr>
<td align="left">Disk, Face-on, Tight spiral</td>
<td align="left">1121</td>
<td align="left">7</td>
</tr>
<tr>
<td align="left">Disk, Face-on, Medium spiral</td>
<td align="left">906</td>
<td align="left">8</td>
</tr>
<tr>
<td align="left">Disk, Face-on, Loose spiral</td>
<td align="left">519</td>
<td align="left">9</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In <xref ref-type="fig" rid="fig-3">Fig. 3</xref>, sample images of the classes in the Galaxy10 SDSS dataset are shown. As seen from <xref ref-type="fig" rid="fig-3">Fig. 3</xref>, there are 10 galaxy classes in the dataset. Although some classes are similar to each other, they differ from each other with small differences. These similar classes complicate the problem being considered. This situation requires a more complex CNN architecture instead of a simpler CNN architecture.</p>
<fig id="fig-3"><label>Figure 3</label><caption><title>Example images of each class from the Galaxy10 dataset [<xref ref-type="bibr" rid="ref-37">37</xref>]</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_33155-fig-3.png"/></fig>
</sec>
<sec id="s3_2"><label>3.2</label><title>CNN Architecture</title>
<p>In this study, a basic CNN architecture was determined. The number of neurons in the layers of this architecture, learning coefficient and batch sizes were optimized. The CNN architecture is presented in <xref ref-type="table" rid="table-2">Table 2</xref>, and ranges of optimized parameters are given in <xref ref-type="table" rid="table-3">Table 3</xref>.</p>
<table-wrap id="table-2"><label>Table 2</label><caption><title>Optimized CNN architecture</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Layer type</th>
<th align="left">The number of neurons</th>
<th align="left">Filter size</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Input layer</td>
<td align="left">69&#x2009;&#x00D7;&#x2009;69&#x2009;&#x00D7;&#x2009;3</td>
<td align="center"/>
</tr>
<tr>
<td align="left">Convolution layer ReLu</td>
<td align="left">Parameter 1</td>
<td align="left">3&#x2009;&#x00D7;&#x2009;3</td>
</tr>
<tr>
<td align="left">Pooling layer</td>
<td align="center"/>
<td align="left">2&#x2009;&#x00D7;&#x2009;2</td>
</tr>
<tr>
<td align="left">Convolution layer ReLu</td>
<td align="left">Parameter 2</td>
<td align="left">3&#x2009;&#x00D7;&#x2009;3</td>
</tr>
<tr>
<td align="left">Convolution layer ReLu</td>
<td align="left">Parameter 3</td>
<td align="left">3&#x2009;&#x00D7;&#x2009;3</td>
</tr>
<tr>
<td align="left">Convolution layer ReLu</td>
<td align="left">Parameter 4</td>
<td align="left">3&#x2009;&#x00D7;&#x2009;3</td>
</tr>
<tr>
<td align="left">Dropout layer</td>
<td align="center"/>
<td align="left">0.5</td>
</tr>
<tr>
<td align="left">Convolution layer ReLu</td>
<td align="left">Parameter 5</td>
<td align="left">3&#x2009;&#x00D7;&#x2009;3</td>
</tr>
<tr>
<td align="left">Convolution layer ReLu</td>
<td align="left">Parameter 6</td>
<td align="left">3&#x2009;&#x00D7;&#x2009;3</td>
</tr>
<tr>
<td align="left">Convolution layer ReLu</td>
<td align="left">Parameter 7</td>
<td align="left">3&#x2009;&#x00D7;&#x2009;3</td>
</tr>
<tr>
<td align="left">Pooling layer</td>
<td align="center"/>
<td align="left">2&#x2009;&#x00D7;&#x2009;2</td>
</tr>
<tr>
<td align="left">Convolution layer ReLu</td>
<td align="left">Parameter 8</td>
<td align="left">3&#x2009;&#x00D7;&#x2009;3</td>
</tr>
<tr>
<td align="left">Dropout layer</td>
<td align="center"/>
<td align="left">0.5</td>
</tr>
<tr>
<td align="left">Convolution layer ReLu</td>
<td align="left">Parameter 9</td>
<td align="left">3&#x2009;&#x00D7;&#x2009;3</td>
</tr>
<tr>
<td align="left">Full connected layer ReLu</td>
<td align="left">Parameter 10</td>
<td align="left">3&#x2009;&#x00D7;&#x2009;3</td>
</tr>
<tr>
<td align="left">Dropout layer</td>
<td align="center"/>
<td align="left">0.5</td>
</tr>
<tr>
<td align="left">Full connected layer ReLu</td>
<td align="left">Parameter 11</td>
<td align="center"/>
</tr>
<tr>
<td align="left">Dropout layer</td>
<td align="center"/>
<td align="left">0.5</td>
</tr>
<tr>
<td align="left">Softmax layer</td>
<td align="left">10</td>
<td align="center"/>
</tr>
<tr>
<td align="left">Output layer</td>
<td align="left">10</td>
<td align="center"/>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-3"><label>Table 3</label><caption><title>Optimized parameter ranges</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Parameters</th>
<th align="left">Range</th>
<th align="left">Parameter definitions</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Parameter 1&#x2053;11</td>
<td align="left">16, 32, 64, 128, 256, 512, 1024</td>
<td align="left">The number of neurons</td>
</tr>
<tr>
<td align="left">Parameter 12</td>
<td align="left">0.1, 0.01, 0.001, 0.0001, 0.00001, 0.000001, 0.0000001, 0.00000001</td>
<td align="left">Learn rate</td>
</tr>
<tr>
<td align="left">Parameter 13</td>
<td align="left">128, 256, 512</td>
<td align="left">Batch size</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Parameter 1&#x2053;11 given in <xref ref-type="table" rid="table-2">Table 2</xref> represents the number of neurons to be optimized. In addition to these parameters, Parameters 12 and 13 represent the learning coefficient and batch size, respectively.</p>

</sec>
<sec id="s3_3"><label>3.3</label><title>Analysis</title>
<p>The parameters of the CNN architecture are optimized using the GWO algorithm. All operations have been carried out with Python 3.6 and Keras library. In the development of the CNN model, Adam optimizer as optimization function, Mean Squared Error (<inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mi>M</mml:mi><mml:mi>S</mml:mi><mml:mi>E</mml:mi></mml:math></inline-formula>) and Mean Absolute Error (<inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mi>M</mml:mi><mml:mi>A</mml:mi><mml:mi>E</mml:mi></mml:math></inline-formula>) as loss function, were used. <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>M</mml:mi><mml:mi>S</mml:mi><mml:mi>E</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mi>M</mml:mi><mml:mi>A</mml:mi><mml:mi>E</mml:mi></mml:math></inline-formula> calculations are given in <xref ref-type="disp-formula" rid="eqn-8">Eqs. (8)</xref> and <xref ref-type="disp-formula" rid="eqn-9">(9)</xref>, respectively. <xref ref-type="fig" rid="fig-4">Fig. 4</xref> shows the flow chart of the proposed method.
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mi>M</mml:mi><mml:mi>S</mml:mi><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac><mml:msubsup><mml:mrow><mml:mo>&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:mspace width="thinmathspace" /><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math></disp-formula>
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mi>M</mml:mi><mml:mi>A</mml:mi><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac><mml:msubsup><mml:mrow><mml:mo>&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:mspace width="thinmathspace" /><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow></mml:math></disp-formula></p>
<fig id="fig-4"><label>Figure 4</label><caption><title>The flow chart of the proposed method</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_33155-fig-4.png"/></fig>
<p>Here <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes the actual class label and <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:msub><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes the predicted class label.</p>
<p>In addition to the GWO algorithm, I optimized the CNN architecture with the well-known Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC) algorithms. These algorithms are used successfully in most real-world problems. The PSO and the ABC algorithms are state-of-art metaheuristic algorithms that were compared with GWO [<xref ref-type="bibr" rid="ref-38">38</xref>&#x2013;<xref ref-type="bibr" rid="ref-43">43</xref>]. Therefore, these algorithms were used for comparison in this study.</p>
<p>The model&#x2019;s accuracy value was considered as the cost function of the used metaheuristic algorithms. The <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mrow><mml:mtext mathvariant="italic">accuracy</mml:mtext></mml:mrow></mml:math></inline-formula> formula is given in <xref ref-type="disp-formula" rid="eqn-10">Eq. (10)</xref>. It is aimed to determine the optimum parameters that will maximize the <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mrow><mml:mtext mathvariant="italic">accuracy</mml:mtext></mml:mrow></mml:math></inline-formula> value.
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:mrow><mml:mtext mathvariant="italic">Accuracy</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">Number</mml:mtext></mml:mrow><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mrow><mml:mtext mathvariant="italic">Correct</mml:mtext></mml:mrow><mml:mrow><mml:mtext mathvariant="italic">Predictions</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">Total</mml:mtext></mml:mrow><mml:mrow><mml:mtext mathvariant="italic">Number</mml:mtext></mml:mrow><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mrow><mml:mtext mathvariant="italic">Predictions</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>A total of 21785 images were separated as training and test data with the 10-fold cross-validation technique. The optimum parameters of the CNN architecture were determined by metaheuristic algorithms. All algorithms were run with a population size of 30 and 50 iteration steps. In <xref ref-type="table" rid="table-4">Table 4</xref>, the performance metrics of the train and test dataset are given. The best results were obtained with the GWO. To prevent overfitting in the CNN model, the training phase was terminated in cases where the dropout layers and early stop process and the validation accuracy value could not be improved for ten epochs. In addition, a comparison was made with another study using the same dataset in the literature [<xref ref-type="bibr" rid="ref-44">44</xref>]. The results of the reference study are presented in <xref ref-type="table" rid="table-4">Table 4</xref>.</p>
<table-wrap id="table-4"><label>Table 4</label><caption><title>Performance metrics</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Optimization algorithm</th>
<th align="left">Dataset</th>
<th align="left">Accuracy</th>
<th align="left">MSE</th>
<th align="left">MAE</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" rowspan="2">GWO</td>
<td align="left">Train</td>
<td align="left"><bold>0.934</bold></td>
<td align="left">0.010</td>
<td align="left">0.025</td>
</tr>
<tr>
<td align="left">Test</td>
<td align="left"><bold>0.852</bold></td>
<td align="left">0.022</td>
<td align="left">0.041</td>
</tr>
<tr>
<td align="left" rowspan="2">PSO</td>
<td align="left">Train</td>
<td align="left">0.911</td>
<td align="left">0.013</td>
<td align="left">0.027</td>
</tr>
<tr>
<td align="left">Test</td>
<td align="left">0.807</td>
<td align="left">0.030</td>
<td align="left">0.044</td>
</tr>
<tr>
<td align="left" rowspan="2">ABC</td>
<td align="left">Train</td>
<td align="left">0.895</td>
<td align="left">0.016</td>
<td align="left">0.032</td>
</tr>
<tr>
<td align="left">Test</td>
<td align="left">0.828</td>
<td align="left">0.026</td>
<td align="left">0.043</td>
</tr>
<tr>
<td align="left" rowspan="2">Reference study [<xref ref-type="bibr" rid="ref-44">44</xref>]</td>
<td align="left">Train</td>
<td align="left">0.899</td>
<td align="left" rowspan="2">N. A.</td>
<td align="left" rowspan="2">N. A.</td>
</tr>
<tr>
<td align="left">Test</td>
<td align="left">0.850</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Considering the results given in <xref ref-type="table" rid="table-4">Table 4</xref>, the test accuracy value was found to be 85&#x0025;, whereas in the training as the accuracy was 93&#x0025;. The GWO algorithm achieved better results than other metaheuristic algorithms. Compared to the Reference Study, the GWO algorithm is more successful in the training phase. In the test phase, the GWO algorithm achieved a better result by a small difference.</p>

<p>The differences between test and train results were examined, It was found that the model is not overfitting and performs a balanced learning process using GWO. During the model&#x2019;s training, the <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mrow><mml:mtext mathvariant="italic">accuracy</mml:mtext></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi></mml:math></inline-formula> value of the model obtained with the train and test data are given graphically in <xref ref-type="fig" rid="fig-5">Fig. 5</xref> for the GWO.</p>
<fig id="fig-5"><label>Figure 5</label><caption><title>Development of <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mrow><mml:mtext mathvariant="italic">accuracy</mml:mtext></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi></mml:math></inline-formula> values during the training of the model (a) <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mrow><mml:mtext mathvariant="italic">Accuracy</mml:mtext></mml:mrow></mml:math></inline-formula> graph (b) <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mi>L</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi></mml:math></inline-formula> value graph</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_33155-fig-5.png"/></fig>
<p>The confusion matrix in <xref ref-type="fig" rid="fig-6">Fig. 6</xref> is given to see the classes that our model learned best and could not learn. A confusion matrix is a technique used to summarize the performance of a classification algorithm. If you have an unequal number of samples in each class, or more than two classes in your dataset, the classification accuracy alone can be misleading. A confusion matrix contains more detailed information about the classes in which your classification model fails. In this way, it can be easier to identify the areas to be focused on to improve the algorithm. The values in the matrix represent the classification results as percentages.</p>
<fig id="fig-6"><label>Figure 6</label><caption><title>Confusion matrix of training and test dataset (a) Confusion matrix of test dataset (b) Confusion matrix of train dataset</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_33155-fig-6.png"/></fig>
<p>If <xref ref-type="fig" rid="fig-6">Fig. 6</xref> is examined, my model was able to learn Classes 1, 2, 4, 6 and 7 with an accuracy of over 90&#x0025;. Except for Class 5, the remaining classes could be learned at a level considered successful. However, during the training phase, it learned very little about Class 5 and confused it with Class 4. As explained in the previous sections, our dataset has very little data belonging to Class 5. For this reason, the desired success in the learning process could not be achieved. Not including Class 5 in the study could have been considered as a solution, as there are very few examples compared to other class sample numbers. Since I assert a hybrid approach, I do not need to simplify my dataset. Learning achievements in the training phase are also seen in the testing phase. In direct proportion to the success in the training phase, classification was also possible in the testing phase. If the examples of all classes are examined in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>, it is understood that Classes 1 and 2 have a different and rounded shape from all other classes. Similarly, Classes 7 and 8 have a different spiral appearance than other classes. Galaxies belonging to the other six classes are in the form of disks and are likely to be confused with each other. The examples where the model will have the most difficulty learning are the examples of these six galaxy types. Based on the confusion matrix, the classes with the most success are Classes 1 and 2. Even though Class 8 has a helical appearance, it is a disc-like shape. For this reason, a classification as successful as the training results could not be obtained in the test results. In Class 4 and 6, my CNN model could generate a distinctive feature map and distinguish it from other disk-like galaxies. In <xref ref-type="table" rid="table-5">Table 5</xref>, the <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mrow><mml:mtext mathvariant="italic">Precision</mml:mtext></mml:mrow></mml:math></inline-formula>, <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mrow><mml:mtext mathvariant="italic">Recall</mml:mtext></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mi>F</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:mtext mathvariant="italic">Score</mml:mtext></mml:mrow></mml:math></inline-formula> values obtained by the GWO algorithm for each class are given. The data in <xref ref-type="table" rid="table-5">Table 5</xref> also supports the results in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>. The <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mrow><mml:mtext mathvariant="italic">Precision</mml:mtext></mml:mrow></mml:math></inline-formula>, <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mrow><mml:mtext mathvariant="italic">Recall</mml:mtext></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mi>F</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:mtext mathvariant="italic">Score</mml:mtext></mml:mrow></mml:math></inline-formula> formulas are given in <xref ref-type="disp-formula" rid="eqn-11">Eqs. (11)</xref>, <xref ref-type="disp-formula" rid="eqn-12">(12)</xref> and <xref ref-type="disp-formula" rid="eqn-13">(13)</xref>, respectively.
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mrow><mml:mtext mathvariant="italic">Precision</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula>
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:mtext mathvariant="italic">Recall</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula>
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mi>F</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:mtext mathvariant="italic">Score</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mo>&#x2217;</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">Precision</mml:mtext></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mtext mathvariant="italic">Recall</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">Precision</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext mathvariant="italic">Recall</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<table-wrap id="table-5"><label>Table 5</label><caption><title><inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mrow><mml:mtext mathvariant="italic">Precision</mml:mtext></mml:mrow></mml:math></inline-formula>, <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mrow><mml:mtext mathvariant="italic">Recall</mml:mtext></mml:mrow></mml:math></inline-formula>, and <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mi>F</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow></mml:math></inline-formula> metrics</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"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="center" colspan="4">Train</th>
<th align="center" colspan="4">Test</th>
</tr>
<tr>
<th align="left">Class</th>
<th align="left"><inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mrow><mml:mtext mathvariant="italic">Precision</mml:mtext></mml:mrow></mml:math></inline-formula></th>
<th align="left"><inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mrow><mml:mtext mathvariant="italic">Recall</mml:mtext></mml:mrow></mml:math></inline-formula></th>
<th align="left"><inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mi>F</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow></mml:math></inline-formula></th>
<th align="left">Class</th>
<th align="left"><inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mrow><mml:mtext mathvariant="italic">Precision</mml:mtext></mml:mrow></mml:math></inline-formula></th>
<th align="left"><inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mrow><mml:mtext mathvariant="italic">Recall</mml:mtext></mml:mrow></mml:math></inline-formula></th>
<th align="left"><inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mi>F</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow></mml:math></inline-formula></th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">0</td>
<td align="left">0.94</td>
<td align="left">0.75</td>
<td align="left">0.83</td>
<td align="left">0</td>
<td align="left">0.73</td>
<td align="left">0.63</td>
<td align="left">0.68</td>
</tr>
<tr>
<td align="left">1</td>
<td align="left">0.96</td>
<td align="left">0.98</td>
<td align="left">0.97</td>
<td align="left">1</td>
<td align="left">0.94</td>
<td align="left">0.94</td>
<td align="left">0.94</td>
</tr>
<tr>
<td align="left">2</td>
<td align="left">0.96</td>
<td align="left">0.96</td>
<td align="left">0.96</td>
<td align="left">2</td>
<td align="left">0.93</td>
<td align="left">0.92</td>
<td align="left">0.93</td>
</tr>
<tr>
<td align="left">3</td>
<td align="left">0.92</td>
<td align="left">0.79</td>
<td align="left">0.85</td>
<td align="left">3</td>
<td align="left">0.74</td>
<td align="left">0.61</td>
<td align="left">0.67</td>
</tr>
<tr>
<td align="left">4</td>
<td align="left">0.96</td>
<td align="left">0.97</td>
<td align="left">0.97</td>
<td align="left">4</td>
<td align="left">0.92</td>
<td align="left">0.93</td>
<td align="left">0.93</td>
</tr>
<tr>
<td align="left">5</td>
<td align="left">1.00</td>
<td align="left">0.38</td>
<td align="left">0.55</td>
<td align="left">5</td>
<td align="left">1.00</td>
<td align="left">1.00</td>
<td align="left">1.00</td>
</tr>
<tr>
<td align="left">6</td>
<td align="left">0.91</td>
<td align="left">0.98</td>
<td align="left">0.94</td>
<td align="left">6</td>
<td align="left">0.77</td>
<td align="left">0.83</td>
<td align="left">0.80</td>
</tr>
<tr>
<td align="left">7</td>
<td align="left">0.83</td>
<td align="left">0.91</td>
<td align="left">0.87</td>
<td align="left">7</td>
<td align="left">0.69</td>
<td align="left">0.66</td>
<td align="left">0.67</td>
</tr>
<tr>
<td align="left">8</td>
<td align="left">0.88</td>
<td align="left">0.86</td>
<td align="left">0.87</td>
<td align="left">8</td>
<td align="left">0.53</td>
<td align="left">0.53</td>
<td align="left">0.53</td>
</tr>
<tr>
<td align="left">9</td>
<td align="left">0.93</td>
<td align="left">0.88</td>
<td align="left">0.91</td>
<td align="left">9</td>
<td align="left">0.71</td>
<td align="left">0.52</td>
<td align="left">0.60</td>
</tr>
<tr>
<td align="left">Avg</td>
<td align="left">0.93</td>
<td align="left">0.85</td>
<td align="left">0.87</td>
<td align="left">Avg</td>
<td align="left">0.80</td>
<td align="left">0.76</td>
<td align="left">0.78</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Here, <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:math></inline-formula> represent True Positives, False Positives and False Negatives, respectively. As can be seen from <xref ref-type="table" rid="table-5">Table 5</xref>, the small number of samples in Class 5 caused the <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mrow><mml:mtext mathvariant="italic">Recall</mml:mtext></mml:mrow></mml:math></inline-formula> value to be low during training. Similarly, during the test, the <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mrow><mml:mtext mathvariant="italic">Recall</mml:mtext></mml:mrow></mml:math></inline-formula> value of Classes 7, 8 and 9 is low. These classes have been mixed with other classes. This is clearly seen in the confusion matrix. In addition to <xref ref-type="table" rid="table-5">Table 5</xref>, ROC curves of model results according to classes are given in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>.</p>
<fig id="fig-7"><label>Figure 7</label><caption><title>ROC curves of training and test dataset (a) Test dataset (b) Train dataset</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_33155-fig-7.png"/></fig>
<p>In <xref ref-type="table" rid="table-6">Table 6</xref>, the parameters of my optimally obtained CNN architecture are given. These parameters have been determined with the support of the GWO algorithm.</p>
<table-wrap id="table-6"><label>Table 6</label><caption><title>Achieved optimum results and parameters</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<td align="left">Parameter 1</td>
<td align="left">Parameter 2</td>
<td align="left">Parameter 3</td>
<td align="left">Parameter 4</td>
<td align="left">Parameter 5</td>
</tr>
</thead>
<tbody>
<tr>
<td align="left">32</td>
<td align="left">128</td>
<td align="left">256</td>
<td align="left">1024</td>
<td align="left">512</td>
</tr>
<tr>
<td align="left">Parameter 6</td>
<td align="left">Parameter 7</td>
<td align="left">Parameter 8</td>
<td align="left">Parameter 9</td>
<td align="left">Parameter 10</td>
</tr>
<tr>
<td align="left">512</td>
<td align="left">256</td>
<td align="left">64</td>
<td align="left">128</td>
<td align="left">1024</td>
</tr>
<tr>
<td align="left">Parameter 11</td>
<td align="left">Parameter 12</td>
<td align="left">Parameter 13</td>
<td align="center"/>
<td align="center"/>
</tr>
<tr>
<td align="left">512</td>
<td align="left">0.0001</td>
<td align="left">64</td>
<td align="center"/>
<td align="center"/>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s4"><label>4</label><title>Conclusions</title>
<p>In this study, a morphological galaxy classification process was carried out. A hybrid approach is asserted using the Galaxy10 SDSS dataset. The neuron numbers, learning coefficient and batch size of the CNN architecture are adjusted with the help of meta-heuristic algorithms. The hyperparameter optimization process was calculated with the help of meta-heuristic algorithms. GWO, PSO and ABC algorithms, which are widely used in the literature, were selected. For an objective comparison, powerful state-of-the-art algorithm has been preferred. The learning process is difficult because the sample in the dataset is not homogeneously distributed. To overcome the problem, parameter adjustment is made with the help of an algorithm. The results show that the intended method can be used successfully in classification processes. Among the algorithms used, the GWO algorithm has been the most suitable for this problem. The GWO algorithm completed the training process with 93&#x0025; accuracy and the testing process with 85&#x0025; accuracy. Other algorithms have lagged this ratio. In future studies, a hybrid approach will be developed using homogeneous datasets.</p>
</sec>
</body>
<back>
<fn-group>
<fn fn-type="other"><p><bold>Funding Statement:</bold> The author received no specific funding for this study.</p></fn>
<fn fn-type="conflict"><p><bold>Conflicts of Interest:</bold> The author declares that he has 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>J.</given-names> <surname>Stellato</surname></string-name></person-group>, &#x201C;<article-title>The Milky way and lentil beans</article-title>,&#x201D; <source>Science Scope</source>, vol. <volume>43</volume>, no. <issue>6</issue>, pp. <fpage>44</fpage>&#x2013;<lpage>49</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Erlic</surname></string-name></person-group>, <source>Galaxies</source>, New York, USA: <publisher-name>Weigl Publishers</publisher-name>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>S. P.</given-names> <surname>Driver</surname></string-name>, <string-name><given-names>R. A.</given-names> <surname>Windhorst</surname></string-name> and <string-name><given-names>R. E.</given-names> <surname>Griffiths</surname></string-name></person-group>, &#x201C;<article-title>The contribution of late-type/irregulars to the faint galaxy counts from HST medium deep survey images</article-title>,&#x201D; arXiv preprint astro-ph/9511123, <year>1995</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>M.</given-names> <surname>Rajesvari</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Sinha</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Saxena</surname></string-name> and <string-name><given-names>S. A.</given-names> <surname>Mukerji</surname></string-name></person-group>, &#x201C;<article-title>Deep learning approach to classify the galaxies for astronomy applications</article-title>,&#x201D; <source>OSR-JEEE</source>, vol. <volume>15</volume>, pp. <fpage>35</fpage>&#x2013;<lpage>39</lpage>, <year>2020</year>.</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>M.</given-names> <surname>Reza</surname></string-name></person-group>, &#x201C;<article-title>Galaxy morphology classification using automated machine learning</article-title>,&#x201D; <source>Astronomy and Computing</source>, vol. <volume>37</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>11</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Misra</surname></string-name>, <string-name><given-names>S. N.</given-names> <surname>Mohanty</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Agarwal</surname></string-name> and <string-name><given-names>S. K.</given-names> <surname>Gupta</surname></string-name></person-group>, &#x201C;<chapter-title>Convoluted cosmos: Classifying galaxy images using deep learning</chapter-title>,&#x201D; in <source>Advances in Intelligent Systems and Computing</source>, vol. <volume>1042</volume>, <publisher-loc>Singapore</publisher-loc>: <publisher-name>Springer</publisher-name>, pp. <fpage>569</fpage>&#x2013;<lpage>579</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Biswas</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Adlak</surname></string-name></person-group>, &#x201C;<article-title>Classification of galaxy morphologies using artificial neural network</article-title>,&#x201D; in <conf-name>2018 4th Int. Conf. for Convergence in Technology (I2CT)</conf-name>, <conf-loc>Mangalore, India</conf-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>4</lpage>, <year>2018</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>T. -Y.</given-names> <surname>Cheng</surname></string-name>, <string-name><given-names>C. J.</given-names> <surname>Conselice</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Arag&#x00F3;n-Salamanca</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>A. F. L.</given-names> <surname>Bluck</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Optimizing automatic morphological classification of galaxies with machine learning and deep learning using dark energy survey imaging</article-title>,&#x201D; <source>Monthly Notices of the Royal Astronomical Society</source>, vol. <volume>493</volume>, no. <issue>3</issue>, pp. <fpage>4209</fpage>&#x2013;<lpage>4228</lpage>, <year>2020</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>T. -Y.</given-names> <surname>Cheng</surname></string-name>, <string-name><given-names>C. J.</given-names> <surname>Conselice</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Arag&#x00F3;n-Salamanca</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Aguena</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Allam</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Galaxy morphological classification catalogue of the dark energy survey year 3 data with convolutional neural networks</article-title>,&#x201D; <source>Monthly Notices of the Royal Astronomical Society</source>, vol. <volume>507</volume>, no. <issue>3</issue>, pp. <fpage>4425</fpage>&#x2013;<lpage>4444</lpage>, <year>2021</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>A.</given-names> <surname>Bastanfard</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Amirkhani</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Abbasiasl</surname></string-name></person-group>, &#x201C;<article-title>Automatic classification of galaxies based on SVM</article-title>,&#x201D; in <conf-name>2019 9th Int. Conf. on Computer and Knowledge Engineering (ICCKE)</conf-name>, <conf-loc>Mashhad, Iran</conf-loc>, pp. <fpage>32</fpage>&#x2013;<lpage>39</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>L. M.</given-names> <surname>Goyal</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Arora</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Pandey</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Mittal</surname></string-name></person-group>, &#x201C;<article-title>Morphological classification of galaxies using conv-nets</article-title>,&#x201D; <source>Earth Science Informatics</source>, vol. <volume>13</volume>, no. <issue>4</issue>, pp. <fpage>1427</fpage>&#x2013;<lpage>1436</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Abd Elaziz</surname></string-name>, <string-name><given-names>K. M.</given-names> <surname>Hosny</surname></string-name> and <string-name><given-names>I. M.</given-names> <surname>Selim</surname></string-name></person-group>, &#x201C;<article-title>Galaxies image classification using artificial bee colony based on orthogonal Gegenbauer moments</article-title>,&#x201D; <source>Soft Computing</source>, vol. <volume>23</volume>, no. <issue>19</issue>, pp. <fpage>9573</fpage>&#x2013;<lpage>9583</lpage>, <year>2019</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>K.</given-names> <surname>Kayaalp</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Metlek</surname></string-name></person-group>, &#x201C;<article-title>Classification of robust and rotten apples by deep learning algorithm</article-title>,&#x201D; <source>Sakarya University Journal of Computer and Information Sciences</source>, vol. <volume>3</volume>, no. <issue>2</issue>, pp. <fpage>112</fpage>&#x2013;<lpage>120</lpage>, <year>2020</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>K.</given-names> <surname>Kayaalp</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Metlek</surname></string-name></person-group>, &#x201C;<article-title>Prediction of fish species with deep learning</article-title>,&#x201D; <source>International Journal of 3D Printing Technologies and Digital Industry</source>, vol. <volume>5</volume>, no. <issue>3</issue>, pp. <fpage>569</fpage>&#x2013;<lpage>576</lpage>, <year>2021</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>R.</given-names> <surname>Vidhya</surname></string-name> and <string-name><given-names>T. T.</given-names> <surname>Mirnalinee</surname></string-name></person-group>, &#x201C;<article-title>Hybrid optimized learning for lung cancer classification</article-title>,&#x201D; <source>Intelligent Automation &#x0026; Soft Computing</source>, vol. <volume>34</volume>, no. <issue>2</issue>, pp. <fpage>911</fpage>&#x2013;<lpage>925</lpage>, <year>2022</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>A.</given-names> <surname>Aleem</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Tehsin</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Kausar</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Jameel</surname></string-name></person-group>, &#x201C;<article-title>Target classification of marine debris using deep learning</article-title>,&#x201D; <source>Intelligent Automation &#x0026; Soft Computing</source>, vol. <volume>32</volume>, no. <issue>1</issue>, pp. <fpage>73</fpage>&#x2013;<lpage>85</lpage>, <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>H. S.</given-names> <surname>Gill</surname></string-name>, <string-name><given-names>O. I.</given-names> <surname>Khalaf</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Alotaibi</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Alghamdi</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Alassery</surname></string-name></person-group>, &#x201C;<article-title>Fruit image classification using deep learning</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>71</volume>, no. <issue>3</issue>, pp. <fpage>5135</fpage>&#x2013;<lpage>5150</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Thamizhamuthu</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Manjula</surname></string-name></person-group>, &#x201C;<article-title>Skin melanoma classification system using deep learning</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>68</volume>, no. <issue>1</issue>, pp. <fpage>1147</fpage>&#x2013;<lpage>1160</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>I. M.</given-names> <surname>Nasir</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Alhaisoni</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Saba</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Rehman</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>A hybrid deep learning architecture for the classification of superhero fashion products: An application for medical-tech classification</article-title>,&#x201D; <source>Computer Modeling in Engineering &#x0026; Sciences</source>, vol. <volume>124</volume>, no. <issue>3</issue>, pp. <fpage>1017</fpage>&#x2013;<lpage>1033</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Barman</surname></string-name>, <string-name><given-names>R. K.</given-names> <surname>Dewang</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Mewada</surname></string-name></person-group>, &#x201C;<article-title>Facial recognition using grey wolf optimization</article-title>,&#x201D; <source>Materials Today: Proceedings</source>, vol. <volume>58</volume>, no. <issue>1</issue>, pp. <fpage>273</fpage>&#x2013;<lpage>285</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Muto</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Maeda</surname></string-name></person-group>, &#x201C;<article-title>Grey wolf optimization with momentum for function optimization</article-title>,&#x201D; <source>Artificial Life and Robotics</source>, vol. <volume>26</volume>, no. <issue>3</issue>, pp. <fpage>304</fpage>&#x2013;<lpage>311</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Q.</given-names> <surname>Fan</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Han</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Hu</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Beetle antenna strategy based grey wolf optimization</article-title>,&#x201D; <source>Expert Systems with Applications</source>, vol. <volume>165</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>19</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Shahverdi</surname></string-name> and <string-name><given-names>J. M.</given-names> <surname>Maestre</surname></string-name></person-group>, &#x201C;<article-title>Gray wolf optimization for scheduling irrigation water</article-title>,&#x201D; <source>Journal of Irrigation and Drainage Engineering</source>, vol. <volume>148</volume>, no. <issue>7</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>9</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F. A.</given-names> <surname>&#x015E;enel</surname></string-name>, <string-name><given-names>F.</given-names> <surname>G&#x00F6;k&#x00E7;e</surname></string-name>, <string-name><given-names>A. S.</given-names> <surname>Y&#x00FC;ksel</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Yi&#x011F;it</surname></string-name></person-group>, &#x201C;<article-title>A novel hybrid PSO&#x2013;GWO algorithm for optimization problems</article-title>,&#x201D; <source>Engineering with Computers</source>, vol. <volume>35</volume>, no. <issue>4</issue>, pp. <fpage>1359</fpage>&#x2013;<lpage>1373</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>E. S.</given-names> <surname>El-Kenawy</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Eid</surname></string-name></person-group>, &#x201C;<article-title>Hybrid gray wolf and particle swarm optimization for feature selection</article-title>,&#x201D; <source>International Journal of Innovative Computing, Information and Control</source>, vol. <volume>16</volume>, no. <issue>3</issue>, pp. <fpage>831</fpage>&#x2013;<lpage>844</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P. M.</given-names> <surname>Kitonyi</surname></string-name> and <string-name><given-names>D. R.</given-names> <surname>Segera</surname></string-name></person-group>, &#x201C;<article-title>Hybrid gradient descent grey wolf optimizer for optimal feature selection</article-title>,&#x201D; <source>BioMed Research International</source>, vol. <volume>2021</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>33</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Al-Wajih</surname></string-name>, <string-name><given-names>S. J.</given-names> <surname>Abdulkadir</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Aziz</surname></string-name>, <string-name><given-names>Q.</given-names> <surname>Al-Tashi</surname></string-name> and <string-name><given-names>N.</given-names> <surname>Talpur</surname></string-name></person-group>, &#x201C;<article-title>Hybrid binary grey wolf with harris hawks optimizer for feature selection</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>9</volume>, pp. <fpage>31662</fpage>&#x2013;<lpage>31677</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Wei</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Li</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Wind power curve modeling with hybrid copula and grey wolf optimization</article-title>,&#x201D; <source>IEEE Transactions on Sustainable Energy</source>, vol. <volume>13</volume>, no. <issue>1</issue>, pp. <fpage>265</fpage>&#x2013;<lpage>276</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z. H.</given-names> <surname>Yue</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Zhang</surname></string-name> and <string-name><given-names>W. D.</given-names> <surname>Xiao</surname></string-name></person-group>, &#x201C;<article-title>A novel hybrid algorithm based on grey wolf optimizer and fireworks algorithm</article-title>,&#x201D; <source>Sensors (Switzerland)</source>, vol. <volume>20</volume>, no. <issue>7</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>17</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X. P.</given-names> <surname>Zhu</surname></string-name>, <string-name><given-names>J. M.</given-names> <surname>Dai</surname></string-name>, <string-name><given-names>C. J.</given-names> <surname>Bian</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Chen</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Galaxy morphology classification with deep convolutional neural networks</article-title>,&#x201D; <source>Astrophysics and Space Science</source>, vol. <volume>364</volume>, no. <issue>4</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>15</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Mirjalili</surname></string-name>, <string-name><given-names>S. M.</given-names> <surname>Mirjalili</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Lewis</surname></string-name></person-group>, &#x201C;<article-title>Grey wolf optimizer</article-title>,&#x201D; <source>Advances in Engineering Software</source>, vol. <volume>69</volume>, pp. <fpage>46</fpage>&#x2013;<lpage>61</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Song</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Tang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Zhao</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Li</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Grey Wolf Optimizer for parameter estimation in surface waves</article-title>,&#x201D; <source>Soil Dynamics and Earthquake Engineering</source>, vol. <volume>75</volume>, pp. <fpage>147</fpage>&#x2013;<lpage>157</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Mirjalili</surname></string-name></person-group>, &#x201C;<article-title>How effective is the grey wolf optimizer in training multi-layer perceptrons</article-title>,&#x201D; <source>Applied Intelligence</source>, vol. <volume>43</volume>, no. <issue>1</issue>, pp. <fpage>150</fpage>&#x2013;<lpage>161</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="thesis"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Tun&#x00E7;</surname></string-name></person-group>, &#x201C;<article-title>Using machine learning techniques of detect the credit availability for the financial sector</article-title>,&#x201D; M.S. Thesis, <publisher-name>Computer Enginnering, Sel&#x00E7;uk University</publisher-name>, <publisher-loc>Konya, Turkey, Country</publisher-loc>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Kennedy</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Eberhart</surname></string-name></person-group>, &#x201C;<article-title>Particle swarm optimization</article-title>,&#x201D; in <conf-name>Proc. of ICNN&#x2019;95-Int. Conf. on Neural Networks</conf-name>, <conf-loc>Perth, WA, Australia</conf-loc>, pp. <fpage>1942</fpage>&#x2013;<lpage>1948</lpage>, <year>1995</year>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Karaboga</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Basturk</surname></string-name></person-group>, &#x201C;<article-title>A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (ABC) algorithm</article-title>,&#x201D; <source>Journal of Global Optimization</source>, vol. <volume>39</volume>, no. <issue>3</issue>, pp. <fpage>459</fpage>&#x2013;<lpage>471</lpage>, <year>2007</year>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Leung</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Bovy</surname></string-name></person-group>, &#x201C;<article-title>Galaxy10 SDSS dataset&#x2014;astroNN 1.1.dev0 documentation</article-title>,&#x201D; 2022. <uri xlink:href="https://astronn.readthedocs.io/en/latest/galaxy10sdss.html">https://astronn.readthedocs.io/en/latest/galaxy10sdss.html</uri> (accessed on 17 March 2022).</mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. K.</given-names> <surname>Tripathi</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Sharma</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Bala</surname></string-name></person-group>, &#x201C;<article-title>A novel clustering method using enhanced grey wolf optimizer and MapReduce</article-title>,&#x201D; <source>Big Data Research</source>, vol. <volume>14</volume>, pp. <fpage>93</fpage>&#x2013;<lpage>100</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Lu</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Gao</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Hu</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Yan</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Chaotic-based grey wolf optimizer for numerical and engineering optimization problems</article-title>,&#x201D; <source>Memetic Computing</source>, vol. <volume>12</volume>, no. <issue>4</issue>, pp. <fpage>371</fpage>&#x2013;<lpage>398</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-40"><label>[40]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Gottam</surname></string-name>, <string-name><given-names>S. J.</given-names> <surname>Nanda</surname></string-name> and <string-name><given-names>R. K.</given-names> <surname>Maddila</surname></string-name></person-group>, &#x201C;<article-title>A CNN-LSTM model trained with grey wolf optimizer for prediction of household power consumption</article-title>,&#x201D; in <conf-name>Proc.-2021 IEEE Int. Symp. on Smart Electronic Systems, iSES 2021</conf-name>, MNIT Jaipur, Rajasthan, India, pp. <fpage>355</fpage>&#x2013;<lpage>360</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-41"><label>[41]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>T&#x00FC;t&#x00FC;nc&#x00FC;</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>&#x015E;ahman</surname></string-name> and <string-name><given-names>E.</given-names> <surname>Tu&#x015F;at</surname></string-name></person-group>, &#x201C;<article-title>A hybrid binary grey wolf optimizer for selection and reduction of reference points with extreme learning machine approach on local GNSS/leveling geoid determination</article-title>,&#x201D; <source>Applied Soft Computing</source>, vol. <volume>108</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>13</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-42"><label>[42]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Akbari</surname></string-name> and <string-name><given-names>M. R.</given-names> <surname>Hessami-Kermani</surname></string-name></person-group>, &#x201C;<article-title>Parameter estimation of muskingum model using grey wolf optimizer algorithm</article-title>,&#x201D; <source>MethodsX</source>, vol. <volume>8</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>15</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-43"><label>[43]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B. N.</given-names> <surname>Gohil</surname></string-name> and <string-name><given-names>D. R.</given-names> <surname>Patel</surname></string-name></person-group>, &#x201C;<article-title>Load balancing in cloud using improved gray wolf optimizer</article-title>,&#x201D; <source>Concurrency and Computation: Practice and Experience</source>, vol. <volume>34</volume>, no. <issue>11</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>13</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-44"><label>[44]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Nandan</surname></string-name> and <string-name><given-names>V.</given-names> <surname>Tripathi</surname></string-name></person-group>, &#x201C;<article-title>Galaxy shape categorization using convolutional neural network approach</article-title>,&#x201D; in <conf-name>2022 IEEE 11th Int. Conf. on Communication Systems and Network Technologies (CSNT)</conf-name>, Indore, India, pp. <fpage>287</fpage>&#x2013;<lpage>293</lpage>, <year>2022</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>












