Skip to content

Commit

Permalink
typo correction ch 5/6/7
Browse files Browse the repository at this point in the history
  • Loading branch information
ElektroDuck committed Mar 8, 2024
1 parent 7f21fa7 commit 48676ab
Showing 1 changed file with 5 additions and 5 deletions.
10 changes: 5 additions & 5 deletions notebook.ipynb
Original file line number Diff line number Diff line change
Expand Up @@ -850,9 +850,9 @@
"id": "c94b8ebf",
"metadata": {},
"source": [
"The libraries used in this notebook represents the bayesian network as a **Directed Acyclic Graph (DAG)**.\n",
"The libraries used in this notebook represent the bayesian network as a **Directed Acyclic Graph (DAG)**.\n",
"\n",
"A DAG is a graph that has a **topological ordering**, which means that the edges are oriented: they have a starting node and a destination node. This is important because the edges in the Bayesian Network represent the causal relation between the variables: the edge goes from the cause to the effect"
"A DAG is a graph that has a **topological ordering**, which means that the edges are oriented: they have a starting node and a destination node. This is important because the edges in the Bayesian Network represent the causal relation between the variables: the edge goes from the cause to the effect."
]
},
{
Expand Down Expand Up @@ -904,7 +904,7 @@
"id": "29a9dac2",
"metadata": {},
"source": [
"From the above plot, we can see that the structure of the Bayesian Network learnt from the data has some edges that are meaningless.\n",
"From the above graph, we can see that the structure of the Bayesian Network learnt from the data has some edges that are meaningless.\n",
"\n",
"For example, the edges that points to `Age` and `Sex` does not make sense, because those features are not a consequence of other features, but it is valid the vice versa.\n",
"\n",
Expand All @@ -925,7 +925,7 @@
"id": "04a65648",
"metadata": {},
"source": [
"In this section we will add a blacklist to the Hill Climbing algorithm that will limit the creation of unexplainable networks. The black list is passed as a parameter to the Hill Climbing algorithm.\n",
"In this section we will add a blacklist to the Hill Climbing algorithm that will limit the creation of unexplainable networks. The blacklist is passed as a parameter to the Hill Climbing algorithm.\n",
"\n"
]
},
Expand Down Expand Up @@ -1669,7 +1669,7 @@
"<a class=\"anchor\" id=\"ch9\"></a>\n",
"###### [Back to top](#top)\n",
"\n",
"Thanks to `pgmpy` it is possible to investigate several **properties of the network**. In particular the interent is to find the **conditional independencies** and **active trails** with respect to some given evidence or to ask for the **Markov Blanket** of a node. "
"Thanks to `pgmpy` it is possible to investigate several **properties of the network**. In particular the interest is to find the **conditional independencies** and **active trails** with respect to some given evidence or to ask for the **Markov Blanket** of a node. "
]
},
{
Expand Down

0 comments on commit 48676ab

Please sign in to comment.