Differential Evolution for the Optimization of DMSO-Free Cryoprotectants: Influence of Control Parameters

This study presents the influence of control parameters including population (NP) size, mutation factor (F), crossover (Cr), and four types of differential evolution (DE) algorithms including random, best, local-to-best, and local-to-best with self-adaptive (SA) modification for the purpose of optimizing the compositions of dimethylsufloxide (DMSO)-free cryoprotectants. Post-thaw recovery of Jurkat cells cryopreserved with two DMSO-free cryoprotectants at a cooling rate of 1 °C/min displayed a nonlinear, four-dimensional structure with multiple saddle nodes, which was a suitable training model to tune the control parameters and select the most appropriate type of differential evolution algorithm. Self-adaptive modification presented better performance in terms of optimization accuracy and sensitivity of mutation factor and crossover among the four different types of algorithms tested. Specifically, the classical type of differential evolution algorithm exhibited a wide acceptance to mutation factor and crossover. The optimization performance is more sensitive to mutation than crossover and the optimization accuracy is proportional to the population size. Increasing population size also reduces the sensitivity of the algorithm to the value of the mutation factor and crossover. The analysis of optimization accuracy and convergence speed suggests larger population size with F > 0.7 and Cr > 0.3 are well suited for use with cryopreservation optimization purposes. The tuned differential evolution algorithm is validated through finding global maximums of other two DMSO-free cryoprotectant formulation datasets. The results of these studies can be used to help more efficiently determine the optimal composition of multicomponent DMSO-free cryoprotectants in the future.

Cancer diagnosis through a tandem of classifiers for digitized histopathological slides

The current research study is concerned with the automated differentiation between histopathological slides from colon tissues with respect to four classes (healthy tissue and cancerous of grades 1, 2 or 3) through an optimized ensemble of predictors. Six distinct classifiers with prediction accuracies ranging from 87% to 95% are considered for the task. The proposed method of combining them takes into account the probabilities of the individual classifiers for each sample to be assigned to any of the four classes, optimizes weights for each technique by differential evolution and attains an accuracy that is significantly better than the individual results. Moreover, a degree of confidence is defined that would allow the pathologists to separate the data into two distinct sets, one that is correctly classified with a high level of confidence and the rest that would need their further attention. The tandem is also validated on other benchmark data sets. The proposed methodology proves to be efficient in improving the classification accuracy of each algorithm taken separately and performs reasonably well on other data sets, even with default weights. In addition, by establishing a degree of confidence the method becomes more viable for use by actual practitioners.

Utilization of the Discrete Differential Evolution for Optimization in Multidimensional Point Clouds

The Differential Evolution (DE) is a widely used bioinspired optimization algorithm developed by Storn and Price. It is popular for its simplicity and robustness. This algorithm was primarily designed for real-valued problems and continuous functions, but several modified versions optimizing both integer and discrete-valued problems have been developed. The discrete-coded DE has been mostly used for combinatorial problems in a set of enumerative variants. However, the DE has a great potential in the spatial data analysis and pattern recognition. This paper formulates the problem as a search of a combination of distinct vertices which meet the specified conditions. It proposes a novel approach called the Multidimensional Discrete Differential Evolution (MDDE) applying the principle of the discrete-coded DE in discrete point clouds (PCs). The paper examines the local searching abilities of the MDDE and its convergence to the global optimum in the PCs. The multidimensional discrete vertices cannot be simply ordered to get a convenient course of the discrete data, which is crucial for good convergence of a population. A novel mutation operator utilizing linear ordering of spatial data based on the space filling curves is introduced. The algorithm is tested on several spatial datasets and optimization problems. The experiments show that the MDDE is an efficient and fast method for discrete optimizations in the multidimensional point clouds.