Literature DB >> 34764580

A new clustering method for the diagnosis of CoVID19 using medical images.

Himanshu Mittal1, Avinash Chandra Pandey1, Raju Pal1, Ashish Tripathi2.   

Abstract

With the spread of COVID-19, there is an urgent need for a fast and reliable diagnostic aid. For the same, literature has witnessed that medical imaging plays a vital role, and tools using supervised methods have promising results. However, the limited size of medical images for diagnosis of CoVID19 may impact the generalization of such supervised methods. To alleviate this, a new clustering method is presented. In this method, a novel variant of a gravitational search algorithm is employed for obtaining optimal clusters. To validate the performance of the proposed variant, a comparative analysis among recent metaheuristic algorithms is conducted. The experimental study includes two sets of benchmark functions, namely standard functions and CEC2013 functions, belonging to different categories such as unimodal, multimodal, and unconstrained optimization functions. The performance comparison is evaluated and statistically validated in terms of mean fitness value, Friedman test, and box-plot. Further, the presented clustering method tested against three different types of publicly available CoVID19 medical images, namely X-ray, CT scan, and Ultrasound images. Experiments demonstrate that the proposed method is comparatively outperforming in terms of accuracy, precision, sensitivity, specificity, and F1-score.
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021.

Entities:  

Keywords:  Clustering; CoVID19 diagnosis; Gravitational search algorithm; Metaheuristic algorithm

Year:  2021        PMID: 34764580      PMCID: PMC7823179          DOI: 10.1007/s10489-020-02122-3

Source DB:  PubMed          Journal:  Appl Intell (Dordr)        ISSN: 0924-669X            Impact factor:   5.019


Introduction

With the rapid outbreak of the Corona virus Disease (CoVID19) around the globe [1], the World health organization (WHO) has been declared CoVID19 as a Public Health Emergency of International Concern (PHEIC) [2]. Pathogenically, the virus identified in CoVID19 is “severe acute respiratory syndrome coronavirus 2” (SARS- CoV-2) which is quite distinct from other respiratory viruses like MERS-CoV, SARS-CoV, avian influenza, and influenza [3]. Usual symptoms in a COVID19 patient are fever, dry cough, and tiredness. Other signs experienced by patients include sore throat, diarrhea, headache, loss of taste or smell, and rash on the skin and severely infected patients have symptoms of breathing difficulty, chest pain, and Multi-Organ Failure (MOF) [4]. Despite worldwide efforts to control the growth of CoVID19, the number of CoVID19 incidences is still rising at a reproduction rate of 3.77 [5]. Globally, there are over 6.15 million confirmed cases, out of which more than 2.63 million patients have recovered while 371,700 patients died, as of the date (1 June 2020) [6]. Moreover, USA with more than 1.8 million confirmed cases is the most severely affected country, followed by Brazil, Russia, United Kingdom, Spain, and Italy, with more than 200 thousand confirmed cases to date. India, being the second-largest population country, has also a significant rise in the number of CoVID19 cases. At the time of this writing article, there are nearly around 200 thousand confirmed cases in India with a death count of 5,394. Presently, there are no approved antiviral drugs or treatment regimens to cure COVID19 [4]. Meanwhile, real-time polymerase chain reaction (RT-PCR) can be conducted to confirm the diagnosis of CoVID19 [7]. However, it has been observed that this method has several limitations, such as time-consuming, low true-positive rates, and high false-negative rates [7, 8]. Due to the high communicable behavior of CoVID19, such limitations raises a major concern in the current epidemic situation. If an infected person is not diagnosed and treated timely, then the infected person may act as a carrier of the virus and spread it among healthy people unknowingly. Therefore, early identification of the infected people would help to quarantine them, which would be advantageous in declining the growth of CoVID19. As an alternative, clinical observations [9] have observed high sensitivity in diagnosing the CoVID19 through medical imaging modalities. There are irregular ground-glass opacities in chest images of the infected people [10]. Figures 1 and 2 illustrate representative samples of three medical imaging modalities, i.e. chest X-ray, chest CT-scan, and lung ultrasound images, of non-CoVID19 and CoVID19 patients, respectively. In general, the manual analysis of such images requires expert radiologists which makes this costly and error-prone process. To alleviate the same, computer-aided methods could facilitate as diagnostic aids for CoVID19. Fang et al. [11] has observed that the diagnosis of CoVID19 through imaging patterns in the chest images is much accurate than RT-PCR. Similar observations are also reported by Xie et al. [12]. Recently, many supervised learning methods have been proposed in which the concept of transfer learning is mainly applied in which a pre-trained deep learning model is used as a feature extractor. Deep learning models are not employed directly due to the unavailability of a large dataset of labeled chest images for CoVID19. Therefore, researchers have extracted deep features through transfer learning, and then, classification is performed through supervised models like decision tree, AdaBoost, support vector machine, and many more [4, 13].
Fig. 1

Representative sample images of non-CoVID19 patients: a chest Xray, b chest CT-scan, and c lung Ultrasound

Fig. 2

Representative sample images of CoVID19 patients: a chest Xray, shows opacities in the left lower and right upper lobes, b chest CT-scan, shows multifocal bilateral ground-glass opacities., and c lung Ultrasound, showing small sub-pleural consolidation and pleural irregularities

Representative sample images of non-CoVID19 patients: a chest Xray, b chest CT-scan, and c lung Ultrasound Representative sample images of CoVID19 patients: a chest Xray, shows opacities in the left lower and right upper lobes, b chest CT-scan, shows multifocal bilateral ground-glass opacities., and c lung Ultrasound, showing small sub-pleural consolidation and pleural irregularities Literature has witnessed that the accuracy attained by supervised learning on deep features, i.e. features extracted through transfer learning, is around 90%. However, the availability of limited medical images of CoVID19 may result in overfitting and thus impact the generalization ability of these learnable models. Moreover, the key requirement of supervised learning is labelled data [14, 15]. In such scenarios, literature has witnessed that unsupervised learning is quite efficient in determining patterns within the unlabelled data, especially clustering [16, 17]. Clustering methods induce inferences by discovering constitutional structures from the unlabelled dataset [18]. Therefore, the motivation of this paper is employing unsupervised learning on deep features for the diagnosis of CoVID19 from the medical chest images. In literature, one of the most popular unsupervised methods is Kmeans. Kmeans method clusters the unlabelled dataset into distinct unified clusters according to certain similarity measure [19]. Sometimes, Kmeans method suffers from a number of demerits like, biased towards initial clusters, converges pre-maturely, and produces local optima [20]. To mitigate such limitations, metaheuristic methods have been successful for clustering [21, 22]. Metaheuristic methods are mathematical models that mimic the unique optimization behavior of the natural systems [23]. Generally, metaheuristic methods have exhibited good performance on numerous nonlinear and complex optimization problems [24-26]. From the last two decades, they have been an integral part of many real-world applications ranging from design to business planning [27, 28]. Some popular metaheuristic methods are genetic algorithm [29], differential algorithm [30], particle swarm optimization [31], ant colony optimization [32], biogeography-based optimizer [33], and artificial bee colony [34]. There are many other phenomena in nature that have been utilized for solving other types of real-world problems [35]. One such common phenomenon is Newton’s law of gravity and motion which inspired Rashedi et al. [36] to introduce a new metaheuristic method termed as gravitational search algorithm (GSA). Gravitational search algorithm (GSA) has achieved effective results on many optimization problems like image segmentation, energy conservation, parameter selection, and clustering. A comprehensive survey of different applications of GSA is reviewed in [37]. The prominent attribute of GSA is the gravitational interaction among the considered solutions which makes it a unique and stable method [38]. Moreover, it updates solutions based on the fitness of each solution and distance among them, [39]. Further, it considers current solutions to achieve an optimal solution and requires only a single predefined parameter i.e., gravitational constant. [40]. Therefore, this paper leverages the strengthens of GSA for the optimal clustering of image features. GSA [36] is inspired by the Newtonian law of gravity and motion. It considers a swarm of solutions as objects which update the solution collectively. In GSA, every object interacts with other objects under the gravitational force. Initially, GSA explores the search space by allowing a high number of objects for interaction. The number of objects is linearly decreased to perform exploitation which is controlled by Kbest function [41]. In GSA, the fitness of an object determines its mass, and thus, a heavier object represents a better solution. Therefore, the position of the heaviest object corresponds to the optimal solution of the considered problem. Though GSA is quite efficient, there are still chances of improvement in the solution precision. Therefore, this paper presents a novel variant of GSA, improved GSA (IGSA), to enhance the vicinity to optimal solutions. Further, the proposed variant is employed to obtain optimal clusters in the proposed clustering method for the CoVID19 diagnosis. The overall contribution of this paper is four folds: A novel variant of the gravitational search algorithm, improved gravitational search algorithm (IGSA), is presented, A new clustering method, Kmeans-based improved gravitational search algorithm clustering (KIGSA-C) method, has been introduced for the diagnosis of CoVID19, An extensive experimental analysis of IGSA has been conducted against 16 metaheuristic algorithms over 17 standard benchmark functions belonging to unimodal and multimodal categories. Further, the real-parameter single-objective optimization problems from IEEE Congress on Evolutionary Computation (CEC) 2013 are considered to validate the performance of the proposed variant on translated and shifted benchmark functions. The results are studied over four different dimensional settings, i.e. 10, 30, 50, and 90, and The proposed KIGSA-C method is experimentally evaluated against two methods, namely Kmeans and Kmeans-based gravitational search algorithm clustering (KGSA-C). For experimental analysis, three types of medical chest images, i.e. X-ray, CT-scan, and Ultrasound images, of non-CoVID19 and CoVID19 patients are taken from the publicly available links. The effectiveness of the considered methods is compared in terms of confusion matrix along with five classification measures, namely sensitivity, specificity, precision, F1-score, and accuracy [42]. The organization of the paper is as follows; Section 2 discusses the related work. The feature extraction through transfer learning along with GSA is detailed in Section 3. Section 4 discusses the proposed method along with new variants of GSA followed with the experimental results in Section 5. Lastly, the conclusion is drawn in Section 6.

Related work

Xu et al. [43] used a convolutional neural network (CNN) for transfer learning on the CT images and performed classification between influenza-A viral and CoVID19 pneumonia with an accuracy of 86.7%. On the same lines, Wang et al. [44] used a modified inception model instead of CNN to obtain 89.5% accuracy. Further, Hemdan et al. [45] performed a comparative study of various deep learning models on the chest X-ray images and reported the best accuracy of 90.00%. However, Sethy et al. [46] extracted deep features from the X-ray images and then trained the support vector machine to classify between positive and negative cases. The proposed model achieved an accuracy of 95.38%. Further, Wang and Wong [47] modeled a deep learning framework, COVID-Net, for multi-class classification of chest X-ray images among normal, bacterial infection, viral infection, and CoVID19 infection. This study achieved an accuracy of 83.5%. For similar classes, Farooq and Hafeez [48] utilized a pre-trained ResNet-50 architecture and reported an accuracy of 96.23%. Further, Maghdid et al. [49] employed supervised methods on features obtained through AlexNet and obtained an accuracy of 94.00%. In literature, GSA has been modified or hybridized with different characteristics to improve its performance on various types of non-linear, non-differentiable, and large search space problems. Shaw et al. [50] used the concept of opposition-based learning to propose opposition-based GSA (OGSA), which achieved better solution precision. Chatterjee et al. [51] applied the wavelet theory in GSA and presented enhanced GSA (EGSA(I)) to improve the exploration ability. In [52], Mirjalili et al. introduced enhanced GSA (EGSA(II)) in which the velocity parameter incorporates the exploitation feature of PSO. Sarafrazi et al. [53] introduced enhanced GSA (EGSA(III)), which modified the position parameter with disruption operator. Moreover, a modified GSA was proposed by Niknam et al. [54] by incorporating a self-adaptive mutation method in GSA. Li et al. [55] introduced chaotic behavior in the position equation and presented a chaotic gravitational search algorithm (CGSA). Mirjalili et al. [56] proposed adaptive gbest GSA (GGSA) to improve the exploitation at later iterations. Further, Khajehzadeh et al. [57] employed an adaptive maximum velocity constraint in the modified gravitational search algorithm (MGSA(I)). The modified gravitational search algorithm (MGSA(II)) [58] uses the chaotic operator to prevent premature convergence. In piecewise-GSA (PGSA), Li et al. [59] modified the gravitational constant with piecewise equation. Similarly, Li et al. [60] proposed a weighted inertia mass for each object to accelerate convergence. To reduce the centre bias behavior of GSA, Davarynejad et al. [61] introduced a mass-dispersed gravitational search algorithm (mDGSA). Moreover, a chaotic Kbest gravitational search algorithm (CKGSA) [62] introduces chaotic behavior based on logistic mapping in Kbest function. It makes GSA escape the local optima as chaos behavior has shown better-searching behavior than stochastic [58, 63]. However, chaotic behavior is dependent on initial conditions which make this biased towards the initial settings. Mittal et al. [64] proposed logarithmic Kbest GSA (LKGSA) in which Kbest function decreases logarithmically which results in allowing heavier objects to exert force for more number of iterations. However, LKGSA performs exploration for a few iterations only. It diminishes the ability of the LKGSA to explore the search space exhaustively. Further, exponential Kbest GSA (EKGSA) [65] defines the exponentially decrease in Kbest which allows Kbest function to perform exploration at an early stage and exhaustive exploitation at the later stage. Although EKGSA shows exhaustive exploitation at later iterations, the convergence precision still lacks.

