| 构建本质图的改进算法* |
| |
| 引用本文： | 高晓利,李冰寒,刘三阳. 构建本质图的改进算法*[J]. 计算机应用研究, 2010, 27(12): 4530-4532. DOI: 10.3969/j.issn.1001-3695.2010.12.039 |
| |
| 作者姓名： | 高晓利 李冰寒 刘三阳 |
| |
| 作者单位： | 西安电子科技大学,理学院,西安,710071 |
| |
| 基金项目： | 国家自然科学基金资助项目（60674108,60705004） |
| |
| 摘 要： | 利用图论相关知识，提出了一种构建本质图的改进算法。数值实验表明，对于V-结构较多的非循环有向图，改进算法能相对较快地确定出其本质图，从而能更好地学习贝叶斯网络的等价类。
|
| 关 键 词： | 数据挖掘 贝叶斯网络 结构学习 等价类 本质图 |
Improved algorithm for construction of essential graph |
| |
| GAO Xiao-li,LI Bing-han,LIU San-yang. Improved algorithm for construction of essential graph[J]. Application Research of Computers, 2010, 27(12): 4530-4532. DOI: 10.3969/j.issn.1001-3695.2010.12.039 |
| |
| Authors: | GAO Xiao-li LI Bing-han LIU San-yang |
| |
| Abstract: | This paper proposed an improved algorithm for the construction of the essential graph by using the related know-ledge 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. |
| |
| Keywords: | data mining Bayesian network structure learning equivalence class essential graph |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
|
