698 search results - page 51 / 140 » Bayesian probability |
KDD
1999
ACM
14 years 1 months ago
1999
ACM
Tree Augmented Naive Bayes (TAN) has shown to be competitive with state-of-the-art machine learning algorithms [3]. However, the TAN induction algorithm that appears in [3] can be...
UAI
2004
13 years 10 months ago
2004
Previous work on sensitivity analysis in Bayesian networks has focused on single parameters, where the goal is to understand the sensitivity of queries to single parameter changes...
COMGEO
2010
ACM
13 years 5 months ago
2010
ACM
The geographic profiling problem is to create an operationally useful estimate of the location of the home base of a serial criminal from the known locations of the offense sites....
KDD
2008
ACM
14 years 9 months ago
2008
ACM
Classic mixture models assume that the prevalence of the various mixture components is fixed and does not vary over time. This presents problems for applications where the goal is...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. â€...