Preliminaries

Transfer learning as feature extraction

The availability of limited labeled data for a problem domain always leads the training of a deep learning model towards overfitting, especially when the number of samples in the data is much smaller in comparison to the data dimensionality [4]. Moreover, it has been witnessed in the literature that the performance of the raw deep learning model is not significant on CoVID19 images even if strategies like fine-tuning [66] and data augmentation [67], are applied to reduce the problem of limited or imbalanced data. To resolve this, the concept of transfer learning, termed as transfer learning as feature extractor (TLFE), is employed in which a pre-trained deep learning model learned on a cross-domain dataset is used as a feature extractor for the current dataset [4]. The extracted features are low in dimension, which is further utilized with other learning models to perform the classification. This strategy of transfer learning advantages the learning processing in many ways, such as overcoming overfitting, reducing computational time, and decreasing required resources [13]. Generally, there are two types of deep learning models, namely the convolutional neural network (CNN) and recurrent neural network (RNN). RNN models are better in understanding the textual data while CNN models are efficient in encoding the visual patterns from images [68]. Therefore, a pre-trained CNN model is utilized to extract the feature vectors from the image dataset.

Convolutional Neural Network (CNN)

In a CNN [69], there are generally four kinds of layers, namely convolutional layer, non-linear activation layer, pooling layer, and fully-connected layer. Different combinations of these layers present different CNN models. Along with these layers, different CNN models use different classification layers, like sigmoid or softmax, to perform the classification task. Figure 3 depicts the architecture of AlexNet model for image classification. There are many pre-trained CNN models publicly available for TLFE like AlexNet, VGG, ResNet, Inception, and MobileNet. [70]. In general, the convolutional layer performs the convolution operation of filtering the image features by applying ‘K’ kernels. The output generated from this layer is termed as feature maps. The non-linear activation layer brings non-linearity in the system by applying non-linear, continuous, and differential functions such as sigmoid, tanh, and rectified linear unit (ReLU). Generally, CNN prefers ReLU for a non-linear activation layer whose mathematically formulation is defined in (1). where, f(x) corresponds to the output ReLU function for the input value x. It can be observed that ReLU returns 0 if x is less than 0, else it attains x only. Figure 4 illustrates the same functioning of ReLU.
Fig. 3

A typical convolutional neural network (CNN) [71]

Fig. 4

Rectified Linear Unit (ReLU) [72]

A typical convolutional neural network (CNN) [71] Rectified Linear Unit (ReLU) [72] Further, the pooling layer is applied in CNN to perform down-sampling and fetch important structural features through either max-pooling or average-pooling. Max-pooling computes the maximum value in the considered region of an image while average-pooling calculates the average value over the studied region. Usually, a filter of size 2 × 2 is moved around the image to perform down-sampling. Moreover, it has been observed in the literature that the max-pooling layer is more efficient than the average-pooling layer in CNN models comparatively. Lastly, the fully-connected layer, alias dense layer, corresponds to the layer in which each node receives input from each node of the previous layer. To apply this layer in CNN, a flattening operation is performed first, which transforms visual features into feature vectors which are generated from the combination of convolutional, non-linear activation, and pooling layer. After that, CNN employs a set of fully-connected layers till the last layer, i.e. classification layer. The classification layer evaluates the probability and maps the computed feature vectors to class labels. If the classification problem is binary, then the sigmoid function is usually applied in the last layer, else softmax function is used for multi-class problems. To perform the feature extraction, the last layer of a pre-trained CNN model is truncated and the remaining combination of layers, i.e. convolutional, non-linear activation, pooling, and fully-connected, are used to extract the feature vector.

Gravitational Search Algorithm (GSA)

In GSA, a swarm of solutions is considered to update the solutions collectively. It assumes every solution as an object and allows them to interact with each other under the gravitational force. Initially, GSA explores the search space by allowing a high number of objects for interaction and linearly decreases the number of objects to perform exploitation. Specifically, the search strategy is controlled by the Kbest function. The larger value of this function represents exploration, while its lower value corresponds to the exploitation of GSA. Moreover, the fitness of an object determines its mass, and thus, a heavier object means a better solution with better fitness. Hence, GSA converges every object towards the heaviest one based on the laws of gravity and motion. Moreover, the position of the heaviest object corresponds to the optimal solution of the considered problem. Assume there are P objects in a d dimensional space, each object (X) can be represented as (2). where, corresponds to the position of i object in the r dimension. The position of the i object at t iteration is updated according to the (3). In (3), corresponds to the updated velocity of i object at t iteration and computed by (4). According to the law of motion, the acceleration () of each object is computed which is formulated in (5) for i object at t iteration. here, and M(t) correspond to the total force and mass of i object at t iteration respectively. GSA assumes gravitational mass and inertia mass of an object equal. Therefore, M is calculated in every iteration t by (6) for i object with fitness value (fit(t)) where best(t) and worst(t) are measure by (8) and (9) respectively for minimization problem. Moreover, the total force is defined as a randomly weighted sum of the force by other Kbest objects in r dimension and is defined as (10). where, rand ∈ [0,1] is a random number. F is the force of j object on i object and is computed by (11). In (10), Kbest is computed as (12) at t iteration. where max_it is the maximum number of iterations and final_per is the percentage of objects which apply force to others. Equation (12) shows that the value of Kbest decreases linearly over iterations. To illustrate the trend of the Kbest function, Fig. 5 depicts the number of iterations along the x-axis and values attained by this function along the y-axis. It is observable from the figure that the Kbest function decreases linearly. At the end of the stopping criteria, the position of the heaviest object among the Kbest objects defines the optimal solution. The pseudo-code of GSA is presented in Algorithm 1 [73].
Fig. 5

Kbest over iterations

Kbest over iterations

Proposed method

This paper presents a new clustering method, Kmeans-based improved gravitational search algorithm clustering (KIGSA-C) method, for the diagnosis of CoVID19 from medical chest images i.e., X-ray, CT-scan, and Ultrasound images. Figure 6 presents the architecture of the proposed method. First, the publicly available medical images of the infected and non-infected persons are collected. Then, the visual quality of all the collected images is improved through pre-processing. Here, standard normalization techniques of image processing are applied. Next, the feature extraction phase is performed in which a pre-trained CNN model acts as TLFE and aids in extracting prominent deep features for each input image.
Fig. 6

The workflow of the proposed method

The workflow of the proposed method Since the initial population of a metaheuristic algorithm is initialized randomly, this may impact the algorithm convergence as well as may lead it to local optima. Therefore, the extracted features are optimally clustered through Kmeans-based improved gravitational search algorithm (KIGSA). In KIGSA, the solutions obtained from Kmeans are used for the population initialization of the proposed variant, improved gravitational search algorithm (IGSA). Further, the proposed IGSA updates the solutions to obtain optimal cluster centroids. The objective function considered by IGSA to obtain the optimal solution is the sum of squared Euclidean distance between the features and corresponding cluster centroid. Further, (13) equates the mathematical formulation for the considered objective function. where, C and x correspond to the i cluster centroid and j feature vector, respectively. Moreover, N represents the number of feature vectors, while n depicts the number of clusters to be formed. As the diagnosis of CoVID19 is a binary classification problem, the number of formed clusters is two. Finally, the obtained optimal cluster centroids are used to perform the mapping of input image features with labels. Further, the pseudo-code of the proposed method is described in Algorithm 2. The proposed variant, improved gravitational search algorithm (IGSA), is detailed in the following section.

Proposed improved GSA (IGSA)

In GSA, the Kbest function regulates the trade-off between exploration and exploitation. This function determines the ‘K’ number of best solutions which apply the gravitational force in an iteration and its value decreases linearly with increasing iterations. Hence, the transition from exploration to exploitation in GSA is linear [74]. Moreover, in later iterations, the small value of Kbest results in reduced exploration ability [75]. Henceforth, the probability of GSA to trap into local optimum increases [76] which results in lacking the ability to achieve better solution precision. To alleviate the same, a novel variant of GSA, improved gravitational search algorithm (IGSA), is proposed in which the Kbest function is modified. Equation 14 formulates the mathematical definition of the new Kbest function at t iteration. where, P, max_it and final_per correspond to population size, maximum iterations, and minimum percentage of objects, respectively. Further, Fig. 7 illustrates different values attained by the modified Kbest over 1000 iterations for P as 50.
Fig. 7

Modified Kbest over iterations

Modified Kbest over iterations It can be observed from Fig. 7 that modified Kbest does not decrease linearly. Moreover, it starts favouring exploitation over exploration after a few iterations. It results in achieving better solution precision as heavier objects exploit the search space over more iterations comparatively.

Time complexity of KIGSA-C method

The time complexity of the proposed method to perform clustering is defined as follows: Further, each individual of KIGSA-C method is initialized with Kmeans and updated according to IGSA based on the defined objective function. Therefore, the time complexity of the proposed method is defined as O(N x k x t + P2 + N x k). The time complexity of Kmeans is O(N x k x t) where N, k, and t correspond to the number of feature vectors, number of clusters, and number of iterations respectively. As IGSA is a variant of GSA, the time complexity is similar to GSA which is O(P2) [77], where P is the population size. The considered objective function has the computation complexity as O(N× k).

Experimental results

The experimental evaluation is conducted in two sections. Section 5.1 performs an extensive analysis of the proposed variant against recent metaheuristic algorithms. Two sets of benchmark functions, namely Standard benchmark functions (F1 − F17) and IEEE Congress on Evolutionary Computation (CEC), 2013 benchmark functions (C1 − C28), are considered which include unimodal, multimodal, and real parameter single-objective optimization problems of IEEE Congress on Evolutionary Computation (CEC), 2013. Section 5.2 studies the efficiency of the proposed clustering method over three publicly available medical chest image datasets for CoVID19, namely X-ray, CT-scans, and Ultrasound images. All experiments are simulated using a computer with a 2.35 GHz Intel Core i5 processor and 16 GB of RAM with Matlab 2017a.

Performance analysis of IGSA

Table 1 describes the first set (S1) of benchmark functions consisting of (F1 − F17) functions [27] along with their definitions, range of features, global minimum fitness, optimal position values, and categories. Moreover, to validate the robustness, the second set (S2) contains (C1 − C28) real-parameter single-objective unconstrained optimization functions [78] which are briefed in Table 2. The performance has been evaluated and statistically analyzed in terms of mean fitness value, Friedman test, and box-plot. To perform the comparative analysis, the new variant have been compared with standard GSA and nine variants of GSA, namely OGSA [50], mDGSA [61], GGSA [56], PGSA [59], MGSA(I) [57], MGSA(II) [58], EGSA(I) [51], EGSA(II) [52], and EGSA(III) [53]. The comparison also includes the performance results with three recent metaheuristic algorithms, namely modified particle swarm optimization (MPSO) [79], shuffled differential evolutionary (SDE) [80], and spiral biogeography based optimizer (SBBO) [81]. Moreover, the algorithms are evaluated over 10, 30, 50, and 90 dimensions for each benchmark function. 30 run of each experiment is conducted to minimize the interference [82]. Table 3 details the parameter settings of all the considered algorithms which are taken from their respective literature. The parameter values of the proposed algorithm have been decided empirically by testing its performance on different parameter values of standard GSA algorithm.
Table 1

The considered standard benchmark functions [27]

