495 search results - page 59 / 99 » Probability Trees |
GECCO
2004
Springer
14 years 2 months ago
2004
Springer
In this paper we examine the effects of single node mutations on trees evolved via genetic programming. The results show that neutral mutations are less likely for nodes nearer th...
IJAR
2006
13 years 8 months ago
2006
Mixtures of truncated exponentials (MTE) potentials are an alternative to discretization for solving hybrid Bayesian networks. Any probability density function can be approximated...
ICML
2006
IEEE
14 years 9 months ago
2006
IEEE
The structure of a Bayesian network (BN) encodes variable independence. Learning the structure of a BN, however, is typically of high computational complexity. In this paper, we e...
COLT
2001
Springer
14 years 1 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
CEC
2011
IEEE
12 years 8 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...