Kumara Sastry
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Kumara Sastry has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- David E. Goldberg
University of Illinois at Urbana-Champaign
3 shared publications - Martin Pelikan
Department of Mathematics and Computer Science Missouri Estimation of Distribution Algorithms Laboratory (MEDAL) University of Missouri-St. Louis One University Blvd 63121 St. Louis MO
2 shared publications D. E. Goldberg
1 shared publication- David E. Goldberg
University of Illinois at Urbana-Champaign
1 shared publication - Hussein A. Abbass
University of New South Wales, Australia
1 shared publication - Martin V. Butz
University of Illinois at Urbana-Champaign
1 shared publication
Latest Publications
- Open Access
iBOA: The Incremental Bayesian Optimization Algorithm
This paper proposes the incremental Bayesian optimization algorithm (iBOA), which modifies standard BOA by removing the population of solutions and using incremental updates of the Bayesian network. iBOA is shown to be able to learn and exploit unrestricted Bayesian networks using incremental techniques for updating both the structure as well as the parameters of the probabilistic model. This represents an important step toward the design of competent incremental estimation of distribution algorithms that can solve difficult nearly decomposable problems scalably and reliably.
Open AccessiBOA: The Incremental Bayesian Optimization Algorithm
This paper proposes the incremental Bayesian optimization algorithm (iBOA), which modifies standard BOA by removing the population of solutions and using incremental updates of the Bayesian network. iBOA is shown to be able to learn and exploit unrestricted Bayesian networks using incremental techniques for updating both the structure as well as the parameters of the probabilistic model. This represents an important step toward the design of competent incremental estimation of distribution algorithms that can solve difficult nearly decomposable problems scalably and reliably.
- 29 August 2006
- Published by Springer Nature in Genetic Programming and Evolvable Machines
- Vol. 8 (1) , 5-37
Problem solution sustenance in XCS: Markov chain analysis of niche support distributions and the impact on computational complexity
- 29 August 2006
- Published by Springer Nature in Genetic Programming and Evolvable Machines
- Vol. 8 (1) , 5-37
Problem solution sustenance in XCS: Markov chain analysis of niche support distributions and the impact on computational complexity
- 1 March 2005
- Published by Springer Nature in Genetic Programming and Evolvable Machines
- Vol. 6 (1) , 53-77
Strong, Stable, and Reliable Fitness Pressure in XCS due to Tournament Selection
- 1 March 2005
- Published by Springer Nature in Genetic Programming and Evolvable Machines
- Vol. 6 (1) , 53-77
Strong, Stable, and Reliable Fitness Pressure in XCS due to Tournament Selection
- Open Access
Multiobjective hBOA, Clustering, and Scalability
This paper describes a scalable algorithm for solving multiobjective decomposable problems by combining the hierarchical Bayesian optimization algorithm (hBOA) with the nondominated sorting genetic algorithm (NSGA-II) and clustering in the objective space. It is first argued that for good scalability, clustering or some other form of niching in the objective space is necessary and the size of each niche should be approximately equal. Multiobjective hBOA (mohBOA) is then described that combines hBOA, NSGA-II and clustering in the objective space. The algorithm mohBOA differs from the multiobjective variants of BOA and hBOA proposed in the past by including clustering in the objective space and allocating an approximately equally sized portion of the population to each cluster. The algorithm mohBOA is shown to scale up well on a number of problems on which standard multiobjective evolutionary algorithms perform poorly.
Open AccessMultiobjective hBOA, Clustering, and Scalability
This paper describes a scalable algorithm for solving multiobjective decomposable problems by combining the hierarchical Bayesian optimization algorithm (hBOA) with the nondominated sorting genetic algorithm (NSGA-II) and clustering in the objective space. It is first argued that for good scalability, clustering or some other form of niching in the objective space is necessary and the size of each niche should be approximately equal. Multiobjective hBOA (mohBOA) is then described that combines hBOA, NSGA-II and clustering in the objective space. The algorithm mohBOA differs from the multiobjective variants of BOA and hBOA proposed in the past by including clustering in the objective space and allocating an approximately equally sized portion of the population to each cluster. The algorithm mohBOA is shown to scale up well on a number of problems on which standard multiobjective evolutionary algorithms perform poorly.
- Open Access
Sub-Structural Niching in Non-Stationary Environments
Niching enables a genetic algorithm (GA) to maintain diversity in a population. It is particularly useful when the problem has multiple optima where the aim is to find all or as many as possible of these optima. When the fitness landscape of a problem changes overtime, the problem is called non--stationary, dynamic or time--variant problem. In these problems, niching can maintain useful solutions to respond quickly, reliably and accurately to a change in the environment. In this paper, we present a niching method that works on the problem substructures rather than the whole solution, therefore it has less space complexity than previously known niching mechanisms. We show that the method is responding accurately when environmental changes occur.
Open AccessSub-Structural Niching in Non-Stationary Environments
Niching enables a genetic algorithm (GA) to maintain diversity in a population. It is particularly useful when the problem has multiple optima where the aim is to find all or as many as possible of these optima. When the fitness landscape of a problem changes overtime, the problem is called non--stationary, dynamic or time--variant problem. In these problems, niching can maintain useful solutions to respond quickly, reliably and accurately to a change in the environment. In this paper, we present a niching method that works on the problem substructures rather than the whole solution, therefore it has less space complexity than previously known niching mechanisms. We show that the method is responding accurately when environmental changes occur.