We present a supervised wrapper approach to discretization. In contrast to many classical approaches, the discretization process is multivariate: all variables are discretized simultaneously, and the proposed discreti...
详细信息
We present a supervised wrapper approach to discretization. In contrast to many classical approaches, the discretization process is multivariate: all variables are discretized simultaneously, and the proposed discretization is evaluated with the Naive-Bayes classifier. The search for the optimal discretization is carried out as an optimization process with the learning model estimated accuracy guiding it. The global optimization algorithm is based on estimation of distribution algorithms, a set of novel algorithms which are special kinds of evolutionary algorithms. In order to evaluate the behaviour of the algorithm, an analysis of different parameters is performed by means of analysis of variance (ANOVA). The evaluation was carried out using artificial datasets, and with UCI datasets. The results suggest that the proposed method provides an effective and robust technique for discretizating variables.
On-Line Analytical Processing (OLAP) tools are frequently used in business,science and health to extract useful knowledge from massive *** important and hard optimization problem in OLAP data warehouses is the view ...
详细信息
On-Line Analytical Processing (OLAP) tools are frequently used in business,science and health to extract useful knowledge from massive *** important and hard optimization problem in OLAP data warehouses is the view selection problem,consisting of selecting a set of aggregate views of the data for speeding up future query *** apply one n estimation of distribution algorithms (EDAs) to view selection under a size *** emphasis is to determine the suitability of the combination of EDAs with constraint handling to the view selection problem,compared to a widely used genetic *** EDAs are competitive with the genetic algorithm on a variety of problem instances,often nding approximate optimal solutions in a reasonable amount of time.
This paper deals with using density ensembles methods to enhance continuous estimation of distribution algorithms. In particular, two density ensembles methods are applied: one is resampling method and the other is su...
详细信息
ISBN:
(纸本)9781424447053
This paper deals with using density ensembles methods to enhance continuous estimation of distribution algorithms. In particular, two density ensembles methods are applied: one is resampling method and the other is subspaces method. In resampling continuous estimation of distribution algorithms, a population of densities are obtained by resampling operator and density estimation operator, and new candidate solutions are reproduced by sampling from all obtained densities. In subspaces continuous estimation of distribution algorithms, a population of densities are obtained by randomly selecting a subset of all variables and estimating the density of high quality solutions in this subspace. The above steps iterate and many densities of high quality solutions in different subspaces are achieved. New candidate solutions are reproduced through perturbing old promising solutions in these subspaces.
estimation of distribution Algorithm (EDA) is an intelligent optimization technique widely applied in production scheduling. In algorithm application, time complexity is an important criterion of concern. However, the...
详细信息
ISBN:
(纸本)9789819947546;9789819947553
estimation of distribution Algorithm (EDA) is an intelligent optimization technique widely applied in production scheduling. In algorithm application, time complexity is an important criterion of concern. However, there is relatively little theoretical research on the time complexity of these algorithms. We propose a single machine scheduling with deteriorating effect (SMSDE) and give a proof of its property. Under the objective of minimizing the makespan, the convergence time (CT) of EDA to solve SMSDE is obtained. Then, we obtain the First Hitting Time (FHT) of EDA solving SMSDE from CT. This study provides some theoretical support for the application of EDA.
estimation of distribution algorithms (EDAs) focus on explicitly modelling dependencies between solution variables. A Gaussian distribution over continuous variables is commonly used, with several different covariance...
详细信息
ISBN:
(纸本)9781467315098
estimation of distribution algorithms (EDAs) focus on explicitly modelling dependencies between solution variables. A Gaussian distribution over continuous variables is commonly used, with several different covariance matrix structures ranging from diagonal i.e. Univariate Marginal distribution Algorithm (UMDA(c)) to full i.e. estimation of Multivariate Normal density Algorithm (EMNA). A diagonal covariance model is simple but is unable to directly represent covariances between problem variables. On the other hand, a full covariance model requires estimation of (more) parameters from the selected population. In practice, numerical issues can arise with this estimation problem. In addition, the performance of the model has been shown to be sometimes undesirable. In this paper, a modified Gaussian-based continuous EDA is proposed, called sEDA, that provides a mechanism to control the amount of covariance parameters estimated within the Gaussian model. To achieve this, a simple variable screening technique from experimental design is adapted and combined with an idea inspired by the Pareto-front in multi-objective optimization. Compared to EMNA(global), the algorithm provides improved numerical stability and can use a smaller selected population. Experimental results are presented to evaluate and compare the performance of the algorithm to UMDA(c) and EMNA(global)
To systematically harmonize the conflict between selective pressure and population diversity in estimation of distribution algorithms, an improved estimation of distribution algorithms based on the minimal free energy...
详细信息
ISBN:
(纸本)9783037858066
To systematically harmonize the conflict between selective pressure and population diversity in estimation of distribution algorithms, an improved estimation of distribution algorithms based on the minimal free energy (IEDA) is proposed in this paper. IEDA conforms to the principle of minimal free energy in simulating the competitive mechanism between energy and entropy in annealing process, in which population diversity is measured by similarity entropy and the minimum free energy is simulated with an efficient and effective competition by free energy component. Through solving some typical numerical optimization problems, satisfactory results were achieved, which showed that IEDA was a preferable algorithm to avoid the premature convergence effectively and reduce the cost in search to some extent.
In this paper, we discuss a curious relationship between Cooperative Coevolutionary algorithms (CCEAs) and univariate estimation of distribution algorithms (EDAs). Specifically, the distribution model for univariate E...
详细信息
ISBN:
(纸本)9781605584140
In this paper, we discuss a curious relationship between Cooperative Coevolutionary algorithms (CCEAs) and univariate estimation of distribution algorithms (EDAs). Specifically, the distribution model for univariate EDAs is equivalent to the infinite population EGT model common in the analysis of CCEAs. This relationship may permit cross-pollination between these two disparate fields. As an example, we derive a new EDA based on a known CCEA from the literature, and provide some preliminary experimental analysis of the algorithm.
estimation of distribution algorithms are a set of algorithms that belong to the field of Evolutionary Computation. Characterized by the use of probabilistic models to learn the (in)dependencies between the variables ...
详细信息
ISBN:
(纸本)9783642249570;9783642249587
estimation of distribution algorithms are a set of algorithms that belong to the field of Evolutionary Computation. Characterized by the use of probabilistic models to learn the (in)dependencies between the variables of the optimization problem, these algorithms have been applied to a wide set of academic and real-world optimization problems, achieving competitive results in most scenarios. However, they have not been extensively developed for permutation-based problems. In this paper we introduce a. new EDA approach specifically designed to deal with permutation-based problems. In this paper, our proposal estimates a. probability distribution over permutations by means of a distance-based exponential model called the Mallows model. In order to analyze the performance of the Mallows model in EDAs, we carry out some experiments over the Permutation Flowshop Scheduling Problem (PFSP), and compare the results with those obtained by two state-of-the-art EDAs for permutation-based problems.
In this paper, we identify a number of topics relevant for the improvement and development of discrete estimation of distribution algorithms. Focusing on the role of probability distributions and factorizations in est...
详细信息
In many optimization domains the solution of the problem can be made more efficient by the construction of a surrogate fitness model. estimation of distribution algorithms (EDAs) are a class of evolutionary algorithms...
详细信息
ISBN:
(纸本)9783319037554;9783319037561
In many optimization domains the solution of the problem can be made more efficient by the construction of a surrogate fitness model. estimation of distribution algorithms (EDAs) are a class of evolutionary algorithms particularly suitable for the conception of model-based surrogate techniques. Since EDAs generate probabilistic models, it is natural to use these models as surrogates. However, there exist many types of models and methods to learn them. The issues involved in the conception of model-based surrogates for EDAs are various and some of them have received scarce attention in the literature. In this position paper, we propose a unified view for model-based surrogates in EDAs and identify a number of critical issues that should be dealt with in order to advance the research in this area.
暂无评论