# Dynamic Knowledge Inference Based on Bayesian Network Learning

Authors: Deyan Wang; Adam AmrilJaharadak; Ying Xiao
Journal: Mathematical Problems in Engineering
 (2020)

---

## Abstract

On the basis of studying datasets of students' course scores, we constructed a Bayesian network and undertook probabilistic inference analysis. We selected six requisite courses in computer science as Bayesian network nodes. We determined the order of the nodes based on expert knowledge. Using 356 datasets, the K2 algorithm learned the Bayesian network structure. Then, we used maximum a posteriori probability estimation to learn the parameters. After constructing the Bayesian network, we used the message-passing algorithm to predict and infer the results. Finally, the results of dynamic knowledge inference were presented through a detailed inference process. In the absence of any evidence node information, the probability of passing other courses was calculated. A mathematics course (a basic professional course) was chosen as the evidence node to dynamically infer the probability of passing other courses. Over time, the probability of passing other courses greatly improved, and the inference results were consistent with the actual values and can thus be visualized and applied to an actual school management system.


---

## Body

## 1. Introduction

In artificial intelligence research, one of the core issues lies in expressing the existing knowledge and applying the existing knowledge for analysis, processing, or inference in order to obtain new knowledge [1–3]. Among them, the expression and inference of uncertain knowledge is the most important and difficult [4, 5]. Uncertain knowledge representation can be divided into two categories. The first is a probability-based method, including a Bayesian network, dynamic causal network, and Markov network. The second one is a nonprobabilistic method, including fuzzy logic, evidence theory, and rough set theory, among others [6–10]. The Bayesian network was first proposed by Professor Judea Pearl of the University of California in the 1980s [6]. He extended the Bayesian network to expert systems and made it a common method for uncertain knowledge and data inference [7].The paper selected 6 requisite courses in computer science as Bayesian network nodes to carry out Bayesian network structure learning and parameter learning. Then, taking mathematics course as the evidence node, we carried out dynamic prediction of other course grades. The experimental results show that when mathematics course examination is passed, the probability of passing other courses will increase, which is consistent with the actual values.


## 2. Bayesian Network Definition

A Bayesian network is a directed graphical description based on a network structure. It is a combination of artificial intelligence, probability theory, graph theory, and decision theory. It uses a directed acyclic graph (DAG) with a network structure to express the dependence and influence degree of each information element. Among them, nodes are used to express each feature attribute, and the directed edges between connected nodes are used to express the dependence of each feature attribute. The conditional probability table (CPT) expresses the degree of influence between each feature attribute and combines the prior knowledge with the sample information and the dependency relationship with the probability representation [6].An extremely important property of Bayesian networks is that each node is independent of all its indirect predecessor nodes after the value of its immediate precursor node is determined.The significance of this feature is to clarify that the Bayesian network can easily calculate the joint probability distribution. In general, we solve the multivariate nonindependent joint conditional probability distribution using the following equation:(1)Px1,x2,...,xn=Px1Px2|x1Px3|x1,x2…Pxn|x1,x2,...,xn−1.In the Bayesian network, due to the aforementioned properties, the joint conditional probability distribution of any random variable combination can be defined as follows:(2)Px1,x2,...,xn=∏i=1nPxi|Parentsxi.Parents represent the joint probability of the direct precursor node ofXi, and other probabilities can be found from the CPT.In Bayesian networks, there can be more than one directed path between nodes, and an ancestor node can influence its offspring nodes through different ways. When the appearance of an ancestor node leads to the generation of the result of a descendant node, it is a probability expression, not inevitable, so we need to add a conditional probability for each node. The probability of a node taking different attribute values under the condition of different value combinations of its parent node (direct cause node) constitutes the conditional probability table of the node. The initial root node occurs without any conditions, which is called unconditional probability.


## 3. Bayesian Network Learning

The core problem in Bayesian networks lies in Bayesian network learning. Bayesian network learning is the process of using a learning algorithm to obtain a Bayesian network that can truly express the relationship between the variables in the sample dataset. The Bayesian network comprises a network structure containing nodes and directed edges and the CPT representing the degree of dependence between nodes. Thus, Bayesian network learning is divided into two parts: structural learning and parametric learning. Structural learning is more difficult than parametric learning. Structural learning of Bayesian networks refers to the use of training datasets, combined with as much prior knowledge as possible to determine the appropriate Bayesian network topology.


### 3.1. Bayesian Network Structural Learning

