Abstract: Causal concepts play a crucial role in many reasoning tasks. Organised as a model revealing the causal structure of a domain, they can guide inference through relevant knowledge. This is an especially difficult kind of knowledge to acquire, so some methods for automating the induction of causal models from data have been put forth. Here we review those that have a graph representation. Most work has been done on the problem of recovering belief nets from data but some extensions are appearing that claim to exhibit a true causal semantics. We will review the analogies between belief networks and “true”…causal networks and to what extent methods for learning belief networks can be used in learning causal representations. Some new results in recovering possibilistic causal networks will also be presented.
Show more
Abstract: We use several models of scale-free graphs as underlying interaction graphs for a simple model of Multi-Agent Systems (MAS), and study how fast the system reaches a fixed-point, that is, the time it takes for the system to get a 90% of the agents in the same state. The interest of these kind of graphs is in the fact that the Internet, a very plausible environment for MAS, is a scale-free graph with high clustering and <k_{nn}> , the nearest neighbor average connectivity of nodes with connectivity k , following a power-law. Our results show that different types of scale-free…graphs make the system as efficient as fully connected graphs, in a clear agreement with our previous research (Artif. Intell. 141, pp. 175–181).
Show more