2. The method according to claim 1 , said directed probabilistic graph comprising edges connecting said personality node, said mood nodes, said emotion nodes, and said evidence nodes, and said edges comprising probability values.
2. The method according to claim 1 , said directed probabilistic graph comprising edges connecting said personality node, said mood nodes, said emotion nodes, and said evidence nodes, and said edges comprising probability values. 3. The method according to claim 2 , a path through said directed probabilistic graph comprising a series of adjacent nodes, a probability of said path comprising an aggregation of said probabilities of said edges of said series of adjacent nodes, and said highest probability path having an aggregation of said probabilities of said edges that is higher than all other possible paths through said directed probabilistic graph.