Golem is an inductive logic programming algorithm developed by Stephen Muggleton and Feng. It uses the technique relative least general generalization proposed by Gordon Plotkin. Therefore, only positive examples are used and the search is bottom-up. Negative examples can be used to reduce the size of the hypothesis by deleting useless literals from the body clause.
| Property | Value |
|---|
| dbpprop:abstract
|
- Golem is an inductive logic programming algorithm developed by Stephen Muggleton and Feng. It uses the technique relative least general generalization proposed by Gordon Plotkin. Therefore, only positive examples are used and the search is bottom-up. Negative examples can be used to reduce the size of the hypothesis by deleting useless literals from the body clause.
|
| dbpprop:hasPhotoCollection
| |
| rdfs:comment
|
- Golem is an inductive logic programming algorithm developed by Stephen Muggleton and Feng. It uses the technique relative least general generalization proposed by Gordon Plotkin. Therefore, only positive examples are used and the search is bottom-up. Negative examples can be used to reduce the size of the hypothesis by deleting useless literals from the body clause.
|
| rdfs:label
| |
| owl:sameAs
| |
| skos:subject
| |
| foaf:page
| |
| is dbpprop:disambiguates
of | |
![[RDF Data]](/statics/sw-cube.png)
