62 search results - page 6 / 13 » Evolutionary MCMC Sampling and Optimization in Discrete Spac... |
NIPS
2007
14 years 11 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
Many evolutionary computation search spaces require fitness assessment through the sampling of and generalization over a large set of possible cases as input. Such spaces seem par...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
This paper is concerned with developing an information-theoretic framework to aggregate the state space of a Hidden Markov Model (HMM) on discrete state and observation spaces. The...
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
In this paper, we present a novel evolutionary algorithm, called NOCEA, which is suitable for Data Mining (DM) clustering applications. NOCEA evolves individuals that consist of a ...