# What is the meaning of calculating Maximum Likelihood from complete data for Bayesian Nework paremeter learning?

I am taking a subject on Bayesian Network on Youtube. Somehow, I am struggling from understand the meaning of calculating Maximum Likelihood estimates from complete data for a for bayesian nework paremeter learning?. Appreciations if somebody can explain the meaning of it.

===================== Added part for a clarification to my question =====================

I am studying how to learn the concept and implementation of structural learning on Bayesian Network. While studying it, I have faced parameter learning and structural learning.

One thing that I couldn't understand was that there were some methods to do the parameter learning on complete data and incomplete data. I was wondering why we need to learn the parameters on the network while we have a complete set of data.

The lecturer was saying we can just count them and build empirical distributions. Somehow, I didn't really understand what he was saying. For incomplete data set, the lecturer said we can use EM algorithm. I understand what he was trying to say, somehow It was kind of confusing to figure out the specific way that he was trying to say.

Another thing that I want to know is how to do the structural learning for a bayesian network. I want to know how the mathematical expressions are implemented. as you told me the two methods, I'd like to know how they are implemented. I don't mind mathematical ways of explanations as long as it shows the steps. Do I need to choose one of the two methods, you mentioned in your answer, to do learning structure? What kind of independence test is needed to do it? Do I have to apply the method 'a' and the method 'b' together? How can I implement it?

Hope I can have a small example for it.

• It looks like some video on Youtube is confusing in some way. Could you provide a link to that video? That will help us help you better. Jul 8, 2019 at 14:57

honestly i don't understand perfectly your question (and i cannot comment thats why i answer).

However there is two main things to do when learning a bayesian network.

1. Learning structure of the bayesian network, and for that there is two main ways: a. By computing an indépendant test between all the variables (with different depth, see Pearl and Company for that) For this idea the most simple way is to consider you have a full network (i don't know the english word, but you begin with a network where all nodes are connected, a n-clique). Let's say you have $$X_1,X_2,\dots,X_K$$ variables. You begin with the test for depth 0, you test if $$X_i$$ and $$X_j$$ are independent, for all $$i,j. You delete all the edges where you find independence. After you do for depth 1, you test the independence (with chi2 for example) of $$X_i$$, $$X_j$$ knowing $$X_l$$ for all $$i,j,l, you need to test only the variables on the neighborhood (for $$X_i$$ you take the neighborhood of this variable and you test all the triplets inside). After you do for depth 2, 3, 4, 5 and so on. You stop when there is no possible test to do (for example if after depth 0 you find they are all independent, then its finished).

b. By score, you compute the likelihood for example. Then you add or delete or reverse an arc then you compute the likelihood. If the change improve the likelihood then you are happy, if not you forget the change. You loop till no improvement. For the score you can choose many ways (mainly for the penalization).

Often this method begins by creating a tree. For that you compute all the weight between each pair of variable (K(K-1) computations to do, you can do parallelization). Then you order the edge according the weight and you find the minimal tree inside. After you can do what i said, you take a score (for example likelihood penalized with AIC). Its better to take a score which is such that you can compute the new score in a easy way when you just modify your network by adding or deleting or inverting an edge. The steps are easy, you compute the score, you do a modification (add an edge, delete an edge or invert an edge) then you compute the score. It improves, then its good, it doesn't improve then this change stinks. And you continue till you can't improve the score. This is just the main ideas...

1. Learning the parameters when the structure is known. In this case you just need to compute the frequencies (because you have multinomial, i assume you have a common bayesian network, and with multinomial the linked distribution in bayesian setting is dirichlet. The maximum a posteriori method show that frequency method and bayesian are then very close).

The use of EM algorithm can only be done in a special setup (where you do some assumption about your missing data), at least in a theoretical point of view. But honestly, bayesian network is already heavy in computation, if you add a EM on top of that it will be just so heavy you can"t use it for streaming application.

So i don"t see why you would compute maximum likelihood estimation to get the parameters knowing the structure (which whatever would give you the fact you need to compute the frequencies... I guess you are just looking to a proof of the formulas.)

If i am not clear (reading myself again i feel its not perfect :D), i can try to add some mathematical notation to make it easier.

I am french, so forgive my english. I have a french book about baysian network i like but i suppose there is no translation. You can try to play with bayesian network python library, the one i know is https://pyagrum.readthedocs.io/en/latest/. Read the notebooks should give you some ideas.

• I have just added some more detail on my question. Jul 8, 2019 at 12:29
• This is the link to the lecture I am looking at:youtube.com/… Videos from 11a to 12b in the playlist are what I have seen and had questions in my mind. Thank you for your detailed explanations and time. I don't know if you can take a look at them. Many thanks to you. Jul 9, 2019 at 5:51
• in video 12.a around 7 minutes, he explain the minium spanning tree. This is what i told you for the method b. Its a good beginning to initialize the structure of your direct acyclic graph. Around 23 min (video 12.a) he expose the score with penalization (AIC here if i look well). Between he just show that maximizing likelihood gives you the best structure (and you need penalization to not overfit as always). After in video 12.b he expose local search and greedy search algorithm (what is method b in my post) then he expose method a (around the mid of video). Hope it helps. Jul 9, 2019 at 12:39
• You helped me more than a lot. I don't know if I can ask you just one more thing. Is bayesian network structure learning done when we don't know the structure or we can do this even when we have a network structure from the given data to find the optimal structure? Or can we do structural learning for both cases? I am just exposed to this subject and trying to understand it. Many thanks! Jul 9, 2019 at 15:49
• You can begin with a structure. Especially when you do local search its quite easy to understand. You begin with your structure then you try to improve. Jul 9, 2019 at 18:43