scholarly journals Data Clustering based on Modified Differential Evolution and Quasi-Opposition-based Learning

2020 ◽  
Vol 13 (6) ◽  
pp. 168-178
Author(s):  
Pyae Cho ◽  
◽  
Thi Nyunt ◽  
Keyword(s):  
Differential Evolution ◽  
Heuristic Search ◽  
Clustering Algorithm ◽  
Population Based ◽  
Initial Population ◽  
Local Optima ◽  
Opposition Based Learning ◽  
De Algorithm ◽  
Mutation Strategy

Differential Evolution (DE) has become an advanced, robust, and proficient alternative technique for clustering on account of their population-based stochastic and heuristic search manners. Balancing better the exploitation and exploration power of the DE algorithm is important because this ability influences the performance of the algorithm. Besides, keeping superior solutions for the initial population raises the probability of finding better solutions and the rate of convergence. In this paper, an enhanced DE algorithm is introduced for clustering to offer better cluster solutions with faster convergence. The proposed algorithm performs a modified mutation strategy to improve the DE’s search behavior and exploits Quasi-Opposition-based Learning (QBL) to choose fitter initial solutions. This mutation strategy that uses the best solution as a target solution and applies three differentials contributes to avoiding local optima trap and slow convergence. The QBL based initialization method also contributes to increasing the quality of the clustering results and convergence rate. The experimental analysis was conducted on seven real datasets from the UCI repository to evaluate the performance of the proposed clustering algorithm. The obtained results showed that the proposed algorithm achieves more compact clusters and stable solutions than the competing conventional DE variants. Moreover, the performance of the proposed algorithm was compared with the existing state of the art clustering techniques based on DE. The corresponding results also pointed out that the proposed algorithm is comparable to other DE based clustering approaches in terms of the value of the objective functions. Therefore, the proposed algorithm can be regarded as an efficient clustering tool.

An Improved Differential Evolution Algorithm for Numerical Optimization Problems

2013 ◽  
Vol 415 ◽  
pp. 349-352
Author(s):  
Hong Wei Zhao ◽  
Hong Gang Xia
Keyword(s):  
Differential Evolution ◽  
Numerical Optimization ◽  
Optimization Problems ◽  
Differential Evolution Algorithm ◽  
Population Based ◽  
Local Optimum ◽  
Local Optima ◽  
De Algorithm ◽  
Evolution Algorithm ◽  
Improved Differential Evolution Algorithm

Differential evolution (DE) is a population-based stochastic function minimizer (or maximizer), whose simple yet powerful and straightforward features make it very attractive for numerical optimization. However, DE is easy to trapped into local optima. In this paper, an improved differential evolution algorithm (IDE) proposed to speed the convergence rate of DE and enhance the global search of DE. The IDE employed a new mutation operation and modified crossover operation. The former can rapidly enhance the convergence of the MDE, and the latter can prevent the MDE from being trapped into the local optimum effectively. Besides, we dynamic adjust the scaling factor (F) and the crossover rate (CR), which is aimed at further improving algorithm performance. Based on several benchmark experiment simulations, the IDE has demonstrated stronger convergence and stability than original differential (DE) algorithm and other algorithms (PSO and JADE) that reported in recent literature.

scholarly journals Differential evolution algorithm of soft island model based on K-means clustering

2020 ◽  
Vol 19 (3) ◽  
pp. 1548
Author(s):  
Xujie Tan ◽  
Seong-Yoon Shin
Keyword(s):  
Differential Evolution ◽  
Clustering Algorithm ◽  
Differential Evolution Algorithm ◽  
Population Based ◽  
Island Model ◽  
Benchmark Problems ◽  
De Algorithm ◽  
Mutation Strategies ◽  
The Individual ◽  
And Control

