1060 search results - page 61 / 212 » On the Discovery of Random Trees |
113
click to vote
MCS
2004
Springer
15 years 3 months ago
2004
Springer
We experimentally evaluate bagging and six other randomization-based approaches to creating an ensemble of decision-tree classifiers. Bagging uses randomization to create multipl...
KDD
2003
ACM
15 years 10 months ago
2003
ACM
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
CORR
2004
Springer
14 years 10 months ago
2004
Springer
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
CIE
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The members of Martin-L¨of random closed sets under a distribution studied by Barmpalias et al. are exactly the infinite paths through Martin-L¨of random Galton-Watson...
104
click to vote
NIPS
2008
14 years 11 months ago
2008
We introduce a new interpretation of multiscale random fields (MSRFs) that admits efficient optimization in the framework of regular (single level) random fields (RFs). It is base...