Bayesian network structure learning mainly comprises two categories—the first is based on scoring and search methods and the second is based on conditional independence testing.The scoring and search-based method has two elements: a scoring function and search algorithm. Cooper and Herskovits created the K2 algorithm [11] that uses the Bayesian score and hill-climbing search to obtain the optimal network structure under the given node order. In 1994, Remco proposed replacing the Bayesian scoring function in the K2 algorithm with the scoring function of minimum description length (MDL) in information theory and established the K3 algorithm [12]. In the same year, Lam and Bacchus proposed that the MDL be used as the criterion to learn the network structure through complete search and get rid of the constraint of prior information of node order [13]. Shan et al. [14] proposed the hill-climbing algorithm, which makes full use of the information of rings to optimize the network structure and demonstrates good learning effect. In recent years, there have been many studies on learning Bayesian networks. It presents an improved hybrid learning strategy that features parameterized genetic algorithms (GAs) to learn the structure of BNs underlying a set of data samples [15]. Wang and Jiang [16] studied the hybrid learning method of a Bayesian network structure based on the bee colony algorithm (CA) and genetic algorithm (GA) and selected the Asia network and car trouble-shooter network, and the efficiency of the algorithm was significantly improved in the process of increasing the number of samples. Cao et al. [17] studied the Bayesian network structure learning algorithm based on cloud genetic annealing. A fast learning method of Bayesian network structure based on attribute order was proposed to realize the rapid construction of Bayesian network structure [18].The K2 algorithm effectively integrates prior information in the search process and demonstrates good time performance. It is a classic structure learning algorithm based on scoring search.


#### 3.1.1. Scoring Function

The algorithm first needs to determine the order of the node variables in the network and propose a modular idea wherein the parent node set of each node is independent of each other. The K2 search algorithm designed according to this idea uses the hill-climbing heuristic algorithm to search the network structure under the assumption that the nodes are ordered and the prior probability of all network structures is equal. The parent node set is searched for each node in the given order, and the score of the local structure is increased by continuously adding a parent node to each node. The search stops until the node with the highest score is found for each node, and it is always required to maximize the score of the structure but the node is in order.


#### 3.1.2. Search Strategy

The K2 algorithm uses greedy search to obtain the maximum value. We first assume that the random variables are ordered. Ifxi precedes xj, then there can be no edges from xj to xi. Simultaneously, we assumed that the maximum number of parent variables per variable is u. Each time the largest parent variable of the scoring function is selected and put into the set, the loop stops when the scoring function cannot be increased.


### 3.2. Bayesian Network Parameter Learning

The parametric learning of Bayesian networks refers to the determination of conditional probability density of each node for a given Bayesian network structure. This learning can be determined by expert knowledge or training sample data, and the incompleteness and inaccuracy of expert knowledge will affect the accuracy of the network parameters. Based on the previous structure learning, this section focuses on the analysis of the Bayesian network parameter learning method for complete sample data.For complete training sample data, maximum a posteriori (MAP) and maximum likelihood estimation (MLE) are often used to learn Bayesian network parameters.


#### 3.2.1. Maximum Likelihood Estimation (MLE)

Maximum likelihood estimation (MLE) estimates the parameters of the model according to the data. The goal of MLE is to find a set of parameters to maximize the probability of the model producing the observed data. Simply put, MLE is to estimate the parameters (the environment in which the data are generated) based on the observed data.Hypothesis dataXx1,x2,...,xn are a set of samples of independent and identity distribution. Then, MLE chooses θ that maximizes the probability of observed data as follows:(3)θ^MLE=argmaxPX;θ=argmaxPx1;θPx2;θ…Pxn;θ=argmaxlog∏i=1nPxi;θ=argmax∑i=1nlogPxi;θ=argmin−∑i=1nlogPxi;θ.


#### 3.2.2. Maximum A Posteriori (MAP)

The maximum likelihood estimation is to obtain the parameterθ, which maximizes the likelihood function PX|θ. The maximum posterior probability estimation is to find θ to maximize PX|θPθ. The obtained θ is not only the maximum likelihood function but also the prior probability of θ itself. Then, MAP chooses θ that maximizes the probability of observed data as follows:(4)θ^MAP=argmin−∑i=1nlogPxi;θ−logPθ.


## 3.1. Bayesian Network Structural Learning