S.No.FunctionEquationRangeO.V.O.P.Category
1.Ackley \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$ F_{1}(X) = -20 e^{-0.02 \sqrt {d^{-}1{\sum }_{i=1}^{d} {x_{i}^{2}}}} - e^{d^{-}1 {\sum }_{i=1}^{d} cos(2\pi x_{i})} + 20 + e$\end{document}F1(X)=20e0.02d1i=1dxi2ed1i=1dcos(2πxi)+20+e[-35 to 35]0(0,…,0)MM
2.Alpine \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$ F_{2}(X) = {\sum }_{i=1}^{d} |x_{i} \sin \limits (x_{i}) + 0.1 x_{i}|$\end{document}F2(X)=i=1d|xisin(xi)+0.1xi|[-10 to 10]0(0,…,0)MM
3.Brown \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$ F_{3}(X) = {\sum }_{i=1}^{d-1} ({x_{i}^{2}})^{(x_{i+1}^{2}+1)} + (x_{i+1}^{2})^{({x_{i}^{2}}+1)}$\end{document}F3(X)=i=1d1(xi2)(xi+12+1)+(xi+12)(xi2+1)[-1 to 4]0(0,…,0)UM
4.Dixon and Price \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$ F_{4}(X) = (x_{1}-1)^{2} + {\sum }_{i=2}^{d}i(2{x_{i}^{2}}-x_{i-1})^{2} $\end{document}F4(X)=(x11)2+i=2di(2xi2xi1)2[-10 to 10]0 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$2^{\frac {-(2^{i}-2)} {(2^{i})}}$\end{document}2(2i2)(2i), i = 1,2,…,dUM
5.Griewank \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$ F_{5}(X) = 1 + {\sum }_{i=1}^{d} \frac {{x_{i}^{2}}}{4000} - {\prod }_{i=1}^{d} \cos \limits (\frac {x_{i}}{\sqrt {i}}) $\end{document}F5(X)=1+i=1dxi24000i=1dcos(xii)[-600 to 600]0(0,…,0)MM
6.Pathological \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$ F_{6}(X) = {\sum }_{i=1}^{d-1} \left (0.5 + \frac {\sin \limits ^{2} \sqrt { 100{x_{i}^{2}} + x_{i+1}^{2}} - 0.5} {1 + 0.001 ({x_{i}^{2}} - 2x_{i}x_{i+1} + x_{i+1}^{2})^{2}} \right ) $\end{document}F6(X)=i=1d10.5+sin2100xi2+xi+120.51+0.001(xi22xixi+1+xi+12)2[-100 to 100]0(0,…,0)MM
7.Quartic \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$ F_{7}(X) = {\sum }_{i=1}^{d} i {x_{i}^{4}} $\end{document}F7(X)=i=1dixi4[-1.28 to 1.28]0(0,…,0)UM
8.Rosenbrock’s \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$ F_{8}(X) = {\sum }_{i=1}^{d-1} [100(x_{i+1} - {x_{i}^{2}})^{2} + (x_{i}-1)^{2}] $\end{document}F8(X)=i=1d1[100(xi+1xi2)2+(xi1)2][-30 to 30]0(1,…,1)UM
9.Rosenbrock and Yang’s \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$ F_{9}(X) = {\sum }_{i=1}^{d-1}\begin {bmatrix}100 \epsilon _{i} (x_{i+1}-{x_{i}^{2}})^{2} + (x_{i}-1)^{2} \end {bmatrix} $\end{document}F9(X)=i=1d1100𝜖i(xi+1xi2)2+(xi1)2[-30 to 30]0(1,…,1)UM
10.Rotated Hyper-Ellipsoid \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$ F_{10}(X) = {\sum }_{i=1}^{d} {\sum }_{j=1}^{i} {x_{j}^{2}} $\end{document}F10(X)=i=1dj=1ixj2[-65.536 to 65.536]0(0,…,0)UM
11.Schumer Steiglitz \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$ F_{11}(X) = {\sum }_{i=1}^{d} {x_{i}^{4}} $\end{document}F11(X)=i=1dxi4[-100 to 100]0(0,…,0)UM
12.Schwefel2 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$ F_{12}(X) = {\sum }_{i=1}^{d} \left ({\sum }_{j=1}^{i} x_{j}\right )^{2} $\end{document}F12(X)=i=1dj=1ixj2[-65.536 to 65.536]0(0,…,0)UM
13.Schwefel3 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$ F_{13}(X) = {\sum }_{i=1}^{d} |x_{i}| + {\prod }_{i=1}^{d} |x_{i}| $\end{document}F13(X)=i=1d|xi|+i=1d|xi|[-10 to 10]0(0,…,0)MM
14.Schwefel4 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$ F_{14}(X) = \max \limits _{i}(|x_{i}|:i\space \epsilon \space \left \{1,\cdots ,d\right \}) $\end{document}F14(X)=maxi(|xi|:i𝜖1,,d)[-100 to 100]0(0,…,0)UM
15.Step \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$ F_{15}(X) = {\sum }_{i=1}^{d} (\lfloor |x_{i}|\rfloor ) $\end{document}F15(X)=i=1d(|xi|)[-100 to 100]0(0,…,0)UM
16.Trigonometric \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$ F_{16}(X) = {\sum }_{i=1}^{d} [d - {\sum }_{j=1}^{d} {\cos \limits } x_{j} + i (1 - cos(x_{i}) - sin(x_{i}))]^{2} $\end{document}F16(X)=i=1d[dj=1dcosxj+i(1cos(xi)sin(xi))]2[0 to pi]0(0,…,0)MM
17.Zakharov \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$ F_{17}(X) = {\sum }_{i=1}^{d} {x_{i}^{2}} + (\frac {1}{2} {\sum }_{i=1}^{d} ix_{i})^{2} + (\frac {1}{2} {\sum }_{i=1}^{d} ix_{i})^{4}$\end{document}F17(X)=i=1dxi2+(12i=1dixi)2+(12i=1dixi)4[-5 to 10]0(0,…,0)MM

O.V.: Optimal Value; O.P.: Optimal Position; UM : Uni-Modal; MM : Multi-Modal

Table 2

Description of considered real-parameter single objective optimization problems of CEC, 2013 [78]

Sr. No.FunctionRangeOptimal valueCategory
C1Sphere[-100 to 100]-1400UM
C2Rotated High Conditioned Elliptic[-100 to 100]-1300UM
C3Rotated Bent Cigar[-100 to 100]-1200UM
C4Rotated Discus[-100 to 100]-1100UM
C5Different Powers[-100 to 100]-1000UM
C6Rotated Rosenbrock[-100 to 100]-900MM
C7Rotated Schaffers F7[-100 to 100]-800MM
C8Rotated Ackley[-100 to 100]-700MM
C9Rotated Weierstrass[-100 to 100]-600MM
C10Rotated Griewank[-100 to 100]-500MM
C11Rastrigin[-100 to 100]-400MM
C12Rotated Rastrigin[-100 to 100]-300MM
C13Non-Continuous Rotated Rastrigin[-100 to 100]-200MM
C14Schwefel[-100 to 100]-100MM
C15Rotated Schwefel[-100 to 100]100MM
C16Rotated Katsuura[-100 to 100]200MM
C17Lunacek Bi_Rastrigin[-100 to 100]300MM
C18Rotated Lunacek Bi_Rastrigin[-100 to 100]400MM
C19Expanded Griewank plus Rosenbrock[-100 to 100]500MM
C20Expanded Scaffer F6[-100 to 100]600MM
C21CP 1 (n = 5,Rotated)[-100 to 100]700CP
C22CP 2 (n = 3,Unrotated)[-100 to 100]800CP
C23CP 3 (n = 3,Rotated)[-100 to 100]900CP
C24CP 4 (n = 3,Rotated)[-100 to 100]1000CP
C25CP 5 (n = 3,Rotated)[-100 to 100]1100CP
C26CP 6 (n = 5,Rotated)[-100 to 100]1200CP
C27CP 7 (n = 5,Rotated)[-100 to 100]1300CP
C28CP 8 (n = 5,Rotated)[-100 to 100]1400CP

UM : Unimodal; MM : Multimodal; CP : Composition

Table 3

Parameter settings of the considered algorithms

ParameterValue
Number of runs30
Population size (P)50
Maximum iterations1000
Number of dimensions (Dims.)10, 30, 50, 90
MPSO
Inertial Constant (w)0.5
Congnitive Constant (c1)0.6
Social Constant (c2)0.4
SDE
Weighting Factor (F)0.3
Crossover Constant (CR)0.7
SBBO
Habitat modification probability0.8
Immigration probability0.7
Mutation probability0.005
GSA and its variants
Gconstant (G0)100
The considered standard benchmark functions [27] O.V.: Optimal Value; O.P.: Optimal Position; UM : Uni-Modal; MM : Multi-Modal Description of considered real-parameter single objective optimization problems of CEC, 2013 [78] UM : Unimodal; MM : Multimodal; CP : Composition Parameter settings of the considered algorithms Tables 4 and 5 tabulate the mean fitness values of the considered algorithms for S1 set (F1 − F10) and (F11 − F17) respectively. Furthermore, Tables 6, 7, and 8 show results on the S2 set (C1 − C10), (C11 − C20), and (C21 − C28) respectively. In tables, best values are made bold. It can be observed that the IGSA has shown better results comparatively. On S1 benchmark functions, IGSA obtained superior results on 53%, 71%, 59%, and 65% of 17 problems for each 10, 30, 50, and 90 dimensions respectively. While on the S2 problems, IGSA outperformed compared algorithms on 54%, 61%, 50%, and 58% out of 28 problems on the respective dimensions. Thus, it can be seen that IGSA attains better trade-off between exploration and exploitation on different complexities functions.
Table 4

Comparative analysis of existing and new algorithms for mean fitness values over 30 runs on the benchmark functions (F1 − F10) for different dimensions

