68 search results - page 2 / 14 » A Probabilistic Ensemble Pruning Algorithm |
UAI
2000
14 years 11 months ago
2000
Qualitative probabilistic networks have been designed for probabilistic reasoning in a qualitative way. Due to their coarse level of representation detail, qualitative probabilist...
DIS
2008
Springer
14 years 11 months ago
2008
Springer
Decision trees are among the most effective and interpretable classification algorithms while ensembles techniques have been proven to alleviate problems regarding over-fitting and...
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper explores the problem of how to construct lazy decision tree ensembles. We present and empirically evaluate a relevancebased boosting-style algorithm that builds a lazy ...
TSP
2008
14 years 9 months ago
2008
In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a pro...
ICDE
2011
IEEE
14 years 1 months ago
2011
IEEE
— Many real-world applications deal with uncertain or missing data, prompting a surge of activity in the area of probabilistic databases. A shortcoming of prior work is the assum...