Bayesian network structure learning mainly comprises two categories—the first is based on scoring and search methods and the second is based on conditional independence testing.The scoring and search-based method has two elements: a scoring function and search algorithm. Cooper and Herskovits created the K2 algorithm [11] that uses the Bayesian score and hill-climbing search to obtain the optimal network structure under the given node order. In 1994, Remco proposed replacing the Bayesian scoring function in the K2 algorithm with the scoring function of minimum description length (MDL) in information theory and established the K3 algorithm [12]. In the same year, Lam and Bacchus proposed that the MDL be used as the criterion to learn the network structure through complete search and get rid of the constraint of prior information of node order [13]. Shan et al. [14] proposed the hill-climbing algorithm, which makes full use of the information of rings to optimize the network structure and demonstrates good learning effect. In recent years, there have been many studies on learning Bayesian networks. It presents an improved hybrid learning strategy that features parameterized genetic algorithms (GAs) to learn the structure of BNs underlying a set of data samples [15]. Wang and Jiang [16] studied the hybrid learning method of a Bayesian network structure based on the bee colony algorithm (CA) and genetic algorithm (GA) and selected the Asia network and car trouble-shooter network, and the efficiency of the algorithm was significantly improved in the process of increasing the number of samples. Cao et al. [17] studied the Bayesian network structure learning algorithm based on cloud genetic annealing. A fast learning method of Bayesian network structure based on attribute order was proposed to realize the rapid construction of Bayesian network structure [18].The K2 algorithm effectively integrates prior information in the search process and demonstrates good time performance. It is a classic structure learning algorithm based on scoring search.


### 3.1.1. Scoring Function

The algorithm first needs to determine the order of the node variables in the network and propose a modular idea wherein the parent node set of each node is independent of each other. The K2 search algorithm designed according to this idea uses the hill-climbing heuristic algorithm to search the network structure under the assumption that the nodes are ordered and the prior probability of all network structures is equal. The parent node set is searched for each node in the given order, and the score of the local structure is increased by continuously adding a parent node to each node. The search stops until the node with the highest score is found for each node, and it is always required to maximize the score of the structure but the node is in order.


### 3.1.2. Search Strategy

The K2 algorithm uses greedy search to obtain the maximum value. We first assume that the random variables are ordered. Ifxi precedes xj, then there can be no edges from xj to xi. Simultaneously, we assumed that the maximum number of parent variables per variable is u. Each time the largest parent variable of the scoring function is selected and put into the set, the loop stops when the scoring function cannot be increased.


## 3.1.1. Scoring Function

The algorithm first needs to determine the order of the node variables in the network and propose a modular idea wherein the parent node set of each node is independent of each other. The K2 search algorithm designed according to this idea uses the hill-climbing heuristic algorithm to search the network structure under the assumption that the nodes are ordered and the prior probability of all network structures is equal. The parent node set is searched for each node in the given order, and the score of the local structure is increased by continuously adding a parent node to each node. The search stops until the node with the highest score is found for each node, and it is always required to maximize the score of the structure but the node is in order.


## 3.1.2. Search Strategy

The K2 algorithm uses greedy search to obtain the maximum value. We first assume that the random variables are ordered. Ifxi precedes xj, then there can be no edges from xj to xi. Simultaneously, we assumed that the maximum number of parent variables per variable is u. Each time the largest parent variable of the scoring function is selected and put into the set, the loop stops when the scoring function cannot be increased.


## 3.2. Bayesian Network Parameter Learning

The parametric learning of Bayesian networks refers to the determination of conditional probability density of each node for a given Bayesian network structure. This learning can be determined by expert knowledge or training sample data, and the incompleteness and inaccuracy of expert knowledge will affect the accuracy of the network parameters. Based on the previous structure learning, this section focuses on the analysis of the Bayesian network parameter learning method for complete sample data.For complete training sample data, maximum a posteriori (MAP) and maximum likelihood estimation (MLE) are often used to learn Bayesian network parameters.


### 3.2.1. Maximum Likelihood Estimation (MLE)

Maximum likelihood estimation (MLE) estimates the parameters of the model according to the data. The goal of MLE is to find a set of parameters to maximize the probability of the model producing the observed data. Simply put, MLE is to estimate the parameters (the environment in which the data are generated) based on the observed data.Hypothesis dataXx1,x2,...,xn are a set of samples of independent and identity distribution. Then, MLE chooses θ that maximizes the probability of observed data as follows:(3)θ^MLE=argmaxPX;θ=argmaxPx1;θPx2;θ…Pxn;θ=argmaxlog∏i=1nPxi;θ=argmax∑i=1nlogPxi;θ=argmin−∑i=1nlogPxi;θ.


### 3.2.2. Maximum A Posteriori (MAP)

The maximum likelihood estimation is to obtain the parameterθ, which maximizes the likelihood function PX|θ. The maximum posterior probability estimation is to find θ to maximize PX|θPθ. The obtained θ is not only the maximum likelihood function but also the prior probability of θ itself. Then, MAP chooses θ that maximizes the probability of observed data as follows:(4)θ^MAP=argmin−∑i=1nlogPxi;θ−logPθ.


