%0 Journal Article %T Improved algorithm for construction of essential graph
构建本质图的改进算法* %A 高晓利 %A 李冰寒 %A 刘三阳 %J 计算机应用研究 %D 2010 %I %X 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. %K data mining %K Bayesian network %K structure learning %K equivalence class %K essential graph
数据挖掘 %K 贝叶斯网络 %K 结构学习 %K 等价类 %K 本质图 %U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=CF2EF1AB7F99BBA88DB347EAE5ACB5AE&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=59906B3B2830C2C5&sid=F652AD4967D48DCC&eid=5430CA8E37F0CDB7&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=19