<< Click to Display Table of Contents >> Likelihood Sampling |
This likelihood sampling algorithm is described in (Fung & Chang 1990) and in (Shachter & Peot 1990). Our implementation is based on (Fung & Chang 1990).
The likelihood sampling algorithm makes an attempt to improve the efficiency of the Probabilistic Logic Sampling algorithm by instantiating only non-evidence nodes. Each sample is weighted by the likelihood of evidence given the partial sample generated. It is a simple algorithm with little overhead that generally performs well and certainly better than Probabilistic Logic Sampling in cases with observed evidence.