Learning optimal discriminant functions through a cooperative game of automata
IEEE Transactions on Systems, Man and Cybernetics
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Introduction to the theory of neural computation
Introduction to the theory of neural computation
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
Learning Belief Networks in the Presence of Missing Values and Hidden Variables
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
Uniform Crossover in Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Using Optimal Dependency-Trees for Combinational Optimization
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
Proceedings of the 5th International Conference on Genetic Algorithms
Topics in black-box combinatorial optimization
Topics in black-box combinatorial optimization
Sample complexity of model-based search
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
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
Proceedings of the 13th ACM Great Lakes symposium on VLSI
Finding effective compilation sequences
Proceedings of the 2004 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
SGMIT: using selfish gene theory to construct mutualinformation trees for optimization
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
A machine learning approach for statistical software testing
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Incomplete tree search using adaptive probing
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A self-guided genetic algorithm for flowshop scheduling problems
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Multi-objective combinatorial optimisation with coincidence algorithm
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
SGEGC: A Selfish Gene Theory Based Optimization Method by Exchanging Genetic Components
ISICA '09 Proceedings of the 4th International Symposium on Advances in Computation and Intelligence
Quantum-inspired evolutionary algorithm: a multimodel EDA
IEEE Transactions on Evolutionary Computation - Special issue on evolutionary algorithms based on probabilistic models
Expert Systems with Applications: An International Journal
Estimation of distribution algorithm for permutation flow shops with total flowtime minimization
Computers and Industrial Engineering
Estimation of distribution algorithms: from available implementations to potential developments
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
A Self-guided Genetic Algorithm for permutation flowshop scheduling problems
Computers and Operations Research
Extended artificial chromosomes genetic algorithm for permutation flowshop scheduling problems
Computers and Industrial Engineering
A study on the global convergence time complexity of estimation of distribution algorithms
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Revisiting the Memory of Evolution
Fundamenta Informaticae
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
| Hi-index | 0.00 |
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture inter-parameter dependencies can have prohibitive computational costs. The algorithm presented in this paper, termed COMIT, provides a method for using probabilistic models in conjunction with fast search techniques. We show how COMIT can be used with two very different fast search algorithms: hillclimbing and Population-based incremental learning (PBIL). The resulting algorithms maintain many of the benefits of probabilistic modeling, with far less computational expense. Extensive empirical results are provided; COMIT has been successfully applied to jobshop scheduling, traveling salesman, and knapsack problems. This paper also presents a review of probabilistic modeling for combinatorial optimization.