Evaluating Product-Based Possibilistic Networks Learning Algorithms

  • Maroua HaddadEmail author
  • Philippe Leray
  • Nahla Ben Amor
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9161)


This paper proposes a new evaluation strategy for product-based possibilistic networks learning algorithms. The proposed strategy is mainly based on sampling a possibilistic networks in order to construct an imprecise data set representative of their underlying joint distribution. Experimental results showing the efficiency of the proposed method in comparing existing possibilistic networks learning algorithms is also presented.


Bayesian Network Possibility Distribution Possibility Theory Graphical Component Probabilistic Graphical Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Dubois, D.: Possibility theory and statistical reasoning. Comput. Stat. Data Anal. 51(1), 47–69 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Benferhat, S., Smaoui, S.: Hybrid possibilistic networks. Int. J. Approximate Reasoning 44(3), 224–243 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Ayachi, R., Ben Amor, N., Benferhat, S.: A generic framework for a compilation-based inference in probabilistic and possibilistic networks. Inf. Sci. 257, 342–356 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Borgelt, C., Steinbrecher, M., Kruse, R.: Graphical models: Representations for Learning, vol. 704. Reasoning and Data Mining. Wiley, Chichester (2009)CrossRefzbMATHGoogle Scholar
  5. 5.
    Gebhardt, J., Kruse, R.: Learning possibilistic networks from data. In: International Workshop on Artificial Intelligence and Statistics, pp. 233–244 (1996)Google Scholar
  6. 6.
    Sangüesa, R., Cabós, J., Cortes, U.: Possibilistic conditional independence: a similarity-based measure and its application to causal network learning. Int. J. Approximate Reasoning 18(1), 145–167 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Dubois, D., Prade, H.: Possibility theory: qualitative and quantitative aspects. In: Smets, P. (ed.) Quantified Representation of Uncertainty and Imprecision, vol. 1, pp. 169–226. Springer, Netherlands (1998)CrossRefGoogle Scholar
  8. 8.
    Joslyn, C.: Towards an empirical semantics of possibility through maximum uncertainty. In: International Fuzzy Systems Association: Artificial Intelligence, pp. 86–89 (1991)Google Scholar
  9. 9.
    Fonck, P.: Propagating uncertainty in a directed acyclic graph. In: Information Processing and Management of Uncertainty Conference, vol. 92, pp. 17–20 (1992)Google Scholar
  10. 10.
    Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo (1988)zbMATHGoogle Scholar
  11. 11.
    Herskovits, E., Cooper, G.F.: An entropy-driven system for construction of probabilistic expert systems from databases. In: UAI 1990, pp. 117–128. Elsevier (1991)Google Scholar
  12. 12.
    Klir, G.J.: Uncertainty and Information: Foundations of Generalized Information Theory. Wiley, Hoboken (2005)CrossRefzbMATHGoogle Scholar
  13. 13.
    Dubois, D., Prade, H., Sandri, S.: On possibility/probability transformations. In: Lowen, R., Roubens, M. (eds.) Fuzzy logic, vol. 12, pp. 103–112. Springer, Netherlands (1993)CrossRefGoogle Scholar
  14. 14.
    Henrion, M.: Propagating uncertainty in Bayesian networks by probabilistic logic sampling. In: Uncertainty in Artificial Intelligence, pp. 149–164 (1986)Google Scholar
  15. 15.
    Xiang, Y., Miller, T.: A well-behaved algorithm for simulating dependence structures of Bayesian networks. IJAM 1, 923–932 (1999)MathSciNetzbMATHGoogle Scholar
  16. 16.
    Chanas, S., Nowakowski, M.: Single value simulation of fuzzy variable. Fuzzy Sets Syst. 25(1), 43–57 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Guyonnet, D., Bourgine, B., Dubois, D., Fargier, H., Côme, B., Chilès, J.P.: Hybrid approach for addressing uncertainty in risk assessments. J. Environ. Eng. 129(1), 68–78 (2003)CrossRefGoogle Scholar
  18. 18.
    Tsamardinos, I., Brown, L.E., Aliferis, C.F.: The max-min hill-climbing Bayesian network structure learning algorithm. Mach. learn. 65(1), 31–78 (2006)CrossRefGoogle Scholar
  19. 19.
    Shapiro, L.G., Haralick, R.M.: A metric for comparing relational descriptions. Pattern Anal. Mach. Intell. 7(1), 90–94 (1985)CrossRefGoogle Scholar
  20. 20.
    Jenhani, I., Ben Amor, N., Elouedi, Z.: Decision trees as possibilistic classifiers. Int. J. Approximate Reasoning 48(3), 784–807 (2008)CrossRefzbMATHGoogle Scholar
  21. 21.
    Lauritzen, S.L., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. J. Roy. Stat. Soc. 50, 157–224 (1988)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Maroua Haddad
    • 1
    • 2
    Email author
  • Philippe Leray
    • 2
  • Nahla Ben Amor
    • 1
  1. 1.LARODEC Laboratory ISGUniversité de TunisTunisTunisia
  2. 2.LINA-UMR CNRS 6241University of NantesNantesFrance

Personalised recommendations