481 search results - page 6 / 97 » Learning relational probability trees |
ICML
1996
IEEE
14 years 8 months ago
1996
IEEE
In this paper, we describe two di erent learning tasks for relational structures. When learning a classi er for structures, the relational structures in the training sets are clas...
AIPS
2008
13 years 9 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
ICML
2003
IEEE
14 years 21 days ago
2003
IEEE
AUC(Area Under the Curve) of ROC(Receiver Operating Characteristics) has been recently used as a measure for ranking performanceof learning algorithms. In this paper, wepresent a ...
FSKD
2007
Springer
14 years 1 months ago
2007
Springer
Naïve Bayes is a well-known effective and efficient classification algorithm, but its probability estimation performance is poor. Averaged One-Dependence Estimators, simply AODE,...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
We consider the problem of the binary classification on imbalanced data, in which nearly all the instances are labelled as one class, while far fewer instances are labelled as the...