Aggregating quantitative possibilistic networks

摘要

The problem of merging multiple-source uncertain information is a crucial issue in many applications. This paper proposes an analysis of possibilistic merging operators where uncertain information is encoded by means of product-based (or quantitative) possibilistic networks. We first show that the product-based merging of possibilistic networks having the same DAG structures can be easily achieved in a polynomial time. We then propose solutions to merge possibilistic networks having different structures with the help of additionnal variables.