Visualization of Possibilistic Potentials

  • Matthias Steinbrecher
  • Rudolf Kruse
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4529)


The constantly increasing capabilities of database storage systems leads to an incremental collection of data by business organizations. The research area of Data Mining has become a paramount requirement in order to cope with the acquired information by locating and extracting patterns from these data volumes. Possibilistic networks comprise one prominent Data Mining technique that is capable of encoding dependence and independence relations between variables as well as dealing with imprecision. It will be argued that the learning of the network structure only provides an overview of the qualitative component, yet the more interesting information is contained inside the network parameters, namely the potential tables. In this paper we introduce a new visualization technique that allows for a detailed inspection of the quantitative component of possibilistic networks.


Bayesian Network Association Rule Directed Acyclic Graph Visualization Technique Class Attribute 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Nguyen, H.T.: Using Random Sets. Information Science 34, 265–274 (1984)zbMATHCrossRefGoogle Scholar
  2. 2.
    Gebhardt, J., Kruse, R.: The Context Model Ů An Integrating View of Vagueness and Uncertainty. Int. Journal of Approximate Reasoning 9, 283–314 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Borgelt, C., Kruse, R.: Graphical Models - Methods for Data Analysis and Mining. John Wiley & Sons, Chichester (2002)zbMATHGoogle Scholar
  4. 4.
    Cooper, G.F., Herskovits, E.: A Bayesian Method for the Induction of Probabilistic Networks from Data (1992)Google Scholar
  5. 5.
    Heckerman, D., Geiger, D., Chickering, D.M.: Learning Bayesian Networks: The Combination of Knowledge and Statistical Data. Technical Report MSR-TR-94-09, Microsoft Research, Advanced Technology Division, Redmond,WA (1994), Revised February 1995Google Scholar
  6. 6.
    Borgelt, C., Kruse, R.: Some experimental results on learning probabilistic and possibilistic networks with different evaluation measures. In: Nonnengart, A., Kruse, R., Ohlbach, H.J., Gabbay, D.M. (eds.) FAPR 1997 and ECSQARU 1997. LNCS, vol. 1244, pp. 71–85. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  7. 7.
    Gebhardt, J., Kruse, R.: Learning Possibilistic Networks from Data (1995)Google Scholar
  8. 8.
    Pearl, J., Russel, S.: Bayesian Networks (1994)Google Scholar
  9. 9.
    Heckerman, D.: A Tutorial on Learning with Bayesian Networks. Technical Report MSR-TR-95-06, Microsoft Research, Advanced Technology Division, Redmond, WA (1995), Revised June 96Google Scholar
  10. 10.
    Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules Between Sets of Items in Large Databases (1993)Google Scholar
  11. 11.
    Yao, Y.Y., Zhong, N.: An Analysis of Quantitative Measures Associated with Rules. In: Zhong, N., Zhou, L. (eds.) PAKDD 1999. LNCS (LNAI), vol. 1574, pp. 479–488. Springer, Heidelberg (1999)Google Scholar
  12. 12.
    Gebhardt, J., Kruse, R.: A Possibilistic Interpretation of Fuzzy Sets by the Context Model. In: IEEE International Conference on Fuzzy Systems, San Diego, pp. 1089–1096 (1992)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Matthias Steinbrecher
    • 1
  • Rudolf Kruse
    • 1
  1. 1.Department of Knowledge Processing and Language Engineering, Otto-von-Guericke University of Magdeburg, Universitätsplatz 2, 39106 MagdeburgGermany

Personalised recommendations