Learning possibilistic networks from data

We introduce the concept of possibilistic learning as a method for structure identification from a database of samples. In comparison to the construction of Bayesian belief networks, the proposed framework has some advantages, namely the explicit consideration of imprecise data, and the realization of a controlled form of information compression in order to increase the efficiency of the learning strategy as well as approximate reasoning using local propagation techniques. Our learning method has been applied to reconstruct a non-singly connected network of 22 nodes and 22 arcs without the need of any a priori supplied node ordering