arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1301.6689cs.AI
收藏

稀疏数据因果模型构造的混合Anytime算法

A Hybrid Anytime Algorithm for the Constructiion of Causal Models From Sparse Data

University of Pittsburgh(匹兹堡大学)

Denver Dash, Marek J. Druzdzel

摘要:

我们提出了一个混合约束为基础的/贝叶斯算法学习因果网络中存在的稀疏数据。该算法搜索空间的等价类的模型(基本图),使用传统的基于约束的技术的基础上的启发式。然后将每个基本图转换为有向非循环图,并使用贝叶斯评分度量进行评分。该算法的两个变种的开发和测试使用的数据从随机生成的网络的大小从15到45个节点的数据大小范围从250到2000记录。这两种变化进行了比较,并发现始终优于两个变化的贪婪搜索与重新启动。

英文摘要:

We present a hybrid constraint-based/Bayesian algorithm for learning causal networks in the presence of sparse data. The algorithm searches the space of equivalence classes of models (essential graphs) using a heuristic based on conventional constraint-based techniques. Each essential graph is then converted into a directed acyclic graph and scored using a Bayesian scoring metric. Two variants of the algorithm are developed and tested using data from randomly generated networks of sizes from 15 to 45 nodes with data sizes ranging from 250 to 2000 records. Both variations are compared to, and found to consistently outperform two variations of greedy search with restarts.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