Sciweavers

495 search results - page 12 / 99
» Probability Trees
Sort
View
IJFCS
2007
54views more  IJFCS 2007»
13 years 8 months ago
Pure and O-Substitution
The basic properties of distributivity and deletion of pure and o-substitution are investigated. The obtained results are applied to show preservation of recognizability in a numb...
Andreas Maletti
STOC
2000
ACM
117views Algorithms» more  STOC 2000»
14 years 28 days ago
Faster suffix tree construction with missing suffix links
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...
Richard Cole, Ramesh Hariharan
RSA
2002
69views more  RSA 2002»
13 years 8 months ago
On the covariance of the level sizes in random recursive trees
In this paper we study the covariance structure of the number of nodes k and l steps away from the root in random recursive trees. We give an analytic expression valid for all k, ...
Remco van der Hofstad, Gerard Hooghiemstra, Piet V...
ICMLA
2008
13 years 10 months ago
Calibrating Random Forests
When using the output of classifiers to calculate the expected utility of different alternatives in decision situations, the correctness of predicted class probabilities may be of...
Henrik Boström
ECML
2003
Springer
14 years 1 months ago
Improving the AUC of Probabilistic Estimation Trees
Abstract. In this work we investigate several issues in order to improve the performance of probabilistic estimation trees (PETs). First, we derive a new probability smoothing that...
César Ferri, Peter A. Flach, José He...