## 3.2.1. Maximum Likelihood Estimation (MLE)

Maximum likelihood estimation (MLE) estimates the parameters of the model according to the data. The goal of MLE is to find a set of parameters to maximize the probability of the model producing the observed data. Simply put, MLE is to estimate the parameters (the environment in which the data are generated) based on the observed data.Hypothesis dataXx1,x2,...,xn are a set of samples of independent and identity distribution. Then, MLE chooses θ that maximizes the probability of observed data as follows:(3)θ^MLE=argmaxPX;θ=argmaxPx1;θPx2;θ…Pxn;θ=argmaxlog∏i=1nPxi;θ=argmax∑i=1nlogPxi;θ=argmin−∑i=1nlogPxi;θ.


## 3.2.2. Maximum A Posteriori (MAP)

The maximum likelihood estimation is to obtain the parameterθ, which maximizes the likelihood function PX|θ. The maximum posterior probability estimation is to find θ to maximize PX|θPθ. The obtained θ is not only the maximum likelihood function but also the prior probability of θ itself. Then, MAP chooses θ that maximizes the probability of observed data as follows:(4)θ^MAP=argmin−∑i=1nlogPxi;θ−logPθ.


## 4. Dataset

In this study, the scores of 15 examination courses of 356 students who have graduated from network technology specialty are selected as the dataset. For the convenience of programming, the course adopts the form of abbreviation (see Table1 for details).Table 1
Sample data structure.
CourseAttributeClass hoursCreditsSemesterC++ Programming ICI4831C++ Programming IICII6442Design and Application of Web DatabaseDAWEB6445Fundamentals of Computer ApplicationFCA4831Network BasicsNB6441Network Security TechnologyNST4834Network Switching and RoutingNSR8052Application Mathematics IAMI6441Application Mathematics IIAMII6442Basic English IBE I6441Basic English IIBEII6442Integrated Communication TrainingICT2813Network Engineering Project TrainingNEPT2815Integrated Network TrainingINT5625Wireless Network Deployment WeekWNDW2813The 15 courses in the table are listed with class hours, credits, and semester, which is convenient for the analysis of inference results.


## 5. Bayesian Network Dynamic Inference

Bayesian network inference is generally divided into two categories of precise inference and approximate inference from the methodological perspective. From the mode perspective, there are three most common types: causal, diagnostic, and support inferences [19]. The Bayesian network inference is widely used. Li et al. [20] considered a cost-sensitive Bayesian network and weighted K-nearest neighbor model to predict the duration of accidents. To minimize the negative impacts brought by floods, researchers propose a hierarchical Bayesian network-based incremental model to predict floods for small rivers [21]. Further, using the biological information from the literature to develop a Bayesian network along with a messaging passing algorithm, progress can be made in the treatment of breast cancer [22].By applying K2 algorithm and MAP algorithm, the Bayesian network is constructed as shown in Figure1.Figure 1
The Bayesian network.The mean of the nodes is summarized in Table2:Table 2
Node name, meaning, and abbreviation.
Node nameNode meaningNode abbreviationC#C# programmingCJavaJava programmingJWebDesign and application of web databaseWDatabaseDatabase design and managementDAndroidAndroid app developmentAMathApplication mathematicsMThere are six nodes in the Bayesian network: C# (C), Java (J), Web (W), Database (D), Android (A), and Math (M). The directed side indicates the dependence between courses; the Bayesian network structure is constructed through the dataset of the students’ course scores. For example, the performance of Math course will affect the C# course, and the probability values are used to describe the degree of impact between the different courses. The detailed probability values of different courses are listed in Tables3–8.Table 3
Unconditional probability of M.
MP (M)Pass0.800Fail0.200Table 4
Unconditional probability of D.
DP (D)Pass0.750Fail0.250Table 5
Conditional probability of C at known node M.
MCPC|MPassPass0.850PassFailure0150FailPass0.550FailFailure0.450Table 6
Conditional probability of J at known node C.
CJPP|CPassPass0.900PassFailure0.100FailPass0.600FailFailure0.400Table 7
Conditional probability of A at known node D.
DAPA|DPassPass0.980PassFailure0.020FailPass0.010FailFailure0.990Table 8
Conditional probability of W at known nodes C and D.
CDWP (W|C, D)PassPassPass0.990PassPassFailure0.010PassFailurePass0.700PassFailureFailure0.300FailPassPass0.900FailPassFailure0.100FailFailurePass0.020FailFailureFailure0.980For CPT, it only has unconditional probability if the node is the root node. It has the conditional probability if the node is not the root node. M and D are the root nodes, so they have the unconditional probability. C, J, W, and A are not the root nodes, so they have the conditional probability.The CPT of the Bayesian network is as follows.For this Bayesian network, the following inference problems need to be solved:(1)
If the students have passed Math, how likely are they to pass C#?(2)
If they have passed Math, how likely are they to pass Web?(3)
If they have passed Android, how likely are they to pass Web?Note: logically speaking, the third problem should not exist because it is impossible to infer the scores of previous courses from the courses in the following semester. This is just to explain how the bottom-up diagnostic inference works.(4)
If they have passed Math, how likely are they to pass Database?(5)
If they have passed Math, how likely are they to pass Android?The inference algorithm based on message propagation is the exact inference algorithm proposed by Pearl in 1988 based on conditional independence [7]. According to the value of each node in the evidence node set E, the conditional probability distribution Pxi,j|e of any node X in the Bayesian network can be obtained when different xi,j values are considered. The belief propagation algorithm regards the summation operation of the variable elimination method as a message passing process, which solves the problem of repeated computation when solving multiple marginal distributions. In belief propagation algorithm, a node can send a message to another node only after receiving a message from all other nodes, and the marginal distribution of the node is proportional to the product of the message it receives [23]:(5)Pxi∝∏k∈nimkixi.Among them,mkixi is expressed as follows:(6)mijxj=∑xiψxi,xj∏k∈ni\jmkixi.If there are no rings in the graph structure, the belief propagation algorithm can complete all message transmission in two steps:(1)
Specify a root node that starts at all leaf nodes and delivers messages to the root node until the root node receives messages from all adjacent nodes.(2)
From the root node, the message is transmitted to the leaf node until all the leaf nodes receive the message.In the following section, the execution of the inference algorithm will be discussed.


