Sciweavers

Share
ILP
2007
Springer

Combining Clauses with Various Precisions and Recalls to Produce Accurate Probabilistic Estimates

9 years 3 months ago
Combining Clauses with Various Precisions and Recalls to Produce Accurate Probabilistic Estimates
Statistical Relational Learning (SRL) combines the benefits of probabilistic machine learning approaches with complex, structured domains from Inductive Logic Programming (ILP). We propose a new SRL algorithm, GleanerSRL, to generate the probability that an example is positive within highly-skewed relational domains. In this work, we combine clauses from Gleaner, an ILP algorithm for learning a wide variety of first-order clauses, with the propositional learning technique of support vector machines to learn well-calibrated probabilities. We find that our results are comparable to SRL algorithms SAYU and SAYUVISTA on a well-known relational testbed.
Mark Goadrich, Jude W. Shavlik
Added 08 Jun 2010
Updated 08 Jun 2010
Type Conference
Year 2007
Where ILP
Authors Mark Goadrich, Jude W. Shavlik
Comments (0)
books