Fn.DMPSOSDESBBOGSAOGSAmDGSAGGSAPGSAMGSA(I)MGSA(II)EGSA(I)EGSA(II)EGSA(III)LKGSACKGSAEKGSAIGSA
F1102.194E-444.423E-281.688E-127.608E-193.318E-186.872E-197.338E-047.961E + 011.557E-201.078E-157.983E-231.962E + 001.866E-237.222E-197.533E-195.923E-195.655E-52
302.245E-142.464E-162.068E-021.275E-085.886E-179.940E-181.021E-033.804E + 012.190E-191.089E-141.059E + 022.194E + 011.571E-219.795E-189.620E-183.380E-032.846E-27
502.572E-053.198E-051.367E + 011.494E-041.765E + 037.428E-177.407E + 003.988E + 012.213E + 037.342E-146.736E-1065.906E + 013.257E-181.767E + 041.825E-161.490E-111.341E-171
902.276E-014.663E + 001.166E + 021.575E-041.873E + 043.558E-168.127E + 001.265E + 032.443E + 041.609E-034.433E-1042.769E + 027.100E + 007.322E + 041.768E-157.557E-091.610E-165
F2109.679E-113.239E-151.304E-072.577E-095.316E-092.483E-093.096E-024.986E-023.543E-107.807E-081.452E-183.661E + 001.242E-112.435E-092.369E-091.826E-126.526E-19
303.061E-219.289E-463.786E-023.097E + 012.617E + 001.482E-081.055E-011.446E-012.219E-094.354E-078.005E + 002.702E + 011.865E-101.612E-081.557E-082.455E-019.899E-221
506.716E-025.974E-041.530E + 002.671E + 004.795E + 015.600E-086.291E + 003.180E-019.128E-021.338E-067.939E-575.209E + 012.069E-045.638E-037.367E-083.955E-053.223E-109
903.333E + 008.105E-016.325E + 009.292E + 001.366E + 023.899E-031.035E + 013.053E + 002.739E + 016.665E-012.017E-551.127E + 022.939E-012.424E + 003.188E-021.216E-025.903E-107
F3102.298E-532.941E + 021.153E-041.396E-181.118E-171.482E-182.192E-032.254E + 025.068E-202.414E-150.000E + 006.037E + 007.869E-231.184E-181.328E-184.757E-698.682E-78
308.822E-046.959E + 031.213E + 012.743E-031.614E + 032.792E-031.473E-028.260E + 028.878E-181.032E-135.098E + 025.512E + 021.448E-019.152E-175.188E-172.130E-028.408E-19
503.753E + 028.962E + 041.179E + 038.053E + 041.400E + 041.478E + 025.786E + 011.073E + 032.429E + 043.684E + 034.628E + 033.065E + 039.172E + 021.144E + 054.307E + 023.843E + 021.778E-47
905.454E + 033.120E + 051.418E + 045.263E + 057.851E + 056.288E + 025.555E + 013.797E + 038.216E + 041.318E + 042.575E + 041.017E + 043.846E + 035.109E + 052.949E + 032.406E + 035.849E-37
F4101.072E-611.066E-112.453E-045.846E-101.281E-096.203E-101.569E-021.123E-021.077E-102.140E-081.636E-2297.704E-013.448E-125.734E-105.944E-108.839E-062.067E-231
308.905E-037.202E-073.277E-011.043E + 001.983E + 001.875E-091.415E-023.383E-014.389E-106.874E-085.896E + 001.825E + 001.142E-102.224E-092.032E-093.656E-028.346E-216
501.963E + 002.325E + 012.013E + 004.139E + 011.665E + 013.394E-059.813E-018.988E + 004.170E + 011.015E-022.058E-336.923E + 003.641E + 002.797E + 011.206E + 001.455E + 008.185E + 00
905.798E + 007.416E + 014.542E + 005.669E + 011.897E + 011.528E + 008.832E-011.226E + 015.076E + 015.627E + 001.404E + 011.106E + 011.063E + 014.946E + 017.839E + 007.741E + 001.321E-22
F5101.536E + 005.428E + 033.908E + 004.397E-021.982E + 014.363E-021.309E-011.794E + 068.136E-015.892E-038.700E + 003.137E + 021.304E-022.479E-134.212E-051.290E + 001.121E-01
303.334E + 012.800E + 015.907E + 015.180E + 014.031E + 012.040E + 012.415E + 013.727E + 052.924E + 011.991E + 012.971E + 007.006E + 031.964E + 012.815E + 001.701E + 002.056E + 001.051E + 00
501.220E + 021.866E + 025.040E + 024.706E + 011.104E + 064.625E + 014.829E + 024.719E + 032.594E + 045.214E + 014.888E + 012.938E + 046.427E + 011.111E + 024.475E + 014.419E + 013.896E + 05
906.215E + 028.226E + 032.088E + 038.732E + 011.675E + 068.642E + 015.474E + 027.587E + 031.686E + 067.344E + 028.886E + 011.321E + 051.055E + 035.388E + 048.478E + 011.263E + 022.019E + 06
F6109.547E-339.547E-333.021E-127.815E-193.832E-187.177E-197.548E-043.885E-041.706E-201.105E-156.041E-022.032E + 001.813E-236.052E-197.175E-193.975E-286.050E-37
302.521E-325.872E-271.798E-021.388E-085.550E-171.067E-171.117E-032.007E-032.688E-191.027E-141.294E + 022.110E + 012.096E-211.026E-178.892E-182.691E-032.988E-01
501.115E-043.828E-051.294E + 014.016E-021.026E + 036.454E-175.859E + 001.242E + 012.785E + 037.382E-141.466E + 005.702E + 011.584E + 023.507E-181.024E-161.255E-112.237E + 02
903.622E-014.913E + 001.160E + 024.727E-011.046E + 041.478E-018.935E + 001.068E + 032.573E + 048.140E-041.344E + 013.287E + 021.153E + 017.707E + 041.734E-154.813E-094.612E-16
F7104.452E-041.090E-031.549E-042.674E-037.153E-031.290E-033.516E-052.394E + 016.742E-044.238E-034.559E-063.761E-016.146E-048.918E-035.951E-031.153E-024.924E-04
308.753E-034.689E-037.869E-046.930E-038.450E-028.919E-035.467E-051.071E + 026.903E-032.164E-027.807E + 002.953E + 013.365E-037.968E-024.351E-021.092E-017.322E-06
502.997E-017.953E-029.287E-031.380E-035.523E + 002.292E-027.384E-039.789E + 011.209E-017.888E-027.986E-021.717E + 024.101E-023.676E-011.269E-011.143E-013.387E-05
906.485E + 023.938E-013.376E-027.628E-044.736E + 017.379E-021.546E-021.356E + 028.546E-014.730E-014.765E-017.552E + 023.581E-013.263E-053.376E-013.726E-011.821E + 02
F8105.111E + 021.204E + 031.445E + 035.753E + 021.012E + 035.692E + 022.083E + 035.041E + 028.581E + 024.372E + 024.823E + 024.200E + 023.919E + 025.116E + 025.237E + 025.253E + 022.095E + 03
304.810E + 031.047E + 046.318E + 033.445E + 036.910E + 026.310E + 021.046E + 046.178E + 025.053E + 031.604E + 031.358E + 034.368E + 032.270E + 037.551E + 025.271E + 025.443E + 023.915E + 02
509.030E + 031.116E + 041.115E + 041.633E + 046.094E + 021.190E + 031.796E + 041.491E + 037.522E + 031.874E + 031.493E + 038.114E + 031.811E + 031.606E + 031.546E + 031.764E + 031.166E + 03
901.568E + 041.518E + 041.990E + 043.401E + 041.253E + 032.455E + 033.132E + 042.375E + 031.122E + 043.713E + 032.652E + 031.615E + 043.307E + 032.762E + 032.732E + 032.485E + 032.304E + 03
F9101.405E + 001.927E + 017.921E + 002.965E + 002.020E + 015.658E-013.118E + 001.146E + 205.697E + 003.609E + 005.909E + 013.638E + 012.556E + 001.218E + 015.443E + 001.175E + 011.024E + 00
302.840E + 013.387E-103.275E + 016.666E + 011.025E + 021.266E + 001.071E + 015.496E + 123.175E + 011.972E + 011.755E + 022.216E + 021.393E + 015.147E + 042.189E + 011.133E + 011.010E + 00
501.110E + 022.002E + 027.090E + 012.357E + 011.757E + 029.045E-019.744E + 016.979E + 086.892E + 013.781E + 013.148E + 024.480E + 023.012E + 011.085E + 025.780E + 014.622E + 011.322E + 01
903.393E + 025.874E + 021.848E + 021.218E + 014.436E + 023.075E + 003.468E + 022.614E + 071.689E + 027.697E + 019.768E + 018.922E + 026.720E + 011.565E + 021.328E + 028.349E + 015.727E + 02
F10104.371E-153.948E-023.800E-071.252E-095.879E-031.255E-092.833E-021.416E + 001.906E-104.256E-088.882E-163.126E + 005.940E-121.188E-091.167E-094.371E-153.257E-15
301.187E-147.994E-153.444E-022.035E + 001.395E-012.303E-092.341E-023.030E-014.362E-107.728E-085.789E + 004.779E + 003.357E-112.323E-092.451E-094.702E-028.882E-16
502.247E-011.346E-031.221E + 004.764E-151.028E + 015.094E-092.764E + 005.140E-019.726E + 001.483E-075.065E + 005.569E + 001.153E-095.884E + 008.882E-161.517E-067.306E + 00
901.822E + 007.202E-012.752E + 004.118E-151.004E + 018.161E-092.903E + 001.226E + 001.602E + 017.269E-013.124E + 006.132E + 003.873E-018.052E + 001.923E-083.126E-018.882E-16

Bold font : Best value

Table 5

Comparative analysis of existing and new algorithms for mean fitness values over 30 runs on the benchmark functions (F11 − F17) for different dimensions

Fn.DMPSOSDESBBOGSAOGSAmDGSAGGSAPGSAMGSA(I)MGSA(II)EGSA(I)EGSA(II)EGSA(III)LKGSACKGSAEKGSAIGSA
F11101.005E-011.558E-012.723E-023.043E-034.225E-023.332E-036.363E-044.836E + 102.580E-013.813E-038.313E-042.409E-013.525E-031.073E + 004.637E-037.701E-032.081E-05
301.499E-029.350E-026.302E-021.253E-021.906E + 025.606E + 026.430E-042.383E + 591.024E + 001.413E-161.064E + 007.192E-011.793E-031.708E + 012.408E + 017.708E-041.398E-05
507.391E-031.713E-041.117E + 004.755E + 011.193E + 031.620E + 018.643E-011.432E + 1187.789E + 015.145E-031.810E + 001.759E + 011.594E + 019.146E + 024.379E + 011.532E + 012.902E + 00
901.415E-029.958E-012.038E + 001.290E-022.226E + 035.030E + 017.315E-011.338E + 1254.412E + 025.751E-021.388E-024.393E + 014.509E + 011.869E + 032.779E + 025.304E + 012.902E + 00
F12101.267E-247.317E-021.603E-141.548E-206.559E-021.585E-012.063E-052.472E + 113.129E-222.582E-177.002E-031.266E-013.473E-257.185E-011.222E-204.188E-064.712E-32
301.687E-321.571E-324.435E-056.047E + 004.757E + 003.769E-028.548E-068.837E + 074.712E-027.861E-174.891E + 006.155E-011.174E-233.315E-015.638E-209.443E-039.343E-03
502.791E-072.078E-052.227E-023.438E-034.466E + 021.131E-022.350E-021.160E + 011.377E + 012.262E-027.833E-015.900E + 001.585E-018.581E + 004.523E-025.089E-028.390E + 00
904.204E-011.213E + 012.114E-011.083E + 016.562E + 032.207E-021.236E-024.203E + 025.484E + 061.698E + 001.058E + 001.805E + 011.850E + 001.554E + 046.871E-016.984E-015.983E-03
F13101.350E-323.232E-031.290E-136.896E-201.107E-038.087E-209.101E-051.359E + 2911.591E-211.198E-162.425E-023.393E-016.760E-247.081E-201.547E-042.374E-041.763E-24
301.998E-037.514E-025.789E-044.908E-036.169E-019.187E-191.355E-041.495E + 2082.554E-201.115E-153.493E + 036.942E + 001.565E-223.139E-019.989E-042.293E-031.350E-32
503.020E-039.832E-055.564E-012.215E-015.756E + 041.952E + 015.690E-013.694E + 533.966E + 021.032E-013.158E + 004.011E + 011.748E + 009.468E + 011.998E-031.131E-015.838E-18
901.013E + 001.105E + 024.750E + 007.398E-011.922E + 061.719E + 026.212E-014.444E + 472.807E + 074.167E + 018.985E + 008.097E + 025.746E + 011.400E + 061.517E + 009.989E-042.329E-01
F14101.162E + 002.347E-013.081E + 005.412E-016.463E-013.933E + 003.553E-013.880E + 021.996E-033.033E-024.571E-011.953E-034.873E-011.872E-035.062E-016.337E-012.141E-02
301.346E + 001.996E-033.220E + 001.996E-034.507E-014.652E + 001.902E-013.065E + 021.996E-035.919E-031.955E + 001.857E-034.520E-014.863E + 002.043E-019.558E-014.533E-01
508.085E-011.996E-033.047E + 002.137E + 002.328E + 002.168E + 001.920E + 001.424E + 023.620E-015.458E-012.166E + 004.014E-021.799E + 004.785E + 001.996E-033.422E + 003.482E + 00
905.420E-011.996E-033.817E + 005.420E-013.003E + 002.523E + 002.283E + 001.404E + 023.015E + 006.812E-011.131E + 001.969E-021.172E + 003.990E + 002.520E + 003.683E + 001.996E-03
F15102.207E-041.022E-039.385E-049.122E-041.452E-031.014E-041.404E-032.874E + 042.737E-056.199E-043.291E-046.993E-043.301E-042.894E-044.981E-047.486E-062.717E-05
303.832E-041.021E-042.070E-032.177E-038.834E-041.694E-041.171E-033.364E + 047.486E-065.651E-041.648E-037.827E-043.252E-041.009E-034.355E-041.963E-043.123E-04
504.313E-043.025E-042.365E-033.962E-044.012E-032.842E-043.315E-038.759E + 021.425E-041.458E-038.265E-041.145E-038.110E-041.349E-038.518E-044.527E-047.486E-06
905.023E-043.975E-043.154E-043.000E-043.278E-031.993E-044.154E-038.725E + 022.493E-041.595E-035.848E-041.404E-037.156E-041.730E-038.111E-042.636E-037.486E-06
F16102.845E-052.845E-052.845E-052.845E-053.757E-052.845E-052.840E-055.362E + 042.845E-052.845E-052.654E-041.642E-042.845E-052.845E-052.625E-052.786E-052.845E-05
302.845E-052.845E-052.845E-052.845E-052.845E-052.845E-052.840E-052.271E + 042.845E-052.845E-052.645E-051.110E-042.845E-052.845E-052.845E-052.774E-052.585E-05
502.845E-052.845E-052.845E-052.845E-051.986E-042.845E-052.811E-053.201E + 032.845E-052.845E-059.227E-047.736E-042.845E-052.845E-052.845E-052.845E-051.698E-05
902.845E-052.845E-052.845E-052.845E-052.142E-042.845E-052.830E-051.197E + 032.845E-052.845E-051.338E-037.212E-042.845E-052.845E-052.845E-052.845E-051.867E-05
F17107.529E-147.771E-145.294E-017.425E-147.597E-142.740E + 001.380E-074.503E + 067.652E-145.850E-141.846E-025.441E-037.653E-147.476E-147.753E-144.018E-053.920E-14
307.828E-147.864E-142.455E + 002.701E-146.823E-149.229E-011.382E-072.451E + 067.840E-145.955E-141.896E-024.981E-037.788E-147.723E-147.788E-144.513E-052.505E-02
506.363E-147.860E-146.968E-141.286E-066.665E-141.369E + 007.697E-075.281E + 057.529E-144.413E-147.616E-022.737E-027.659E-147.485E-147.485E-146.052E-144.170E-14
907.820E-147.868E-146.403E-141.536E-067.327E-141.703E + 009.104E-076.374E + 047.642E-141.870E-068.080E-023.346E-027.687E-146.843E-144.203E-145.555E-145.441E-02