<p>Differential evolution (DE) is a highly effective evolutionary algorithm. However, the performance of DE depends on strategies and control parameters. The combination of many strategies helps balance the exploitation and exploration of DE. In this study, a multi-population based on<em> k</em>-means clustering is proposed to realize an ensemble of multiple strategies, thereby resulting in a new DE variant, namely KSDE, where similar individuals in the population implement the same mutation strategies, and dissimilar subpopulations migrate information through the soft island model (SIM). Firstly, the population is virtually divided into <em>k</em> subpopulations by the <em>k</em>-means clustering algorithm. Secondly, the individual specific mutation scheme is selected from a strategy pool by random method. Finally, the migration of subpopulation information is done using soft island model. The performance of the KSDE algorithm is evaluated on 13 benchmark problems. The experiments show that KSDE algorithm improves the performance of the DE algorithm.<strong></strong></p>

scholarly journals Adaptive Unified Differential Evolution for Clustering

2018 ◽  
Vol 12 (1) ◽  
pp. 53
Author(s):  
Maulida Ayu Fitriani ◽  
Aina Musdholifah ◽  
Sri Hartati
Keyword(s):  
Differential Evolution ◽  
Fitness Function ◽  
Single Mutation ◽  
Clustering Methods ◽  
Mutation Strategy ◽  
Clustering Quality ◽  
Silhouette Index ◽  
Mutation Strategies ◽  
Time Required

Various clustering methods to obtain optimal information continues to evolve one of its development is Evolutionary Algorithm (EA). Adaptive Unified Differential Evolution (AuDE), is the development of Differential Evolution (DE) which is one of the EA techniques. AuDE has self adaptive scale factor control parameters (F) and crossover-rate (Cr).. It also has a single mutation strategy that represents the most commonly used standard mutation strategies from previous studies.The AuDE clustering method was tested using 4 datasets. Silhouette Index and CS Measure is a fitness function used as a measure of the quality of clustering results. The quality of the AuDE clustering results is then compared against the quality of clustering results using the DE method.The results show that the AuDE mutation strategy can expand the cluster central search produced by ED so that better clustering quality can be obtained. The comparison of the quality of AuDE and DE using Silhoutte Index is 1:0.816, whereas the use of CS Measure shows a comparison of 0.565:1. The execution time required AuDE shows better but Number significant results, aimed at the comparison of Silhoutte Index usage of 0.99:1 , Whereas on the use of CS Measure obtained the comparison of 0.184:1.

scholarly journals An Improved Grey Wolf Optimizer Based on Differential Evolution and OTSU Algorithm

2020 ◽  
Vol 10 (18) ◽  
pp. 6343
Author(s):  
Yuanyuan Liu ◽  
Jiahui Sun ◽  
Haiye Yu ◽  
Yueyong Wang ◽  
Xiaokang Zhou
Keyword(s):  
Differential Evolution ◽  
Image Recognition ◽  
Optimal Solution ◽  
Tsallis Entropy ◽  
Grey Wolf Optimizer ◽  
Initial Population ◽  
Grey Wolf ◽  
Particle Swarm Optimizer ◽  
De Algorithm ◽  
Local Optimal Solution

Aimed at solving the problems of poor stability and easily falling into the local optimal solution in the grey wolf optimizer (GWO) algorithm, an improved GWO algorithm based on the differential evolution (DE) algorithm and the OTSU algorithm is proposed (DE-OTSU-GWO). The multithreshold OTSU, Tsallis entropy, and DE algorithm are combined with the GWO algorithm. The multithreshold OTSU algorithm is used to calculate the fitness of the initial population. The population is updated using the GWO algorithm and the DE algorithm through the Tsallis entropy algorithm for crossover steps. Multithreshold OTSU calculates the fitness in the initial population and makes the initial stage basically stable. Tsallis entropy calculates the fitness quickly. The DE algorithm can solve the local optimal solution of GWO. The performance of the DE-OTSU-GWO algorithm was tested using a CEC2005 benchmark function (23 test functions). Compared with existing particle swarm optimizer (PSO) and GWO algorithms, the experimental results showed that the DE-OTSU-GWO algorithm is more stable and accurate in solving functions. In addition, compared with other algorithms, a convergence behavior analysis proved the high quality of the DE-OTSU-GWO algorithm. In the results of classical agricultural image recognition problems, compared with GWO, PSO, DE-GWO, and 2D-OTSU-FA, the DE-OTSU-GWO algorithm had accuracy in straw image recognition and is applicable to practical problems. The OTSU algorithm improves the accuracy of the overall algorithm while increasing the running time. After adding the DE algorithm, the time complexity will increase, but the solution time can be shortened. Compared with GWO, DE-GWO, PSO, and 2D-OTSU-FA, the DE-OTSU-GWO algorithm has better results in segmentation assessment.

