This information is not considered until a real connection between such two actions is built up. This information is then used to modify the importance of this connection, i.e. its level of confidence from a system's point of view. Since the computation of all the relevant pseudo paths in an action graph might become time-consuming, it is done at the end of a session. Here, the system's confidence into actions or sequences of actions is the central value for further computations. These values are computed as described int the following Section.
E is a set of edges e , and is a mapping.
Furthermore, we introduce as the total number of all actions, i.e. , and we define additional indices . The statistical and probabilistic graph-evaluation methods embedded in our system basically refer to the values described in the following equations. It becomes 0 if there is no connection from any of the successors of to and it is not computed unless . Since the computation of these values might become time-consuming it is done at the end of a session. Once, these values are computed, they can be successively updated at run-time.