712 search results - page 5 / 143 » The Complexity of Constructing Evolutionary Trees Using Expe... |
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
KDD
1998
ACM
15 years 2 months ago
1998
ACM
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
64
Voted
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
This paper presents a genetic programming-based symbolic regression approach to the construction of relational features in link analysis applications. Specifically, we consider t...
CORR
2004
Springer
14 years 10 months ago
2004
Springer
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
RECOMB
2001
Springer
15 years 10 months ago
2001
Springer
We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working...