495 search results - page 6 / 99 » Probability Trees |
SIAMDM
2010
13 years 2 months ago
2010
We prove that if T is a tree on n vertices with maximum degree and the edge probability p(n) satisfies: np C max{ log n, n } for some constant > 0, then with high probability...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
ISIPTA
2003
IEEE
14 years 22 days ago
2003
IEEE
This article introduces a new way of understanding subjective probability and its generalization to lower and upper prevision. Instead of asking whether a person is willing to pay...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
We examine the relationship between the predictions made by different learning algorithms and true posterior probabilities. We show that maximum margin methods such as boosted tre...
AUSAI
2006
Springer
13 years 11 months ago
2006
Springer
Decision tree-based probability estimation has received great attention because accurate probability estimation can possibly improve classification accuracy and probability-based r...