A new parameter setting-based modified differential evolution for function optimization

2020 ◽  
Vol 11 (04) ◽  
pp. 2050029
Author(s):  
Sukanta Nama ◽  
Apu Kumar Saha
Keyword(s):  
Performance Evaluation ◽  
Differential Evolution ◽  
Real World ◽  
Population Based ◽  
Function Optimization ◽  
Mutation Operator ◽  
Control Parameters ◽  
Test Results ◽  
Parameter Setting ◽  
De Algorithm

The population-based efficient iterative evolutionary algorithm (EA) is differential evolution (DE). It has fewer control parameters but is useful when dealing with complex problems of optimization in the real world. A great deal of progress has already been made and implemented in various fields of engineering and science. Nevertheless, DE is prone to the setting of control parameters in its performance evaluation. Therefore, the appropriate adjustment of the time-consuming control parameters is necessary to achieve optimal DE efficiency. This research proposes a new version of the DE algorithm control parameters and mutation operator. For the justifiability of the suggested method, several benchmark functions are taken from the literature. The test results are contrasted with other literary algorithms.

scholarly journals An Adaptive Hybrid Algorithm Based on Particle Swarm Optimization and Differential Evolution for Global Optimization

2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Xiaobing Yu ◽  
Jie Cao ◽  
Haiyan Shan ◽  
Li Zhu ◽  
Jun Guo
Keyword(s):  
Particle Swarm Optimization ◽  
Differential Evolution ◽  
Hybrid Algorithm ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Population Based ◽  
Stochastic Search ◽  
Adaptive Mutation ◽  
Swarm Optimization ◽  
Local Optima

Particle swarm optimization (PSO) and differential evolution (DE) are both efficient and powerful population-based stochastic search techniques for solving optimization problems, which have been widely applied in many scientific and engineering fields. Unfortunately, both of them can easily fly into local optima and lack the ability of jumping out of local optima. A novel adaptive hybrid algorithm based on PSO and DE (HPSO-DE) is formulated by developing a balanced parameter between PSO and DE. Adaptive mutation is carried out on current population when the population clusters around local optima. The HPSO-DE enjoys the advantages of PSO and DE and maintains diversity of the population. Compared with PSO, DE, and their variants, the performance of HPSO-DE is competitive. The balanced parameter sensitivity is discussed in detail.

Improved Clustering Algorithm for Design Structure Matrix

2012 ◽  
Author(s):  
Fredrik Borjesson ◽  
Katja Hölttä-Otto
Keyword(s):  
Clustering Algorithm ◽  
Hill Climbing ◽  
Design Structure Matrix ◽  
Computationally Efficient ◽  
Vacuum Cleaner ◽  
Local Optima ◽  
Structure Matrix ◽  
Design Structure ◽  
Clustering Problems

For clustering a large Design Structure Matrix (DSM), computerized algorithms are necessary. A common algorithm by Thebeau uses stochastic hill-climbing to avoid local optima. The output of the algorithm is stochastic, and to be certain a very good clustering solution has been obtained, it may be necessary to run the algorithm thousands of times. To make this feasible in practice, the algorithm must be computationally efficient. Two algorithmic improvements are presented. Together they improve the quality of the results obtained and increase speed significantly for normal clustering problems. The proposed new algorithm is applied to a cordless handheld vacuum cleaner.

Differential evolution tuned fuzzy supervisor adapted extended Kalman filtering for SLAM problems in mobile robots

