Differential evolution (DE) algorithm with a small population size is called Micro-DE (MDE). A small population size decreases the computational complexity but also reduces the exploration ability of DE by limiting the population diversity. In this paper, we propose the idea of combining ensemble mutation scheme selection and opposition-based learning concepts to enhance the diversity of population in MDE at mutation and selection stages. The proposed algorithm enhances the diversity of population by generating a random mutation scale factor per individual and per dimension, randomly assigning a mutation scheme to each individual in each generation, and diversifying individuals selection using opposition-based learning. This approach is easy to implement and does not require the setting of mutation scheme selection and mutation scale factor. Experimental results are conducted for a variety of objective functions with low and high dimensionality on the CEC Black- Box Optimization Benchmarking 2015 (CEC-BBOB 2015). The results show superior performance of the proposed algorithm compared to the other micro-DE algorithms.
OBL has Type-I and Type-II schemes @cite_3 , @cite_1 . The Type-I scheme has enhanced the performance of micro-ODE for image thresholding @cite_0 . This approach showed a better performance compared to the MDE algorithm.
@cite_0 @cite_1 @cite_3
2043846600 1993487275 2107722300 2274829541
The concept of opposition-based learning (OBL) can be categorized into Type-I and Type-II OBL methodologies. The Type-I OBL is based on the opposite points in the variable space while the Type-II OBL considers the opposite of function value on the landscape. In the past few years, many research works have been conducted on development of Type-I OBL-based approaches with application in science and engineering, such as opposition-based differential evolution (ODE). However, compared to Type-I OBL, which cannot address a real sense of opposition in term of objective value, the Type-II OBL is capable to discover more meaningful knowledge about problem’s landscape. Due to natural difficulty of proposing a Type-II-based approach, very limited research has been reported in that direction. In this paper, for the first time, the concept of Type-II OBL has been investigated in detail in optimization; also it is applied on the DE algorithm as a case study. The proposed algorithm is called oppositionbased differential evolution Type-II (ODE-II) algorithm; it is validated on the testbed proposed for the IEEE Congress on Evolutionary Computation 2013 (IEEE CEC-2013) contest with 28 benchmark functions. Simulation results on the benchmark functions demonstrate the effectiveness of the proposed method as the first step for further developments in Type-II OBL-based schemes. We describe how oriented Basic Image Feature Columns (oBIF Columns) can be used for writer identification and how this texture-based scheme can be enhanced by encoding a writer's style as the deviation from the mean encoding for a population of writers. We hypothesise that this deviation, the Delta encoding, provides a more informative encoding than the texture-based encoding alone. The methods have been evaluated using the IAM dataset and by making entries to two top international competitions for assessing the state-of-the-art in writer identification. We demonstrate that the oBIF Column scheme on its own is sufficient to gain a performance level of 99 when tested using 300 writers from the IAM dataset. However, on the more challenging competition datasets, significantly improved performance was obtained using the Delta encoding scheme, which achieved first place in both competitions. In our characterisation of the Delta encoding, we demonstrate that the method is making use of information contained in the correlation between the written style of different textual elements, which may not be used by other methods. HighlightsWe present a full description of the oBIF Column method as applied to writer identification.We evaluate the oBIF Column encoding scheme using the IAM dataset, producing a performance of 99 for 301 writers.We present the Delta encoding, an addition to the oBIF Column scheme.We evaluate the Delta encoding using two leading international competitions, gaining first place in both.We show how our method uses different sources of information. Image thresholding is a challenging task in image processing field. Many efforts have already been made to propose universal, robust methods to handle a wide range of images. Previously by the same authors, an optimization-based thresholding approach was introduced. According to the proposed approach, differential evolution (DE) algorithm, minimizes dissimilarity between the input grey-level image and the bi-level (thresholded) image. In the current paper, micro opposition-based differential evolution (micro-ODE), DE with very small population size and opposition-based population initialization, has been proposed. Then, it is compared with a well-known thresholding method, Kittler algorithm and also with its non-opposition-based version (micro-DE). In overall, the proposed approach outperforms Kittler method over 16 challenging test images. Furthermore, the results confirm that the micro-ODE is faster than micro-DE because of embedding the opposition-based population initialization. Recent sequential pattern mining methods have used the minimum description length (MDL) principle to define an encoding scheme which describes an algorithm for mining the most compressing patterns in a database. We present a novel subsequence interleaving model based on a probabilistic model of the sequence database, which allows us to search for the most compressing set of patterns without designing a specific encoding scheme. Our proposed algorithm is able to efficiently mine the most relevant sequential patterns and rank them using an associated measure of interestingness. The efficient inference in our model is a direct result of our use of a structural expectation-maximization framework, in which the expectation-step takes the form of a submodular optimization problem subject to a coverage constraint. We show on both synthetic and real world datasets that our model mines a set of sequential patterns with low spuriousness and redundancy, high interpretability and usefulness in real-world applications. Furthermore, we demonstrate that the quality of the patterns from our approach is comparable to, if not better than, existing state of the art sequential pattern mining algorithms.