Sciweavers

3020 search results - page 203 / 604
» Optimal partition trees
Sort
View
CEC
2010
IEEE
15 years 7 months ago
Learning-assisted evolutionary search for scalable function optimization: LEM(ID3)
Inspired originally by the Learnable Evolution Model(LEM) [5], we investigate LEM(ID3), a hybrid of evolutionary search with ID3 decision tree learning. LEM(ID3) involves interleav...
Guleng Sheri, David Corne
ISBRA
2009
Springer
16 years 1 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
16 years 7 months ago
The offset tree for learning with partial labels
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
Alina Beygelzimer, John Langford
SWAT
2004
Springer
108views Algorithms» more  SWAT 2004»
15 years 12 months ago
Pointed Binary Encompassing Trees
For n disjoint line segments in the plane we can construct a binary encompassing tree such that every vertex is pointed, what’s more, at every segment endpoint all incident edges...
Michael Hoffmann, Bettina Speckmann, Csaba D. T&oa...
GECCO
2003
Springer
15 years 11 months ago
Visualizing Tree Structures in Genetic Programming
This paper presents methods to visualize the structure of trees that occur in genetic programming. These methods allow for the inspection of structure of entire trees of arbitrary ...
Jason M. Daida, Adam M. Hilss, David J. Ward, Step...