1060 search results - page 81 / 212 » On the Discovery of Random Trees |
108
Voted
CISS
2007
IEEE
15 years 2 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
CVPR
2005
IEEE
16 years 5 days ago
2005
IEEE
Random subspaces are a popular ensemble construction technique that improves the accuracy of weak classifiers. It has been shown, in different domains, that random subspaces combi...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
NIPS
2001
14 years 11 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
Sample selection bias is a common problem in many real world applications, where training data are obtained under realistic constraints that make them follow a different distribut...