Fast probabilistic modeling for combinatorial optimization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
The selfish gene algorithm: a new evolutionary optimization strategy
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Using Optimal Dependency-Trees for Combinational Optimization
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
From Recombination of Genes to the Estimation of Distributions I. Binary Parameters
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
Cluster ensembles --- a knowledge reuse framework for combining multiple partitions
The Journal of Machine Learning Research
Bagging for Path-Based Clustering
IEEE Transactions on Pattern Analysis and Machine Intelligence
Combining Multiple Clusterings Using Evidence Accumulation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Knowledge and Information Systems
Resampling-based selective clustering ensembles
Pattern Recognition Letters
Geometric Mean for Subspace Selection
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Evolutionary Computation
On the Scalability of Real-Coded Bayesian Optimization Algorithm
IEEE Transactions on Evolutionary Computation
Multitraining Support Vector Machine for Image Retrieval
IEEE Transactions on Image Processing
Hi-index | 0.01 |
In this paper, we focus on the design of bivariate EDAs for discrete optimization problems and propose a new approach named HSMIEC. While the current EDAs require much time in the statistical learning process as the relationships among the variables are too complicated, we employ the Selfish gene theory (SG) in this approach, as well as a Mutual Information and Entropy based Cluster (MIEC) model is also set to optimize the probability distribution of the virtual population. This model uses a hybrid sampling method by considering both the clustering accuracy and clustering diversity and an incremental learning and resample scheme is also set to optimize the parameters of the correlations of the variables. Compared with several benchmark problems, our experimental results demonstrate that HSMIEC often performs better than some other EDAs, such as BMDA, COMIT, MIMIC and ECGA.