### 5.1. Causal Inference

Causal inference is the deduction process from “cause” node to “result” node. The directed acyclic graph is represented as top-down inference of node probabilities. When the state of a node is known (evidence node), the probability distributions of its parent and child nodes are deduced. A causality analysis is conducted based on probability change, which is often used for prediction. The example of a causal inference with the Bayesian network is shown in Figure1.In order to infer, it is necessary to find out the total probability. The total probability is the sum of the probabilities of an event under different circumstances as(7)PA=∑i=1nPBiPA|X.For convenience, for a node, the p (+point) indicates that the student passed the course, P (-point) indicates that the student failed the course.In the absence of some node information, the total probability of the nodes can be calculated.(8)P+C=P+M∗P+C|+M+P−M∗P+C|−M=0.8∗0.850+0.2∗0.550=0.79.P−C=1−P+C=0.21.In the absence of some node information, the probability of the students passing and failing C# is 0.79 and 0.21, respectively.(9)P+W=P+C∗P+D∗P+W|+C,+D+P+C∗P−D∗P+W|+C,−D+P−C∗P+D∗P+W|−C,+D+P−C∗P−D∗P+W|−C,−D=0.79∗0.75∗0.99+0.79∗0.25∗0.7+0.21∗0.75∗0.9+0.21∗0.25∗0.02=0.867625.P−W=1−P+W=0.132375=0.867625.In the absence of some node information, the probability of the students passing and failing Web is 0.867625 and 0.132375, respectively.(10)P+J=P+C∗P+J|+C+P−C∗P+J|−C=0.79∗0.900+0.21∗0.600=0.837P−J=1−P+J=0.163.In the absence of some node information, the probability of the students passing and failing Java is 0.837 and 0.163, respectively.(11)P+A=P+D∗P+A|+D+P−D∗P+A|−D=0.75∗0.980+0.25∗0.010=0.7375P−A=1−P+A=0.2625.In the absence of some node information, the probability of the student passing and failing Android is 0.7375and 0.2625, respectively.For causal inference, in Bayesian network B, given the conditional probability of several nodes, the probability of occurrence of a node T is predicted:(1)
For each noden in B that has not been processed, if it has the fact of occurrence, it will be marked as processed; otherwise, continue to the next step.(2)
If one of its parent nodes has not been processed, the node is not processed; otherwise, continue to the next step.(3)
According to the probability and conditional probability of all the parent nodes of noden, the probability distribution of node n is calculated, and the node n is marked as processed.(4)
Repeat the above steps; the probability distribution of node T is the probability of its occurrence or not.Now, the following question can be answered.(i)
If the students passed Math, how likely are they to pass Java?First, from Table5, if the students have passed Math, the probability they have passed C# is 0.850. That is, after the Math exam, the students can predict their C# score—if they passed Math, the probability they passed C# is 0.850; if they failed Math, the probability they failed C# is 0.550. Everyone should do their best to ensure that the probability they passed Math is high; Math is an important basic course for students majoring in C#.(12)P+J=P+C∗P+J|+C+P−C∗P+J|−C=0.850∗0.900+0.150∗0.600=0.855If the students passed Math, the probability they passed Java is 0.855.Now, the following question can be answered.(ii)
If the students passed Math, how likely are they to pass Web?From Table5, if the students have passed Math, the probability they passed C# is 0.850. That is, after the Math exam, the student can predict their C# score—if they passed Math, the probability they passed C# is 0.850; if they failed Math, the probability they passed C# is 0.550. From Table 4, the probability the student passed Database is 0.75 and the probability they failed C# is 0.25. Thus,(13)P+W=P+C∗P+D∗P+W|+C,+D+P+C∗P−D∗P+W|+C,−D+P−C∗P+D∗P+W|−C,+D+P−C∗P−D∗P+W|−C,−D=0.85∗0.75∗0.99+0.85∗0.25∗0.7+0.25∗0.75∗0.9+0.25∗0.25∗0.02=0.949875.The probability they passed Web is 0.949875, if they passed Math.Through these methods, the probability for any case can be predicted.


