next up previous contents
Next: BBN

LS




Description

LS is short for Lauritzen / Spiegelhalter.  The main focus of the LS package is the LS algorithm, which is found in ls.java.  The LS algorithm is an inference algorithm that determines the probabilities of node states with or without evidence (instantiated) nodes. (Please see our references.) LS can either be run graphically or from the command line, as appears below.

Examples

The format of evidence files for the time being is very crude.  We hope to convert it to an XML format for the next release.  The format is as follows:

Line 1: Evidence bit vector.  Determines which nodes will be used as evidence nodes.  In this example, visit to Asia? and dyspnoea? are being set to evidence nodes.

Line 2: Node order.  Used to determine what the following node state names correspond to.

Line 3 through Line n: Node states.  Each line consists of a set instantiation.  The non-evidence node values are only important if you want to judge the likelihood of the entire set, which you can use bbn.NodeManager.getStateSetProbability() to find out. 


KDD-Tools
Thurs June 27 2002