利用图论相关知识,提出了一种构建本质图的改进算法。数值实验表明,对于V-结构较多的非循环有向图,改进算法能相对较快地确定出其本质图,从而能更好地学习贝叶斯网络的等价类。
This paper proposed an improved algorithm for the construction of the essential graph by using the related knowledge of graph theory. Numerical experiment shows that it is relatively faster to determine the essential graph of acyclic directed graphs with more V-structures by employing the improved algorithm,thus the study of equivalence classes becomes better.