### 5.2. Diagnostic Inference

The diagnostic and support inferences are the processes of inferring the cause from the result. The reverse inference process involves passing informing from the network child node to the parent node in the network. When an event has occurred, the conditional probability distribution of “result” is used to solve the probability distribution of “cause.” It can effectively deduce the cause and cause probability. More commonly used interferences are pathological inference in the medical field and fault detection of systems and electronic devices. Further, because different semesters have different courses, it can also be used as diagnostic inference to estimate the probability of the later semester courses. An example of the diagnostic inference with the Bayesian network is shown in Figure1.For diagnostic inference, in Bayesian network B, given the conditional probability of several nodes, the probability of occurrence of a node T is predicted:(1)
For each noden in B that has not been processed, if it has the fact of occurrence, it will be marked as processed; otherwise, continue to the next step.(2)
If one of its child nodes has not been processed, the node is not processed; otherwise, continue to the next step.(3)
According to the probability and conditional probability of all the child nodes of noden, the probability distribution of node n is calculated, and the node n is marked as processed.(4)
Repeat the above steps; the probability distribution of node T is the probability of its occurrence or not.Now, the following question can be answered.(i)
If the students passed Android, how likely are they to pass Web?First, the total probability of passing Android should be calculated.(14)P+A=P+D∗P+A|+D+P−D∗P+A|−D=0.75∗0.980+0.25∗0.010=0.7375.Second,P+D|+Ashould be solved. From Table 7, we can obtain P+A|+D; the famous Bayesian theorem given below can then be used [24]:(15)PA|B=pAPB|ApBP+D|+A=P+A|+D∗P+DP+A=0.98∗0.750.7375=0.99661.P−D|+A=0.00339.Finally, the total probability of passing Web is solved.(16)P+W=P+C∗P+D∗P+W|+C,+D+P+C∗P−D∗P+W|+C,−D+P−C∗P+D∗P+W|−C,+D+P−C∗P−D∗P+W|−C,−D=0.79∗0.99661∗0.99+0.79∗0.00339∗0.7+0.21∗0.99661∗0.9+0.21∗0.00339∗0.02=0.9696879.Now, the following question can be answered.(ii)
If the students passed Math, how likely are they to pass Database?First, using the probability of the students passing Web (0.949875), we can calculate the probability of them passing Math.(17)P+W=0.949875,P−W=0.050125.Second, from Table5, if the students have passed Math, the probability they passed C# is 0.850. That is, after the Math exam, the student can predict their C# score—if they passed Math, the probability they passed C# is 0.850; if they failed Math, the probability they passed C# is 0.550. Using the probability that they passed C#, we can calculate the edge condition probability of them passing Web, Database, and Math.(18)P+W|+D=P+C∗P+W|+D,+C+P−C∗P+W|+D,−C=0.85∗0.99+0.15∗0.9=0.9765.If they passed Math and Database, the probability they passed Web is 0.9765 and the probability they failed Web is 0.0235. Then, the condition probability ofP+D|+W, using equation (13), can be solved as follows:(19)P+D|+W=P+W|+D∗P+DP+W=0.9765∗0.750.949875=0.771023.If they passed Math, the probability they passed Database is 0.771023.(iii)
If the students passed Math, how likely are they to pass Android?Solving this, if they passed Math, the probability they passed Database is 0.771023.(20)P+A=P+D∗P+A|+D+P−D∗P+A|−D=0.771023∗0.98+0.228977∗0.01=0.757892.If the students passed Math, the probability they passed Android is 0.757892.The above calculation results are presented in a graph shown in Figure2.Figure 2
Change in conditional probability.


