Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Nguyen, H.T.: Using Random Sets. Information Science 34, 265–274 (1984)
Gebhardt, J., Kruse, R.: The Context Model Ů An Integrating View of Vagueness and Uncertainty. Int. Journal of Approximate Reasoning 9, 283–314 (1993)
Borgelt, C., Kruse, R.: Graphical Models - Methods for Data Analysis and Mining. John Wiley & Sons, Chichester (2002)
Cooper, G.F., Herskovits, E.: A Bayesian Method for the Induction of Probabilistic Networks from Data (1992)
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 1995
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)
Gebhardt, J., Kruse, R.: Learning Possibilistic Networks from Data (1995)
Pearl, J., Russel, S.: Bayesian Networks (1994)
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 96
Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules Between Sets of Items in Large Databases (1993)
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)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Steinbrecher, M., Kruse, R. (2007). Visualization of Possibilistic Potentials. In: Melin, P., Castillo, O., Aguilar, L.T., Kacprzyk, J., Pedrycz, W. (eds) Foundations of Fuzzy Logic and Soft Computing. IFSA 2007. Lecture Notes in Computer Science(), vol 4529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72950-1_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-72950-1_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72917-4
Online ISBN: 978-3-540-72950-1
eBook Packages: Computer ScienceComputer Science (R0)