On a posteriori upper bounds for approximating linear functionals in a probabilistic setting.
Grzegorz W. WasilkowskiPublished in: J. Complex. (1992)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- linear functions
- bayesian networks
- higher order
- maximum likelihood
- uncertain data
- regret bounds
- tight bounds
- special case
- worst case
- information theoretic
- branch and bound algorithm
- belief networks
- computational complexity
- tight upper and lower bounds
- boolean expressions
- lower and upper bounds
- probabilistic reasoning
- posterior probability
- sample size
- training set