680 search results - page 38 / 136 » A randomized embedding algorithm for trees |
PAKDD
2007
ACM
14 years 3 months ago
2007
ACM
Abstract. In our previous studies, Genetic Programming (GP), Probabilistic Incremental Program Evolution (PIPE) and Ant Programming (AP) have been used to optimal design of Flexibl...
EUROCAST
2009
Springer
14 years 3 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
ICANNGA
2007
Springer
14 years 25 days ago
2007
Springer
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
KDD
2009
ACM
14 years 9 months ago
2009
ACM
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...
TCBB
2010
2010
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
13 years 3 months ago
In this paper we are interested in the problem of approximating trees by trees with a particular self-nested structure. Self-nested trees are such that all their subtrees of a give...