1594 search results - page 143 / 319 » Fast Prediction on a Tree |
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
We consider the problem of learning a sparse multi-task regression, where the structure in the outputs can be represented as a tree with leaf nodes as outputs and internal nodes a...
SIGMOD
2001
ACM
14 years 8 months ago
2001
ACM
Availability requirements for database systems are more stringent than ever before with the widespread use of databases as the foundation for ebusiness. This paper highlights Fast...
ECML
2003
Springer
14 years 1 months ago
2003
Springer
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...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...