| 摘要 |
According to an aspect, a cyclical directed graphical model that includes a plurality of nodes connected by directed edges is accessed. Each directed edge has an edge strength indicating a degree of relation between the nodes, and each node has a value and a state of either active or inactive. A first node that has at least one directed incoming edge from a second node having a state of active is selected. At least a subset of the nodes in the cyclical directed graphical model are traversed in a reverse direction relative to the directed edges. The traversing is performed along a path starting from the second node and ending at a third node having a state of active. If the path does not include the first node, an inference about a value of the first node is proposed based on a value of the second node. |