Bold font : Best value

Table 6

Comparative analysis of existing and new algorithms for mean fitness values over 30 runs on the CEC2013 benchmark functions (C1 − C10) for considered dimensions

Fn.DMPSOSDESBBOGSAOGSAmDGSAGGSAPGSAMGSA(I)MGSA(II)EGSA(I)EGSA(II)EGSA(III)LKGSACKGSAEKGSAIGSA
C1104.012E-141.490E-062.297E-101.946E + 001.405E + 015.631E-102.962E-112.867E-043.336E-101.603E-093.948E-012.225E + 004.703E-101.929E-097.368E-101.471E-103.737E-12
304.961E-132.067E-136.618E-021.447E-132.274E-131.240E-135.085E + 043.449E + 031.860E-133.610E + 041.184E + 002.293E + 012.067E-133.130E + 032.274E-133.927E-131.174E-13
501.946E + 003.211E-051.379E + 011.131E + 047.066E + 042.786E + 048.193E + 044.282E + 049.652E + 035.545E + 031.335E + 049.978E + 031.046E + 047.393E + 041.356E + 036.408E-136.615E-13
904.126E + 023.124E + 001.153E + 027.544E + 041.984E + 059.752E + 041.665E + 051.254E + 056.804E + 044.183E + 016.602E + 047.337E + 046.957E + 041.851E + 054.803E + 046.202E + 041.199E-12
C2103.155E + 052.124E + 041.213E + 059.890E + 054.974E + 068.458E + 053.158E + 069.454E + 057.785E + 041.889E + 055.528E + 063.753E + 068.316E + 053.988E + 058.907E + 034.940E + 031.671E + 06
301.519E + 077.604E + 073.597E + 066.347E + 062.757E + 074.733E + 061.665E + 093.601E + 071.982E + 085.647E + 082.400E + 071.923E + 075.694E + 067.115E + 076.894E + 052.679E + 061.206E + 02
508.546E + 075.625E + 081.538E + 071.037E + 083.369E + 092.936E + 083.651E + 091.085E + 095.423E + 082.269E + 071.755E + 081.407E + 089.684E + 072.874E + 096.675E + 076.372E + 072.009E + 06
904.048E + 075.801E + 081.304E + 071.286E + 091.348E + 102.106E + 098.808E + 093.988E + 091.700E + 093.987E + 071.867E + 091.521E + 091.071E + 098.576E + 096.986E + 089.497E + 084.543E + 05
C3102.458E + 053.740E + 072.221E + 074.837E + 071.810E + 092.707E + 084.244E + 074.115E + 086.689E + 062.237E + 052.583E + 082.975E + 086.448E + 075.242E + 072.982E + 063.003E + 041.655E + 00
302.738E + 081.711E + 082.747E + 085.335E + 093.737E + 103.440E + 091.146E + 207.077E + 101.777E + 121.284E + 161.652E + 107.411E + 093.681E + 091.681E + 143.310E + 087.253E + 061.601E + 07
501.614E + 104.866E + 101.090E + 091.503E + 111.602E + 233.113E + 111.035E + 171.171E + 144.851E + 117.402E + 097.626E + 113.842E + 119.275E + 101.216E + 173.181E + 105.191E + 101.166E + 08
903.856E + 104.857E + 103.807E + 097.820E + 173.186E + 281.990E + 175.155E + 215.265E + 195.169E + 182.214E + 123.009E + 181.008E + 181.388E + 183.365E + 246.103E + 134.751E + 152.429E + 08
C4105.083E + 021.366E + 041.755E + 031.664E + 041.788E + 041.766E + 048.524E + 031.812E + 044.514E + 011.250E + 041.654E + 041.021E + 041.645E + 041.235E + 041.826E + 044.904E-138.549E + 03
307.590E + 036.337E + 041.091E + 037.257E + 046.896E + 046.745E + 046.805E + 047.045E + 042.766E + 046.276E + 046.710E + 046.490E + 046.703E + 045.939E + 046.637E + 046.636E + 042.043E-08
507.098E + 041.748E + 055.558E + 049.448E + 044.250E + 078.937E + 041.311E + 059.611E + 041.318E + 059.764E + 049.472E + 048.905E + 049.443E + 043.178E + 059.823E + 049.405E + 043.317E + 02
901.426E + 052.165E + 053.798E + 041.773E + 051.255E + 091.725E + 052.584E + 051.734E + 052.391E + 051.833E + 051.818E + 051.794E + 051.707E + 056.012E + 061.656E + 051.644E + 054.785E + 02
C5109.362E-143.680E-043.431E-062.574E-055.797E-042.669E-053.324E-083.761E-027.074E-041.765E-102.013E + 011.205E + 012.581E-092.229E-151.627E-121.025E-132.124E-15
302.478E-111.137E-131.303E-013.027E-102.390E + 022.215E-103.325E + 048.382E + 021.571E-121.410E + 046.122E + 017.183E + 015.147E-124.605E + 029.302E-133.721E-138.165E-13
506.146E + 004.809E-034.986E + 001.617E + 031.637E + 042.598E + 032.556E + 045.708E + 031.517E + 031.474E + 022.394E + 031.713E + 031.474E + 032.463E + 043.313E + 027.988E + 027.848E-09
902.335E + 028.771E + 003.723E + 011.504E + 049.193E + 041.795E + 048.689E + 043.366E + 041.376E + 049.497E + 022.106E + 041.534E + 041.415E + 041.237E + 054.609E + 039.205E + 033.622E-08
C6106.173E + 009.765E + 006.992E + 004.352E + 013.741E + 013.696E + 011.107E + 012.599E + 017.395E + 009.494E + 006.701E + 014.830E + 014.432E + 012.129E + 011.110E + 017.507E + 009.813E + 00
307.912E + 012.463E + 015.207E + 017.848E + 011.130E + 025.116E + 011.530E + 043.880E + 021.448E + 036.651E + 039.351E + 017.238E + 016.896E + 011.253E + 036.395E + 011.020E + 015.009E + 01
507.188E + 014.791E + 016.306E + 016.613E + 029.444E + 031.798E + 031.189E + 043.806E + 031.986E + 038.448E + 018.271E + 027.057E + 025.548E + 029.467E + 032.959E + 023.668E + 024.450E + 01
906.542E + 024.446E + 023.023E + 021.286E + 044.393E + 041.812E + 044.482E + 042.634E + 041.956E + 047.724E + 021.382E + 041.326E + 041.165E + 045.544E + 048.975E + 039.927E + 032.068E + 02
C7103.355E + 004.109E + 045.373E + 011.249E + 017.010E + 012.878E + 011.525E + 016.431E + 011.930E + 015.563E + 001.940E + 012.300E + 011.122E + 011.105E + 026.289E + 003.236E-015.316E-06
304.055E + 017.026E + 011.126E + 026.502E + 011.371E + 047.744E + 011.583E + 071.668E + 061.017E + 036.511E + 047.509E + 018.450E + 016.233E + 011.371E + 056.473E + 012.248E + 011.976E + 01
501.376E + 021.835E + 021.260E + 027.189E + 023.096E + 096.367E + 032.881E + 051.238E + 056.975E + 026.574E + 011.052E + 032.930E + 021.927E + 031.097E + 052.723E + 023.535E + 025.539E + 01
901.322E + 021.582E + 021.212E + 026.129E + 053.850E + 101.916E + 067.451E + 068.088E + 062.547E + 054.644E + 028.082E + 051.672E + 051.039E + 063.227E + 072.661E + 055.399E + 059.417E + 01
C8102.530E + 012.332E + 012.631E + 012.434E + 012.137E + 013.534E + 012.539E + 013.331E + 014.432E + 013.133E + 013.640E + 012.733E + 013.129E + 012.135E + 012.534E + 012.235E + 012.019E + 01
302.397E + 014.198E + 013.598E + 013.399E + 014.700E + 013.298E + 013.096E + 013.496E + 012.190E + 012.295E + 012.302E + 012.397E + 012.290E + 012.399E + 012.298E + 012.599E + 012.084E + 01
502.320E + 013.220E + 013.421E + 013.522E + 012.223E + 012.322E + 013.420E + 013.321E + 012.416E + 012.222E + 013.320E + 012.520E + 012.220E + 013.020E + 012.321E + 012.419E + 012.110E + 01
902.632E + 013.130E + 013.025E + 012.264E + 012.613E + 012.060E + 012.137E + 012.118E + 013.104E + 012.978E + 013.135E + 012.836E + 013.477E + 012.335E + 012.372E + 012.490E + 012.228E + 01
C9102.995E + 001.006E + 016.045E + 003.393E + 005.462E + 009.247E + 003.953E + 009.445E + 004.394E + 001.277E + 004.153E + 004.749E + 003.094E + 001.235E + 004.521E + 002.244E + 005.326E + 00
302.329E + 013.664E + 012.702E + 013.180E + 013.357E + 013.894E + 014.549E + 014.555E + 013.394E + 014.320E + 013.474E + 013.524E + 013.073E + 013.670E + 013.043E + 011.770E + 017.025E + 00
505.366E + 017.458E + 015.396E + 015.875E + 017.380E + 017.011E + 018.044E + 017.667E + 016.768E + 012.560E + 016.194E + 016.561E + 016.126E + 017.626E + 016.122E + 015.818E + 013.470E + 01
908.534E + 011.323E + 027.927E + 011.299E + 021.520E + 021.383E + 021.579E + 021.530E + 021.262E + 025.238E + 011.367E + 021.386E + 021.290E + 021.571E + 021.272E + 021.270E + 025.288E + 01
C10104.863E-017.775E-021.431E + 003.817E-038.453E-022.175E-032.281E + 004.927E-013.500E-012.030E-031.135E + 001.363E + 004.833E-036.736E-021.642E-036.408E-027.620E-04
307.972E-013.548E + 012.016E + 009.297E-025.462E + 012.127E-029.037E + 038.459E + 021.604E + 035.505E + 036.161E + 006.020E + 001.118E-011.455E + 034.704E-034.617E-021.255E-02
501.548E + 021.598E + 031.811E + 011.548E + 031.146E + 043.437E + 031.449E + 046.251E + 035.076E + 033.419E + 011.931E + 031.499E + 031.339E + 031.199E + 047.273E + 021.066E + 032.218E-01
902.880E + 021.273E + 034.547E + 019.661E + 033.270E + 041.425E + 043.096E + 042.054E + 041.486E + 044.381E + 021.127E + 049.888E + 039.913E + 033.147E + 045.191E + 037.737E + 038.643E-02

Bold font : Best value

Table 7

Comparative analysis of existing and new algorithms for mean fitness values over 30 runs on the CEC2013 benchmark functions (C11 − C20) for considered dimensions

