图 书 馆
通过随机化和最大似然法快速估计关系模式覆盖Fast Estimation of Relational Pattern Coverage through Randomization and Maximum Likelihood |
|
| 课程网址: | http://videolectures.net/icml08_kuzelka_fer/ |
| 主讲教师: | Ondřej Kuželka |
| 开课单位: | 布拉格捷克技术大学 |
| 开课时间: | 2008-07-28 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | In inductive logic programming, theta-subsumption is a widely used coverage test. Unfortunately, testing theta-subsumption is NP-complete, which represents a crucial efficiency bottleneck for many relational learners. In this paper, we present a probabilistic estimator of clause coverage, based on a randomized restarted search strategy. Under a distribution assumption, our algorithm can estimate clause coverage without having to decide subsumption for all examples. We implement this algorithm in program ReCovEr. On generated graph data and real-world datasets, we show that ReCovEr provides reasonably accurate estimates while achieving dramatic runtimes improvements compared to a state-of-the-art algorithm |
| 关 键 词: | 归纳逻辑编程; 覆盖测试; 概率估计 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-04-19：lxf |
| 阅读次数: | 6 |