589 search results - page 4 / 118 » On the Use of Combining Rules in Relational Probability Tree... |
QUESTA
2007
13 years 5 months ago
2007
Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems in Monte-Carlo simulation. In the last few years, appli...
KI
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. Markov logic, as a highly expressive representation formalism that essentially combines the semantics of probabilistic graphical models with the full power of first-orde...
ESSLLI
1999
Springer
13 years 10 months ago
1999
Springer
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
RSFDGRC
2007
Springer
13 years 12 months ago
2007
Springer
Constructing accurate classifier based on association rule is an important and challenging task in data mining. In this paper, a novel combination strategy based on rough sets (RST...
ICTAI
2006
IEEE
13 years 11 months ago
2006
IEEE
Existing work shows that classic decision trees have inherent deficiencies in obtaining a good probability-based ranking (e.g. AUC). This paper aims to improve the ranking perfor...