## 5.1. Causal Inference

Causal inference is the deduction process from “cause” node to “result” node. The directed acyclic graph is represented as top-down inference of node probabilities. When the state of a node is known (evidence node), the probability distributions of its parent and child nodes are deduced. A causality analysis is conducted based on probability change, which is often used for prediction. The example of a causal inference with the Bayesian network is shown in Figure1.In order to infer, it is necessary to find out the total probability. The total probability is the sum of the probabilities of an event under different circumstances as(7)PA=∑i=1nPBiPA|X.For convenience, for a node, the p (+point) indicates that the student passed the course, P (-point) indicates that the student failed the course.In the absence of some node information, the total probability of the nodes can be calculated.(8)P+C=P+M∗P+C|+M+P−M∗P+C|−M=0.8∗0.850+0.2∗0.550=0.79.P−C=1−P+C=0.21.In the absence of some node information, the probability of the students passing and failing C# is 0.79 and 0.21, respectively.(9)P+W=P+C∗P+D∗P+W|+C,+D+P+C∗P−D∗P+W|+C,−D+P−C∗P+D∗P+W|−C,+D+P−C∗P−D∗P+W|−C,−D=0.79∗0.75∗0.99+0.79∗0.25∗0.7+0.21∗0.75∗0.9+0.21∗0.25∗0.02=0.867625.P−W=1−P+W=0.132375=0.867625.In the absence of some node information, the probability of the students passing and failing Web is 0.867625 and 0.132375, respectively.(10)P+J=P+C∗P+J|+C+P−C∗P+J|−C=0.79∗0.900+0.21∗0.600=0.837P−J=1−P+J=0.163.In the absence of some node information, the probability of the students passing and failing Java is 0.837 and 0.163, respectively.(11)P+A=P+D∗P+A|+D+P−D∗P+A|−D=0.75∗0.980+0.25∗0.010=0.7375P−A=1−P+A=0.2625.In the absence of some node information, the probability of the student passing and failing Android is 0.7375and 0.2625, respectively.For causal inference, in Bayesian network B, given the conditional probability of several nodes, the probability of occurrence of a node T is predicted:(1)
For each noden in B that has not been processed, if it has the fact of occurrence, it will be marked as processed; otherwise, continue to the next step.(2)
If one of its parent nodes has not been processed, the node is not processed; otherwise, continue to the next step.(3)
According to the probability and conditional probability of all the parent nodes of noden, the probability distribution of node n is calculated, and the node n is marked as processed.(4)
Repeat the above steps; the probability distribution of node T is the probability of its occurrence or not.Now, the following question can be answered.(i)
If the students passed Math, how likely are they to pass Java?First, from Table5, if the students have passed Math, the probability they have passed C# is 0.850. That is, after the Math exam, the students can predict their C# score—if they passed Math, the probability they passed C# is 0.850; if they failed Math, the probability they failed C# is 0.550. Everyone should do their best to ensure that the probability they passed Math is high; Math is an important basic course for students majoring in C#.(12)P+J=P+C∗P+J|+C+P−C∗P+J|−C=0.850∗0.900+0.150∗0.600=0.855If the students passed Math, the probability they passed Java is 0.855.Now, the following question can be answered.(ii)
If the students passed Math, how likely are they to pass Web?From Table5, if the students have passed Math, the probability they passed C# is 0.850. That is, after the Math exam, the student can predict their C# score—if they passed Math, the probability they passed C# is 0.850; if they failed Math, the probability they passed C# is 0.550. From Table 4, the probability the student passed Database is 0.75 and the probability they failed C# is 0.25. Thus,(13)P+W=P+C∗P+D∗P+W|+C,+D+P+C∗P−D∗P+W|+C,−D+P−C∗P+D∗P+W|−C,+D+P−C∗P−D∗P+W|−C,−D=0.85∗0.75∗0.99+0.85∗0.25∗0.7+0.25∗0.75∗0.9+0.25∗0.25∗0.02=0.949875.The probability they passed Web is 0.949875, if they passed Math.Through these methods, the probability for any case can be predicted.


## 5.2. Diagnostic Inference

