1683 search results - page 66 / 337 » Learning with Mixtures of Trees |
160
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
The structure of a Bayesian network (BN) encodes variable independence. Learning the structure of a BN, however, is typically of high computational complexity. In this paper, we e...
144
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
We present data-dependent error bounds for transductive learning based on transductive Rademacher complexity. For specific algorithms we provide bounds on their Rademacher complex...
152
click to vote
KBS
2002
15 years 3 months ago
2002
In this paper, a hybrid learning approach named HDT is proposed. HDT simulates human reasoning by using symbolic learning to do qualitative analysis and using neural learning to d...
142
click to vote
IJIT
2004
15 years 5 months ago
2004
A sequential decision problem, based on the task of identifying the species of trees given acoustic echo data collected from them, is considered with well-known stochastic classifi...
137
Voted
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, a novel standard variance feature is proposed for background modeling in dynamic scenes involving waving trees and ripples in water. The standard variance feature i...