Sciweavers

450 search results - page 20 / 90
» Estimating Search Tree Size
Sort
View
NIPS
2001
13 years 10 months ago
Thin Junction Trees
We present an algorithm that induces a class of models with thin junction trees--models that are characterized by an upper bound on the size of the maximal cliques of their triang...
Francis R. Bach, Michael I. Jordan
EDBT
2000
ACM
14 years 15 days ago
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...
ICMLA
2007
13 years 10 months ago
Estimating class probabilities in random forests
For both single probability estimation trees (PETs) and ensembles of such trees, commonly employed class probability estimates correct the observed relative class frequencies in e...
Henrik Boström
EUROGP
2004
Springer
145views Optimization» more  EUROGP 2004»
14 years 2 months ago
Toward an Alternative Comparison between Different Genetic Programming Systems
In this paper, we use multi-objective techniques to compare different genetic programming systems, permitting our comparison to concentrate on the effect of representation and sepa...
Nguyen Xuan Hoai, Robert I. McKay, Daryl Essam, Hu...
IPPS
1997
IEEE
14 years 1 months ago
d-Dimensional Range Search on Multicomputers
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin...