Abstract
In real world applications planners are frequently faced with complex variable dependencies in high dimensional domains. In addition to that, they typically have to start from a very incomplete picture that is expanded only gradually as new information becomes available. In this contribution we deal with probabilistic graphical models, which have successfully been used for handling complex dependency structures and reasoning tasks in the presence of uncertainty. The paper discusses revision and updating operations in order to extend existing approaches in this field, where in most cases a restriction to conditioning and simple propagation algorithms can be observed. Furthermore, it is shown how all these operations can be applied to item planning and the prediction of parts demand in the automotive industry. The new theoretical results, modelling aspects, and their implementation within a software library were delivered by ISC Gebhardt and then involved in an innovative software system realized by Corporate IT for the world-wide item planning and parts demand prediction of the whole Volkswagen Group.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Borgelt, C., Kruse, R.: Graphical Models—Methods for Data Analysis and Mining. J. Wiley & Sons, Chichester (2002)
Castillo, E., Guitérrez, J.M., Hadi, A.S.: Expert Systems and Probabilistic Network Models. Springer, New York (1997)
Chickering, D.M., Geiger, D., Heckerman, D.: Learning Bayesian networks from data. Machine Learning 20(3), 197–243 (1995)
Cooper, G.F., Herskovits, E.: A Bayesian method for the induction of probabilistic networks from data. Machine Learning 9, 309–347 (1992)
Friedman, N.: The Bayesian structural EM algorithm. In: Proc. of the 14th Conference on Uncertainty in AI, pp. 129–138 (1998)
P. Gärdenfors. Knowledge in the Flux—Modeling the Dynamics of Epistemic States. MIT press, Cambridge, MA, 1988.
Gebhardt, J.: The revision operator and the treatment of inconsistent stipulations of item rates. Project EPL: Internal Report 9. ISC Gebhardt and Volkswagen Group, GOB-11 (2001)
Gebhardt, J.: Learning from data: Possibilistic graphical models. In: Gabbay, D.M., Smets, P. (eds.) Handbook of Defeasible Reasoning and Uncertainty Management Systems. Abductive Reasoning and Learning, vol. 4, pp. 314–389. Kluwer Academic Publishers, Dordrecht (2000)
Gebhardt, J., Kruse, R.: Parallel combination of information sources. In: Gabbay, D.M., Smets, P. (eds.) Handbook of Defeasible Reasoning and Uncertainty Management Systems, Belief Change, vol. 3, pp. 393–439. Kluwer Academic Publishers, Dordrecht (1998)
Gebhardt, J., Detmer, H., Madsen, A.L.: Predicting parts demand in the automotive industry – an application of probabilistic graphical models. In: Proc. Int. Joint Conf. on Uncertainty in Artificial Intelligence (UAI 2003), Bayesian Modelling Applications Workshop, Acapulco, Mexico (2003)
Gebhardt, J., Borgelt, C., Kruse, R.: Knowledge revision in markov networks. Mathware and Soft Computing 11(2-3), 93–107 (2004)
Geiger, D., Verma, T.S., Pearl, J.: Identifying independence in Bayesian networks. Networks 20, 507–534 (1990)
Hammersley, J.M., Clifford, P.E.: Markov fields on finite graphs and lattices. Cited in Isham (1981) (1971)
Isham, V.: An introduction to spatial point processes and markov random fields. Int. Statistical Review 49, 21–43 (1981)
Khalfallah, F., Mellouli, K.: Optimized algorithm for learning Bayesian networks from data. In: Proc. 5th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQUARU 1999), pp. 221–232 (1999)
Lauritzen, S.L., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society, Series B 2(50), 157–224 (1988)
Lauritzen, S.L.: Graphical Models. Oxford University Press, Oxford (1996)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, 2nd edn. Morgan Kaufman, San Mateo (1988)
Singh, M., Valtorta, M.: Construction of Bayesian network structures from data: Brief survey and efficient algorithm. Int. Journal of Approximate Reasoning 12, 111–131 (1995)
Sprites, P., Glymour, C.: An algorithm for fast recovery of sparse causal graphs. Social Science Computing Review 9(1), 62–72 (1991)
Steck, H.: On the use of skeletons when learning Bayesian networks. In: Proc. of the 16th Conference on Uncertainty in AI, pp. 558–565 (2000)
Verma, T., Pearl, J.: An algorithm for deciding whether a set of observed independencies has a causal explanation. In: Proc. 8th Conference on Uncertainty in AI, pp. 323–330 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gebhardt, J., Kruse, R. (2005). Knowledge-Based Operations for Graphical Models in Planning. In: Godo, L. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2005. Lecture Notes in Computer Science(), vol 3571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11518655_2
Download citation
DOI: https://doi.org/10.1007/11518655_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27326-4
Online ISBN: 978-3-540-31888-0
eBook Packages: Computer ScienceComputer Science (R0)