The diagnostic and support inferences are the processes of inferring the cause from the result. The reverse inference process involves passing informing from the network child node to the parent node in the network. When an event has occurred, the conditional probability distribution of “result” is used to solve the probability distribution of “cause.” It can effectively deduce the cause and cause probability. More commonly used interferences are pathological inference in the medical field and fault detection of systems and electronic devices. Further, because different semesters have different courses, it can also be used as diagnostic inference to estimate the probability of the later semester courses. An example of the diagnostic inference with the Bayesian network is shown in Figure1.For diagnostic inference, in Bayesian network B, given the conditional probability of several nodes, the probability of occurrence of a node T is predicted:(1)
For each noden in B that has not been processed, if it has the fact of occurrence, it will be marked as processed; otherwise, continue to the next step.(2)
If one of its child nodes has not been processed, the node is not processed; otherwise, continue to the next step.(3)
According to the probability and conditional probability of all the child nodes of noden, the probability distribution of node n is calculated, and the node n is marked as processed.(4)
Repeat the above steps; the probability distribution of node T is the probability of its occurrence or not.Now, the following question can be answered.(i)
If the students passed Android, how likely are they to pass Web?First, the total probability of passing Android should be calculated.(14)P+A=P+D∗P+A|+D+P−D∗P+A|−D=0.75∗0.980+0.25∗0.010=0.7375.Second,P+D|+Ashould be solved. From Table 7, we can obtain P+A|+D; the famous Bayesian theorem given below can then be used [24]:(15)PA|B=pAPB|ApBP+D|+A=P+A|+D∗P+DP+A=0.98∗0.750.7375=0.99661.P−D|+A=0.00339.Finally, the total probability of passing Web is solved.(16)P+W=P+C∗P+D∗P+W|+C,+D+P+C∗P−D∗P+W|+C,−D+P−C∗P+D∗P+W|−C,+D+P−C∗P−D∗P+W|−C,−D=0.79∗0.99661∗0.99+0.79∗0.00339∗0.7+0.21∗0.99661∗0.9+0.21∗0.00339∗0.02=0.9696879.Now, the following question can be answered.(ii)
If the students passed Math, how likely are they to pass Database?First, using the probability of the students passing Web (0.949875), we can calculate the probability of them passing Math.(17)P+W=0.949875,P−W=0.050125.Second, from Table5, if the students have passed Math, the probability they passed C# is 0.850. That is, after the Math exam, the student can predict their C# score—if they passed Math, the probability they passed C# is 0.850; if they failed Math, the probability they passed C# is 0.550. Using the probability that they passed C#, we can calculate the edge condition probability of them passing Web, Database, and Math.(18)P+W|+D=P+C∗P+W|+D,+C+P−C∗P+W|+D,−C=0.85∗0.99+0.15∗0.9=0.9765.If they passed Math and Database, the probability they passed Web is 0.9765 and the probability they failed Web is 0.0235. Then, the condition probability ofP+D|+W, using equation (13), can be solved as follows:(19)P+D|+W=P+W|+D∗P+DP+W=0.9765∗0.750.949875=0.771023.If they passed Math, the probability they passed Database is 0.771023.(iii)
If the students passed Math, how likely are they to pass Android?Solving this, if they passed Math, the probability they passed Database is 0.771023.(20)P+A=P+D∗P+A|+D+P−D∗P+A|−D=0.771023∗0.98+0.228977∗0.01=0.757892.If the students passed Math, the probability they passed Android is 0.757892.The above calculation results are presented in a graph shown in Figure2.Figure 2
Change in conditional probability.


## 6. Conclusion

Bayesian networks are widely used because of their solid probability theory, flexible inference dynamic ability, and convenient decision-making mechanism. Based on the results of six courses and expert knowledge, a Bayesian network was constructed. The structure of the Bayesian network was consistent with that of expert knowledge. On the basis of structural learning and parameter learning, dynamic predictions of course performance were carried out. Our results are as follows.When students did not take any course, the probability of passing each course wasP (+C) = 0.79, P (+W) = 0.867625, P (+J) = 0.837, and P (+A) = 0.7375. Once the students passed Math, however, the conditional probability that they would pass other courses was P (+C|+M) = 0.85, P (+W|+M) = 0.949875, P (+J|+M) = 0.855, and P (+A|+M) = 0.757892.We found that when the students passed Math, the conditional probabilities of other courses improved. This result is in line with real-world values. For students whose major is computer science, Math is the most important course. Thus, the Bayesian network based on the performance of the course can be used in the dynamic inference of course performance, and the inference results can also be used for visual programming.It can be seen from the inference results that the performance of the ancestor node has a great impact on the performance of the offspring node. This model can be used in any school or educational management system. According to the current scores, the scores of the follow-up courses can be visualized, and the predicted results can be sent to students in time by WeChat or Email, which will greatly stimulate students’ learning engagement.



---

*Source: 6613896-2020-12-07.xml*