Fn.DMPSOSDESBBOGSAOGSAmDGSAGGSAPGSAMGSA(I)MGSA(II)EGSA(I)EGSA(II)EGSA(III)LKGSACKGSAEKGSAIGSA
C11101.639E + 002.246E + 022.330E + 001.781E + 013.095E + 011.694E + 025.316E-041.311E + 022.045E + 013.524E + 001.838E + 012.394E + 011.807E + 015.437E + 012.654E + 016.067E + 001.951E-07
302.605E + 011.809E + 012.401E + 012.743E + 024.124E + 026.797E + 028.679E + 026.946E + 022.202E + 027.034E + 022.886E + 023.808E + 022.915E + 024.636E + 023.275E + 024.838E + 012.858E + 01
501.210E + 021.988E + 021.265E + 026.524E + 021.150E + 038.774E + 021.201E + 038.097E + 026.298E + 021.308E + 026.295E + 028.160E + 026.758E + 021.222E + 036.048E + 026.288E + 029.894E + 01
903.970E + 025.762E + 024.525E + 021.786E + 032.971E + 032.115E + 032.850E + 032.163E + 031.751E + 034.241E + 021.835E + 032.143E + 031.783E + 033.445E + 031.635E + 031.700E + 023.201E + 02
C12101.344E + 012.372E + 021.957E + 011.405E + 013.149E + 011.454E + 029.753E + 001.396E + 021.816E + 013.102E + 001.495E + 011.653E + 011.414E + 014.918E + 012.576E + 009.501E + 001.325E + 01
301.000E + 021.953E + 021.073E + 023.351E + 024.551E + 028.155E + 028.827E + 027.594E + 023.491E + 026.829E + 023.291E + 023.678E + 023.398E + 024.346E + 024.261E + 015.512E + 011.610E + 01
504.038E + 024.851E + 022.169E + 029.196E + 021.574E + 031.014E + 031.331E + 039.858E + 028.130E + 028.334E + 029.277E + 029.930E + 029.077E + 026.847E + 014.031E + 028.721E + 021.352E + 02
907.192E + 021.011E + 036.338E + 022.048E + 033.275E + 032.339E + 033.090E + 032.267E + 032.093E + 039.496E + 022.132E + 032.298E + 032.044E + 033.546E + 021.247E + 032.021E + 033.861E + 02
C13101.861E + 012.604E + 023.477E + 013.244E + 015.595E + 011.611E + 021.862E + 011.567E + 023.126E + 015.813E + 003.382E + 013.148E + 012.902E + 014.288E + 008.289E + 011.632E + 011.443E + 01
301.754E + 022.002E + 021.762E + 024.514E + 026.875E + 028.922E + 029.061E + 028.809E + 025.135E + 026.651E + 024.514E + 024.098E + 024.587E + 025.883E + 021.000E + 021.142E + 024.273E + 01
504.821E + 024.757E + 023.153E + 021.089E + 031.747E + 031.288E + 031.345E + 031.241E + 038.608E + 021.760E + 021.038E + 039.983E + 021.117E + 031.230E + 035.183E + 021.130E + 032.362E + 02
908.673E + 029.931E + 026.664E + 022.384E + 033.738E + 032.732E + 033.030E + 032.747E + 032.214E + 039.501E + 022.452E + 032.363E + 032.402E + 033.571E + 031.640E + 032.411E + 035.762E + 02
C14109.271E + 011.511E + 033.067E + 027.153E + 021.253E + 031.636E + 031.708E-011.369E + 037.925E + 023.630E + 027.567E + 028.055E + 026.917E + 021.200E + 034.267E + 021.856E + 021.025E-01
308.069E + 027.542E + 021.198E + 033.572E + 034.913E + 035.204E + 036.919E + 035.374E + 033.096E + 037.934E + 033.546E + 034.683E + 033.576E + 034.882E + 032.867E + 031.997E + 032.080E + 03
503.746E + 035.709E + 033.509E + 037.300E + 039.768E + 038.523E + 031.475E + 048.521E + 036.629E + 035.035E + 038.004E + 039.832E + 037.497E + 031.551E + 046.318E + 037.156E + 023.375E + 03
901.095E + 041.851E + 041.094E + 041.453E + 042.133E + 041.598E + 042.836E + 041.683E + 041.653E + 041.093E + 041.581E + 042.057E + 041.499E + 043.006E + 041.261E + 041.371E + 044.323E + 03
C15107.843E + 021.298E + 031.016E + 034.395E + 021.034E + 031.063E + 031.434E + 039.626E + 027.537E + 022.054E + 023.772E + 024.566E + 023.982E + 028.454E + 021.884E + 026.314E + 021.037E + 03
306.878E + 037.509E + 034.118E + 033.417E + 034.325E + 034.374E + 035.491E + 034.842E + 034.363E + 037.513E + 033.733E + 034.495E + 033.899E + 034.218E + 032.488E + 033.046E + 031.206E + 03
501.443E + 041.493E + 048.408E + 039.020E + 031.048E + 049.582E + 031.559E + 041.002E + 049.953E + 031.487E + 048.990E + 031.156E + 049.514E + 031.606E + 045.507E + 038.953E + 036.711E + 03
902.028E + 042.551E + 041.364E + 041.433E + 042.048E + 041.453E + 042.933E + 041.661E + 041.785E + 042.892E + 041.557E + 042.058E + 041.415E + 043.001E + 041.382E + 049.754E + 031.026E + 04
C16108.828E-016.401E-033.999E-016.087E-031.690E-016.869E-031.287E + 002.038E-012.855E-014.145E-039.783E-011.088E + 009.322E-033.745E-024.581E-036.760E-012.378E-03
302.517E + 002.484E + 001.544E + 007.081E-032.832E-016.775E-033.051E + 002.819E-013.163E-012.671E + 001.242E + 002.722E + 009.348E-034.201E-025.817E-032.007E + 005.490E-03
503.914E + 003.930E + 003.422E + 004.606E-021.594E + 003.477E-024.502E + 004.940E-011.269E + 003.300E-021.415E + 004.056E + 005.168E-024.671E + 002.739E-022.982E-023.098E + 00
904.083E + 004.216E + 002.296E + 003.290E-021.895E + 001.829E-025.027E + 002.652E-011.524E + 004.490E-019.731E-014.561E + 003.117E-024.977E + 001.744E-021.988E-023.908E + 00
C17101.103E + 013.847E + 029.927E + 001.237E + 012.903E + 015.985E + 011.043E + 014.964E + 013.202E + 011.365E + 012.572E + 013.313E + 011.260E + 013.483E + 011.634E + 011.300E + 011.004E + 01
306.401E + 017.041E + 013.528E + 016.854E + 013.417E + 023.531E + 028.330E + 026.125E + 024.378E + 027.615E + 021.360E + 022.191E + 026.598E + 014.301E + 028.134E + 016.115E + 014.717E + 01
502.852E + 022.576E + 021.812E + 026.343E + 021.631E + 031.008E + 031.466E + 031.052E + 031.384E + 038.540E + 017.867E + 028.303E + 026.463E + 021.637E + 035.932E + 026.679E + 021.278E + 02
909.113E + 026.990E + 026.123E + 021.913E + 034.042E + 032.303E + 033.156E + 032.461E + 033.495E + 033.749E + 022.187E + 032.246E + 032.040E + 034.867E + 031.895E + 031.954E + 032.202E + 02
C18102.672E + 013.802E + 022.504E + 011.308E + 012.959E + 014.670E + 013.617E + 015.353E + 012.903E + 011.416E + 013.283E + 013.449E + 011.243E + 013.965E + 011.669E + 011.373E + 012.945E + 01
302.481E + 022.354E + 021.298E + 026.534E + 013.022E + 022.912E + 028.706E + 025.637E + 024.874E + 027.510E + 021.986E + 022.241E + 025.971E + 014.240E + 027.641E + 019.711E + 014.655E + 01
505.897E + 025.039E + 024.124E + 026.665E + 021.795E + 039.761E + 021.466E + 031.028E + 031.308E + 036.292E + 028.437E + 028.177E + 026.684E + 029.242E + 015.929E + 026.111E + 022.125E + 02
901.365E + 031.094E + 039.356E + 021.967E + 033.996E + 032.283E + 033.126E + 032.457E + 033.233E + 032.720E + 032.257E + 032.313E + 032.016E + 034.984E + 032.356E + 022.056E + 033.579E + 02
C19105.470E-013.427E + 001.188E + 001.329E + 001.520E + 001.266E + 004.246E-013.148E + 001.137E + 001.282E + 001.712E + 001.837E + 001.237E + 002.179E + 003.418E-017.046E-013.982E-01
303.650E + 007.378E + 003.091E + 006.897E + 004.957E + 019.020E + 003.328E + 055.334E + 022.334E + 012.790E + 051.650E + 011.725E + 017.025E + 005.095E + 023.833E + 005.419E + 002.643E + 00
502.305E + 012.708E + 011.576E + 011.080E + 046.396E + 052.680E + 046.273E + 051.294E + 052.283E + 041.759E + 011.777E + 047.379E + 038.866E + 031.897E + 062.875E + 021.871E + 037.039E + 00
901.863E + 029.806E + 015.327E + 012.416E + 056.956E + 063.266E + 051.809E + 069.081E + 051.273E + 067.762E + 023.684E + 052.856E + 052.161E + 051.178E + 074.760E + 041.075E + 053.195E + 01
C20102.834E + 012.829E + 022.943E + 016.239E + 016.251E + 019.963E + 013.526E + 012.695E + 014.377E + 011.994E + 012.345E + 015.426E + 019.270E + 014.417E + 011.242E + 011.265E + 011.007E + 01
303.993E + 023.524E + 022.247E + 021.016E + 037.689E + 028.121E + 026.341E + 026.699E + 028.313E + 027.263E + 029.249E + 026.280E + 024.774E + 028.898E + 028.220E + 022.497E + 022.488E + 02
503.893E + 024.172E + 022.700E + 021.649E + 035.060E + 038.565E + 021.002E + 031.367E + 031.252E + 033.971E + 021.699E + 032.047E + 031.501E + 031.332E + 031.347E + 032.983E + 022.928E + 02
909.107E + 025.496E + 028.252E + 022.989E + 031.017E + 042.968E + 034.356E + 036.202E + 033.437E + 031.398E + 035.142E + 033.465E + 031.591E + 032.405E + 034.802E + 033.636E + 034.587E + 02

Bold font : Best value

Table 8

Comparative analysis of existing and new algorithms for mean fitness values over 30 runs on the CEC2013 benchmark functions (C21 − C28) for considered dimensions

