Knowledge Computing and Its Applications: Knowledge Computing in Specific Domains: Volume II

TLDR: The PGM, discussed in this chapter, offers a variety of approaches and is based on models and allows interpretable models to be built which then is employed by reasoning algorithms which makes the decision making under the uncertainty of the data.

Abstract: Probabilistic graphical models (PGM) are one of the rich frameworks. These models are used over complex domains for coding probability distributions. The joint distributions interact with each other over large numbers of random variables and are the combination of statistics and computer science. These concepts are dependent on theories such as probability theory, graph algorithms, machine learning, which make a basic tool in devising many machine learning problems. These are the origin for the contemporary methods in an extensive range of applications. These applications range as medical diagnosis, image understanding, speech recognition, natural language processing, etc. Graphical models are one of dominant tools for handling image processing applications. On the other hand, the volume of image data gives rise to a problem. The representation of all possible graphical model node variables with that of discrete states heads to the number of states for the model. This leads to interpretation computationally obstinate. Many projects involve a human intervention or an automated system to obtain the consensus established on existing information. The PGM, discussed in this chapter, offers a variety of approaches. The approach is based on models and allows interpretable models to be built which then is employed by reasoning algorithms. These models are also studied significantly from data and allow the approaches for cases where the model is manually built. Most real-world applications are of uncertain data which makes a model building more challenging. This chapter emphasizes on PGM where the uncertainty of data is obvious. PGM provides models that are more realistic. These are extended from Bayesian networks, undirected Markov networks, discrete and continuous models, and extensions to deal with dynamical systems and relational data also. For each class of models, the S. Tumula (&) Department of Computer Science and Engineering, Chaitanya Bharathi Institute of Technology (A), CBIT post, Gandipet, Hyderabad, Telangana, India e-mail: sritumula@gmail.com S. S. Fathima Department of Computer Science and Engineering, Osmania University, Hyderabad, Telangana, India © Springer Nature Singapore Pte Ltd. 2018 S. Margret Anouncia and U. K. Wiil (eds.), Knowledge Computing and its Applications, https://doi.org/10.1007/978-981-10-8258-0_1 3 chapter describes the fundamental bases: representation, inference, and learning. Finally, the chapter considers the decision making under the uncertainty of the data.