Table 2. Zero order of the Improvement of PC Algorithm based on CMI test.
1: | Start with a complete undirected graph ![]() |
2: | Repeat |
3: | For each ![]() |
4: | For each ![]() |
5: | If X and Y are independent based on the measure of MI |
6: | Remove the edge between X and Y from ![]() |
7: | The MIT score was utilized in the HC algorithm to construct ![]() |