Fn.DMPSOSDESBBOGSAOGSAmDGSAGGSAPGSAMGSA(I)MGSA(II)EGSA(I)EGSA(II)EGSA(III)LKGSACKGSAEKGSAIGSA
C21103.668E + 023.733E + 023.582E + 023.502E + 023.802E + 023.902E + 023.802E + 024.002E + 023.865E + 024.202E + 023.902E + 023.403E + 023.802E + 024.082E + 023.702E + 024.023E + 023.409E + 02
303.119E + 022.546E + 022.936E + 023.261E + 026.519E + 023.261E + 022.525E + 031.478E + 033.079E + 022.502E + 033.260E + 024.043E + 023.079E + 021.532E + 033.079E + 022.676E + 022.676E + 02
506.895E + 028.755E + 028.947E + 023.197E + 034.480E + 033.362E + 034.587E + 033.798E + 033.126E + 039.200E + 023.335E + 033.089E + 033.179E + 036.477E + 032.553E + 032.925E + 035.322E + 02
909.012E + 023.924E + 026.892E + 024.667E + 031.038E + 054.903E + 036.891E + 036.068E + 036.280E + 036.960E + 024.699E + 034.793E + 034.714E + 031.342E + 044.077E + 034.474E + 035.453E + 02
C22101.829E + 021.825E + 034.322E + 021.753E + 032.032E + 032.603E + 035.015E + 012.317E + 039.732E + 022.730E + 021.726E + 031.711E + 031.687E + 032.026E + 031.798E + 033.026E + 021.139E + 01
309.156E + 022.284E + 031.633E + 036.399E + 036.971E + 037.731E + 038.187E + 037.387E + 033.677E + 038.941E + 036.203E + 037.119E + 036.367E + 035.980E + 036.052E + 032.030E + 031.608E + 03
504.108E + 037.429E + 035.006E + 031.300E + 041.477E + 041.403E + 041.637E + 041.376E + 049.759E + 037.234E + 031.317E + 041.456E + 041.295E + 041.705E + 041.033E + 031.301E + 043.906E + 03
901.369E + 042.069E + 041.328E + 042.481E + 042.832E + 042.481E + 043.041E + 042.621E + 042.268E + 041.842E + 042.522E + 042.826E + 042.409E + 043.247E + 042.404E + 044.824E + 035.093E + 03
C23107.372E + 021.754E + 031.312E + 031.194E + 031.761E + 032.026E + 031.138E + 031.982E + 038.890E + 023.565E + 021.208E + 031.276E + 031.195E + 031.679E + 031.296E + 036.712E + 021.108E + 03
306.856E + 037.835E + 035.325E + 035.757E + 036.477E + 036.319E + 038.209E + 037.010E + 036.189E + 039.019E + 035.905E + 036.579E + 035.842E + 036.702E + 035.698E + 033.422E + 032.607E + 03
501.476E + 041.523E + 041.120E + 041.223E + 041.372E + 041.270E + 041.739E + 041.383E + 041.318E + 048.858E + 031.291E + 041.406E + 041.247E + 041.729E + 041.238E + 041.246E + 046.342E + 03
902.287E + 042.652E + 041.813E + 042.339E + 042.718E + 042.316E + 043.167E + 042.549E + 042.327E + 041.656E + 042.353E + 042.704E + 042.294E + 043.211E + 042.237E + 042.271E + 041.327E + 04
C24102.083E + 022.463E + 022.168E + 022.221E + 021.850E + 022.554E + 022.130E + 022.537E + 022.147E + 022.000E + 022.235E + 022.208E + 022.153E + 022.337E + 022.225E + 022.045E + 021.918E + 02
302.715E + 022.863E + 022.626E + 023.133E + 024.677E + 025.590E + 026.168E + 025.211E + 023.277E + 024.077E + 023.476E + 023.006E + 023.464E + 023.945E + 023.496E + 022.434E + 022.003E + 02
503.480E + 023.831E + 023.050E + 029.681E + 022.226E + 031.275E + 031.127E + 031.095E + 034.514E + 023.681E + 028.050E + 025.447E + 029.312E + 022.497E + 028.203E + 029.297E + 022.909E + 02
904.438E + 025.169E + 023.900E + 022.561E + 034.064E + 032.730E + 033.047E + 032.782E + 031.055E + 033.579E + 022.580E + 032.410E + 032.513E + 032.937E + 032.318E + 032.360E + 033.530E + 02
C25102.096E + 022.386E + 022.138E + 022.108E + 022.119E + 022.451E + 022.094E + 022.450E + 022.161E + 021.997E + 022.075E + 022.084E + 022.083E + 022.298E + 022.126E + 022.030E + 021.787E + 02
302.843E + 022.930E + 022.997E + 023.867E + 023.946E + 024.325E + 024.259E + 024.364E + 023.529E + 024.111E + 023.932E + 023.854E + 023.875E + 024.044E + 023.986E + 022.568E + 022.000E + 02
503.992E + 023.991E + 023.883E + 026.665E + 027.730E + 026.956E + 026.498E + 026.758E + 025.322E + 023.383E + 026.674E + 026.299E + 026.724E + 026.805E + 026.464E + 026.658E + 023.204E + 02
905.460E + 025.499E + 025.422E + 021.233E + 031.612E + 031.274E + 038.908E + 021.303E + 039.172E + 025.376E + 021.266E + 031.274E + 031.293E + 031.336E + 031.188E + 031.219E + 024.151E + 02
C26102.201E + 023.052E + 021.845E + 023.285E + 023.978E + 023.257E + 021.876E + 023.113E + 021.926E + 021.886E + 022.572E + 022.185E + 022.774E + 022.524E + 023.016E + 021.677E + 021.437E + 02
303.150E + 022.113E + 022.865E + 023.414E + 023.910E + 023.983E + 024.675E + 024.329E + 023.537E + 022.939E + 023.568E + 023.164E + 023.567E + 023.915E + 023.843E + 022.000E + 022.771E + 02
504.214E + 023.128E + 024.136E + 024.636E + 021.797E + 035.616E + 026.437E + 026.093E + 024.538E + 023.085E + 024.742E + 024.119E + 023.813E + 025.574E + 023.663E + 023.980E + 023.183E + 02
905.094E + 026.287E + 024.768E + 021.188E + 031.284E + 051.808E + 032.906E + 032.477E + 036.645E + 024.370E + 021.534E + 038.053E + 028.965E + 022.728E + 031.424E + 031.153E + 034.393E + 02
C27103.848E + 027.951E + 024.915E + 024.100E + 023.257E + 023.400E + 024.247E + 024.100E + 025.226E + 023.924E + 024.014E + 024.233E + 024.250E + 025.193E + 023.922E + 023.167E + 023.465E + 02
306.891E + 029.746E + 021.094E + 031.023E + 039.571E + 029.216E + 028.220E + 028.915E + 027.207E + 029.809E + 021.051E + 031.095E + 038.975E + 029.884E + 029.204E + 028.526E + 023.005E + 02
501.672E + 032.156E + 031.543E + 032.619E + 035.349E + 033.387E + 033.626E + 033.414E + 032.379E + 031.662E + 032.723E + 032.506E + 032.758E + 033.227E + 032.496E + 032.602E + 038.912E + 02
902.655E + 033.603E + 032.193E + 036.401E + 031.075E + 048.647E + 031.007E + 049.147E + 034.823E + 034.599E + 035.480E + 035.356E + 036.531E + 039.618E + 035.381E + 031.330E + 031.779E + 03
C28102.977E + 022.086E + 033.908E + 026.036E + 025.944E + 029.618E + 022.900E + 029.435E + 023.955E + 022.920E + 024.970E + 026.037E + 026.231E + 028.279E + 027.118E + 022.900E + 021.929E + 02
302.900E + 023.200E + 028.974E + 024.031E + 035.305E + 035.086E + 037.347E + 034.944E + 032.968E + 036.072E + 034.178E + 034.254E + 034.143E + 033.981E + 034.363E + 032.900E + 022.218E + 02
501.363E + 034.592E + 024.246E + 028.542E + 034.260E + 049.100E + 031.251E + 049.667E + 036.137E + 034.363E + 028.799E + 039.258E + 038.727E + 031.143E + 048.027E + 038.436E + 036.753E + 02
902.189E + 031.377E + 031.220E + 031.282E + 042.531E + 041.343E + 041.902E + 041.623E + 041.480E + 043.794E + 031.298E + 041.471E + 041.299E + 042.220E + 041.232E + 041.283E + 043.933E + 02

Bold font : Best value

Comparative analysis of existing and new algorithms for mean fitness values over 30 runs on the benchmark functions (F1 − F10) for different dimensions Bold font : Best value Comparative analysis of existing and new algorithms for mean fitness values over 30 runs on the benchmark functions (F11 − F17) for different dimensions Bold font : Best value Comparative analysis of existing and new algorithms for mean fitness values over 30 runs on the CEC2013 benchmark functions (C1 − C10) for considered dimensions Bold font : Best value Comparative analysis of existing and new algorithms for mean fitness values over 30 runs on the CEC2013 benchmark functions (C11 − C20) for considered dimensions Bold font : Best value Comparative analysis of existing and new algorithms for mean fitness values over 30 runs on the CEC2013 benchmark functions (C21 − C28) for considered dimensions Bold font : Best value To validate the IGSA statistically, Friedman’s test [83] has been conducted between IGSA and considered algorithms. Friedman’s test is a non-parametric statistical test and has been performed by considering the mean fitness values over 30 runs for each benchmark function in the S1 and S2 sets and results are presented in Tables 9 and 10 for each considered dimension. Generally, Friedman’s test considers two hypotheses, namely null hypotheses and alternative hypotheses. The null hypothesis (H0) refers to that there is no significant difference among the samples and the alternative hypothesis signifies that all samples are significantly different. In the tables, p-value is less than the considered significance level, i.e. α = 0.05 which indicates that the null hypothesis (H0) is rejected. Moreover, IGSA attained minimum mean rank value among the comparative algorithms in all tables. Therefore, it is perceptible that there is a significant difference between IGSA and other algorithms for both sets over 10, 30, 50, and 90 dimensions.
Table 9

Friedman test based on mean fitness values over 30 runs on the common benchmark functions (F1 − F17) for different dimensions

10 dims.30 dims.50 dims90 dims.
RankAlgorithmAlgorithmAlgorithmAlgorithm
1IGSA4.159IGSA4.955IGSA6.091IGSA5.818
2GGSA5.727GGSA6.114mDGSA6.318MGSA(I)6.000
3MPSO6.523SDE6.545EKGSA6.591EKGSA6.091
4EGSA(III)7.500mDGSA6.818CKGSA6.795CKGSA6.795
5mDGSA7.591CKGSA7.000MGSA(I)6.955mDGSA7.136
6EKGSA7.682EGSA(I)7.364GSA7.545OGSA7.568
7CKGSA7.705GSA7.841OGSA8.136GSA8.182
8EGSA(II)7.841EGSA(II)8.136GGSA8.250EGSA(I)8.273
9GSA8.159MPSO8.364SDE8.273GGSA8.364
10LKGSA9.455CGSA8.500MPSO8.591EGSA(III)8.614
11EGSA(I)9.523MGSA(I)8.682EGSA(I)9.045MPSO9.045
12CGSA9.591LKGSA9.841EGSA(III)9.955SDE9.773
13MGSA(I)10.068EKGSA10.091SBBO10.409SBBO9.773
14SDE11.545OGSA11.659LKGSA11.432LKGSA11.909
15OGSA11.795SBBO12.091EGSA(II)11.932EGSA(II)12.477
16SBBO12.091EGSA(III)13.909CGSA13.182CGSA13.364
17PGSA16.045PGSA15.091PGSA13.500PGSA13.818
Table 10

Friedman test based on mean fitness values over 30 runs on the CEC benchmark functions (C1 − C28) for different dimensions

10 dims.30 dims.50 dims90 dims.
RankAlgorithmAlgorithmAlgorithmAlgorithm
1IGSA4.214IGSA3.143IGSA2.000IGSA2.071
2mDGSA5.000EKGSA3.679SBBO3.964SBBO3.357
3MPSO5.643CGSA5.071CGSA4.500MPSO5.143
4EKGSA5.679SBBO5.821mDGSA5.393mDGSA5.179
5CGSA7.214MPSO6.321MPSO5.750CGSA5.571
6GGSA7.750SDE6.875SDE6.893SDE6.571
7SBBO8.214GGSA7.232CKGSA7.000CKGSA6.964
8EGSA(I)8.250CKGSA7.696EKGSA7.357EKGSA7.250
9CKGSA8.429GSA8.000GGSA9.536GGSA9.464
10EGSA(II)8.464EGSA(II)9.464EGSA(II)9.714GSA9.571
11GSA8.929EGSA(III)10.143GSA9.821EGSA(II)10.214
12LKGSA10.464MGSA(I)10.821EGSA(III)10.750MGSA(I)11.214
13EGSA(III)11.893LKGSA12.000MGSA(I)12.536EGSA(III)11.464
14OGSA12.321OGSA12.232PGSA13.429PGSA12.929
15SDE12.964PGSA14.179LKGSA13.536EGSA(I)14.964
16MGSA(I)13.464mDGSA14.321EGSA(I)15.357LKGSA15.321
17PGSA14.107EGSA(I)16.000OGSA15.464OGSA15.750
Friedman test based on mean fitness values over 30 runs on the common benchmark functions (F1 − F17) for different dimensions Friedman test based on mean fitness values over 30 runs on the CEC benchmark functions (C1 − C28) for different dimensions Further, box-plots have been drawn to analyze the consistency of the new variant for different dimensions in terms of the average failure rate. Failure rate corresponds to the number of runs in which an algorithm fails to achieve the optimum value. To count the same, the considered algorithms have been executed 30 times where each execution consists of 30 runs. Figure 8 illustrates the box-plots over different dimensions i.e. 10, 30, 50, and 90. The considered algorithms are depicted on the horizontal axis, while the average failure rate is denoted on the vertical axis. In the figures, IGSA is comparatively more consistent with small interquartile range and medians. Therefore, it is pertinent from experiments that IGSA attains better global and local search balance along with high precision.
Fig. 8

Boxplot of IGSA and other considered algorithms for different dimensions

Boxplot of IGSA and other considered algorithms for different dimensions

Experimental analysis of the proposed clustering method

The experimental analysis of the proposed clustering (KIGSA-C) method for CoVID19 diagnosis is evaluated on three types of chest images, namely X-ray, CT-scan, and Ultrasound. Table 11 tabulates the considered datasets for the three types of chest images. In the X-ray dataset, there are 234 chest images of CoVID19 patients that are publicly available on [84]. A similar count of non-CoVID19 images is considered from a publicly available dataset which consists of chest X-ray of patients who are infected from other viral and bacterial pneumonia like, MERS, SARS, and ARDS [85]. Further, four CNN models namely, DenseNet-161, ResNet-34, VGG-16, and MobileNet-V2 are considered to perform feature extraction as they have top-5 error value as less than 10 [70]. For feature extraction, the last layer of these pre-trained models is truncated and the remaining combination of layers, i.e. convolutional, non-linear activation, pooling, and fully-connected, are used to extract features. Table 12 tabulates the considered CNN models for TLFE along with the number of extracted features. After extracting the deep features, optimal cluster centroids are obtained through the KIGSA-C method which is used to label the considered images in two categories, namely CoVID19 and non-CoVID19. As labeled dataset is used for experimentation, the performance of the proposed method can be evaluated on different classification parameters, such as accuracy, precision, and F1-score, by comparing the predicted label with actual label [42]. Moreover, the results of the proposed KIGSA-C method is compared against two methods, i.e. Kmeans and Kmeans-based gravitational search algorithm clustering (KGSA-C). Table 13 tabulates the confusion matrices between CoVID19 and non-CoVID19 classes for the considered methods over different TLFE models. Bold entries present the best values. From Table 13, it is observable that the proposed method identifies more than 98.5% of the CoVID19 images correctly. Moreover, the false-positive rate of the proposed method is comparatively low than the other methods. In terms of false-negative, the KIGSA-C method attained competitive results. For better visualization comparison, the classification accuracy of the considered methods on the X-ray dataset is plotted as bar-chart in Fig. 9. In the figure, X − axis denotes the names of the method while Y − axis represents the obtained accuracy. From the figures, it can be claimed that the proposed KIGSA-C method outperforms other considered methods with a margin of more than 1% approximately. Further, the performance of the proposed method is evaluated on four more parameters, namely sensitivity, specificity, precision, and F1-score. The formulation of each parameter is expressed in (15) – (18) respectively [88]. Table 14 presents the results of the considered methods on the studied parameters for X-ray images. The bold represents the best value. It can be observed for the table that the proposed method has consistency in the results.
Table 11