Robotica ◽  
2009 ◽  
Vol 27 (3) ◽  
pp. 411-423 ◽  
Author(s):  
Amitava Chatterjee
Keyword(s):  
Differential Evolution ◽  
Mobile Robots ◽  
Autonomous Vehicles ◽  
Extended Kalman Filtering ◽  
Extended Kalman Filters ◽  
De Algorithm ◽  
Localization And Mapping ◽  
Recent Method ◽  
Fuzzy Supervisor

SUMMARYThe present paper proposes a successful application of differential evolution (DE) optimized fuzzy logic supervisors (FLS) to improve the quality of solutions that extended Kalman filters (EKFs) can offer to solve simultaneous localization and mapping (SLAM) problems for mobile robots and autonomous vehicles. The utility of the proposed system can be readily appreciated in those situations where an incorrect knowledge of Q and R matrices of EKF can significantly degrade the SLAM performance. A fuzzy supervisor has been implemented to adapt the R matrix of the EKF online, in order to improve its performance. The free parameters of the fuzzy supervisor are suitably optimized by employing the DE algorithm, a comparatively recent method, popularly employed now-a-days for high-dimensional parallel direct search problems. The utility of the proposed system is aptly demonstrated by solving the SLAM problem for a mobile robot with several landmarks and with wrong knowledge of sensor statistics. The system could successfully demonstrate enhanced performance in comparison with usual EKF-based solutions for identical environment situations.

scholarly journals Differential Evolution and Multiclass Support Vector Machine for Alzheimer’s Classification

2022 ◽  
Vol 2022 ◽  
pp. 1-13
Author(s):  
Jhansi Rani Kaka ◽  
K. Satya Prasad
Keyword(s):  
Support Vector Machine ◽  
Feature Selection ◽  
Differential Evolution ◽  
Optimization Method ◽  
Support Vector ◽  
Local Optima ◽  
Whale Optimization ◽  
Multiclass Support Vector Machine ◽  
Poor Convergence

Early diagnosis of Alzheimer’s helps a doctor to decide the treatment for the patient based on the stages. The existing methods involve applying the deep learning methods for Alzheimer’s classification and have the limitations of overfitting problems. Some researchers were involved in applying the feature selection based on the optimization method, having limitations of easily trapping into local optima and poor convergence. In this research, Differential Evolution-Multiclass Support Vector Machine (DE-MSVM) is proposed to increase the performance of Alzheimer’s classification. The image normalization method is applied to enhance the quality of the image and represent the features effectively. The AlexNet model is applied to the normalized images to extract the features and also applied for feature selection. The Differential Evolution method applies Pareto Optimal Front for nondominated feature selection. This helps to select the feature that represents the characteristics of the input images. The selected features are applied in the MSVM method to represent in high dimension and classify Alzheimer’s. The DE-MSVM method has accuracy of 98.13% in the axial slice, and the existing whale optimization with MSVM has 95.23% accuracy.

scholarly journals ALGORITMA DIFFERENTIAL EVOLUTION UNTUK PENJADWALAN FLOW SHOP BANYAK MESIN DENGAN MULTI OBYEKTIF

2012 ◽  
Vol 13 (1) ◽  
pp. 1
Author(s):  
Stefanus Eko Wiratno ◽  
Nurdiansyah Rudi ◽  
Budi Santosa
Keyword(s):  
Differential Evolution ◽  
Flow Shop ◽  
Computation Time ◽  
Parameter Determination ◽  
Adaptive Parameter ◽  
De Algorithm ◽  
Adaptive Parameters ◽  
Local Search Strategy ◽  
Reduce Computation Time

This research focuses on the development of Differential Evolution(DE) algorithmto solve m-machine flow shopscheduling problems with respect to both makespan and total flow time. Development of DE algorithm is done by modifyingthe adaptive parameter determination procedure in order to change the value of adaptive parameters in each generation,adding local search strategy to the algorithm in order to improve the quality of the resulting solutions, as ewell as modifyingthe crossover in order to reduce computation time. The result indicates that the proposed DE algorithm has proven to bebetter than the original DE algorithm, Genetic Algorithm (GA), and for certain cases it also out performs Multi-ObjectiveAnt Colony System Algorithm (MOCSA).

Sign in / Sign up

Export Citation Format

Share Document