Considered CoVID19 datasets

Type ofRef.
chest image
X-ray[84, 85]
CT-scan[86]
Ultrasound[87]
Table 12

Details of the considered TLFE models taken from [70]

ModelTop-5Number of extracted
errorfeatures
DenseNet-1616.22208
ResNet-348.58512
VGG-169.62512
MobileNet V29.711280
Table 13

Confusion matrix for X-ray images

DenseNet-161ResNet-34VGG-16MobileNet-V2Method
ClassesCoVID19non-CoVID19non-CoVID19non-CoVID19non-
CoVID19CoVID19CoVID19CoVID19
CoVID190.97870.02130.97020.02980.96600.03400.98300.0170Kmeans
0.98300.01700.98720.01280.97020.02980.99150.0085KGSA-C
0.98720.01280.99150.00850.98720.01280.99570.0043KIGSA-C
0.10210.89790.03830.96170.05110.94890.02550.9745Kmeans
non-0.09360.90640.02550.97450.03830.96170.02130.9787KGSA-C
CoVID190.07660.92340.02130.98300.03400.96600.02130.9787KIGSA-C
Fig. 9

Classification accuracy of considered methods on X-ray dataset

Table 14

Performance of considered methods on classification parameters for Xray images

ModelParametersKmeansKGSA-CKIGSA-C
DenseNet-161Sensitivity0.90550.91300.9280
Specificity0.97690.98160.9864
Precision0.97870.98300.9872
F1-score0.94070.94670.9567
ResNet-34Sensitivity0.96200.97480.9790
Specificity0.97000.98710.9914
Precision0.97020.98720.9915
F1-score0.96610.98100.9852
VGG-16Sensitivity0.94980.96200.9667
Specificity0.96540.97000.9870
Precision0.96600.97020.9872
F1-score0.95780.96610.9768
MobileNet-V2Sensitivity0.97470.97900.9791
Specificity0.98280.99140.9957
Precision0.98300.99150.9957
F1-score0.97880.98520.9873
Classification accuracy of considered methods on X-ray dataset Considered CoVID19 datasets Details of the considered TLFE models taken from [70] Confusion matrix for X-ray images Performance of considered methods on classification parameters for Xray images Further, the performance of the considered methods is examined on CT-scan and Ultrasound images. The CT-scan dataset referred from a publicly available resource [86]. This dataset consists of 392 CT-scan images of CoVID19 patients with an equal number of non-CoVID19 CT-scans. For the Ultrasound dataset, the publicly available images from [87] are considered. It is a relatively small dataset that consists of 19 images in the CoVID19 category and 14 images in the non-CoVID19 category. Further, MobileNet-V2 is employed for feature extraction as considered methods have reported comparatively better results on it in Table 13. Table 15 depicts the performance of considered methods in terms of sensitivity, specificity, precision, F1-score, and accuracy. Here, bold value depicts the best value. It is interesting to note that the results of the proposed method on CT-scan images are quite promising in comparison to other methods, despite there is high similarity between CT-scan images of CoVID19 and non-CoVID19 [see Figs. 1b and 2b]. On the Ultrasound dataset, the specificity and precision of all the methods are 1. Moreover, the proposed method attained the highest accuracy, i.e. 99.3%. Thus, it is pertinent from experiments that KIGSA-C is efficient among all considered methods and may be used as an alternative tool to diagnose CoVID19 from medical images.
Table 15

Performance comparison of considered methods on CT-scan and Ultrasound dataset

DatasetMethodsSensitivitySpecificityPrecisionF1-scoreAccuracy
CT-scansKmeans0.63850.60770.55870.59590.6212
KGSA-C0.65610.62330.57910.61520.6378
KIGSA-C0.66280.62930.58670.62250.6441
UltrasoundKmeans0.97511.00001.00000.98740.9872
KGSA-C0.97921.00001.00000.98950.9894
KIGSA-C0.98741.00001.00000.99370.9936
Performance comparison of considered methods on CT-scan and Ultrasound dataset

Conclusion

In this paper, a new clustering method, Kmeans-based gravitational search algorithm clustering (KIGSA-C) method, has been introduced for the diagnosis of CoVID19 from the medical images. Although many supervised models exist in the literature, the generalization of these models may suffer due to the limited availability of datasets. To remedy the same, a new clustering is presented. In the proposed method, features are extracted from the considered images through a deep learning model. The extracted features are further optimally clustered through a novel variant, improved gravitational search algorithm (IGSA). The obtained optimal cluster centroids are then used to perform the labeling of the considered images into CoVID19 and non-CoVID19. Further, the proposed variant, IGSA, has been validated against 16 recent metaheuristic algorithms over two sets of benchmark functions belonging to the three types of problems, namely unimodal, multimodal, and real parameters single-objective optimization problems of IEEE Congress on Evolutionary Computation (CEC), 2013. The experimental performance has been evaluated over four different functional dimensions, i.e. 10, 30, 50, and 90 and studied in terms of mean fitness value, Friedman test, and boxplot. It has been observed from experimental results that IGSA has surpassed the considered algorithms over the maximum number of benchmark problems in each dimension. Moreover, the Friedman test has statistically ranked the IGSA as the top algorithm among the considered algorithms. The analysis of the box-plots indicates that the searching behavior of IGSA is better with consistency. Thus, it can be concluded that IGSA achieves better precision with a balanced trade-off between exploration and exploitation. Further, the performance of the new KIGSA-C method has been evaluated against Kmeans and Kmeans-based gravitational search algorithm clustering methods on three types of medical chest images, namely X-ray, CT-scans, and Ultrasound images. In experiments, the feature extraction is performed through four pre-trained deep learning models, namely DenseNet-161, ResNet-34, VGG-16, and MobileNet-V2. The experimental results are measured in terms of sensitivity, specificity, precision, F1-score, and accuracy. Experiments affirm that the proposed KIGSA-C method is efficient and can be used as an alternative tool in aiding the diagnosis of CoVID-19. In the future, real-time datasets may be explored to enhance the efficiency of the proposed model. Moreover, it may be scaled upon a distributed framework to reduce the computation time. Additionally, a parallel version of the proposed method can be explored to handle big datasets by employing architectures like spark or Hadoop.
  15 in total

1.  Decision Fusion-Based Fetal Ultrasound Image Plane Classification Using Convolutional Neural Networks.

Authors:  Pradeeba Sridar; Ashnil Kumar; Ann Quinton; Ralph Nanan; Jinman Kim; Ramarathnam Krishnakumar
Journal:  Ultrasound Med Biol       Date:  2019-02-27       Impact factor: 2.998

2.  Clinical Characteristics of 138 Hospitalized Patients With 2019 Novel Coronavirus-Infected Pneumonia in Wuhan, China.

Authors:  Dawei Wang; Bo Hu; Chang Hu; Fangfang Zhu; Xing Liu; Jing Zhang; Binbin Wang; Hui Xiang; Zhenshun Cheng; Yong Xiong; Yan Zhao; Yirong Li; Xinghuan Wang; Zhiyong Peng
Journal:  JAMA       Date:  2020-03-17       Impact factor: 56.272

3.  Automatic detection of coronavirus disease (COVID-19) using X-ray images and deep convolutional neural networks.

Authors:  Ali Narin; Ceren Kaya; Ziynet Pamuk
Journal:  Pattern Anal Appl       Date:  2021-05-09       Impact factor: 2.580

4.  Correlation of Chest CT and RT-PCR Testing for Coronavirus Disease 2019 (COVID-19) in China: A Report of 1014 Cases.

Authors:  Tao Ai; Zhenlu Yang; Hongyan Hou; Chenao Zhan; Chong Chen; Wenzhi Lv; Qian Tao; Ziyong Sun; Liming Xia
Journal:  Radiology       Date:  2020-02-26       Impact factor: 11.105

5.  CT Manifestations of Two Cases of 2019 Novel Coronavirus (2019-nCoV) Pneumonia.

Authors:  Yicheng Fang; Huangqi Zhang; Yunyu Xu; Jicheng Xie; Peipei Pang; Wenbin Ji
Journal:  Radiology       Date:  2020-02-07       Impact factor: 11.105

Review 6.  COVID-19 infection: Origin, transmission, and characteristics of human coronaviruses.

Authors:  Muhammad Adnan Shereen; Suliman Khan; Abeer Kazmi; Nadia Bashir; Rabeea Siddique
Journal:  J Adv Res       Date:  2020-03-16       Impact factor: 10.479

7.  Automatic Detection of Coronavirus Disease (COVID-19) in X-ray and CT Images: A Machine Learning Based Approach.

Authors:  Sara Hosseinzadeh Kassania; Peyman Hosseinzadeh Kassanib; Michal J Wesolowskic; Kevin A Schneidera; Ralph Detersa
Journal:  Biocybern Biomed Eng       Date:  2021-06-05       Impact factor: 4.314

8.  Temporal Changes of CT Findings in 90 Patients with COVID-19 Pneumonia: A Longitudinal Study.

Authors:  Yuhui Wang; Chengjun Dong; Yue Hu; Chungao Li; Qianqian Ren; Xin Zhang; Heshui Shi; Min Zhou
Journal:  Radiology       Date:  2020-03-19       Impact factor: 11.105

9.  Chest CT for Typical Coronavirus Disease 2019 (COVID-19) Pneumonia: Relationship to Negative RT-PCR Testing.

Authors:  Xingzhi Xie; Zheng Zhong; Wei Zhao; Chao Zheng; Fei Wang; Jun Liu
Journal:  Radiology       Date:  2020-02-12       Impact factor: 11.105

View more
  6 in total

1.  A new firefly algorithm-based superpixel clustering method for vehicle segmentation.

Authors:  Twinkle Tiwari; Mukesh Saraswat
Journal:  Soft comput       Date:  2022-06-13       Impact factor: 3.732

2.  COVID-Transformer: Interpretable COVID-19 Detection Using Vision Transformer for Healthcare.

Authors:  Debaditya Shome; T Kar; Sachi Nandan Mohanty; Prayag Tiwari; Khan Muhammad; Abdullah AlTameem; Yazhou Zhang; Abdul Khader Jilani Saudagar
Journal:  Int J Environ Res Public Health       Date:  2021-10-21       Impact factor: 3.390

3.  MA-Net:Mutex attention network for COVID-19 diagnosis on CT images.

Authors:  BingBing Zheng; Yu Zhu; Qin Shi; Dawei Yang; Yanmei Shao; Tao Xu
Journal:  Appl Intell (Dordr)       Date:  2022-04-09       Impact factor: 5.086

Review 4.  Role of Artificial Intelligence in COVID-19 Detection.

Authors:  Anjan Gudigar; U Raghavendra; Sneha Nayak; Chui Ping Ooi; Wai Yee Chan; Mokshagna Rohit Gangavarapu; Chinmay Dharmik; Jyothi Samanth; Nahrizul Adib Kadri; Khairunnisa Hasikin; Prabal Datta Barua; Subrata Chakraborty; Edward J Ciaccio; U Rajendra Acharya
Journal:  Sensors (Basel)       Date:  2021-12-01       Impact factor: 3.576

5.  A cell phone app for facial acne severity assessment.

Authors:  Jiaoju Wang; Yan Luo; Zheng Wang; Alphonse Houssou Hounye; Cong Cao; Muzhou Hou; Jianglin Zhang
Journal:  Appl Intell (Dordr)       Date:  2022-07-29       Impact factor: 5.019

6.  Parameter estimation of the incubation period of COVID-19 based on the doubly interval-censored data model.

Authors:  Ming-Ze Yin; Qing-Wen Zhu; Xing Lü
Journal:  Nonlinear Dyn       Date:  2021-06-18       Impact factor: 5.022

  6 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.