Gradient-based boosting for statistical relational learning: the Markov logic network and missing data cases
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 60547818X | ||
| 003 | CHVBK | ||
| 005 | 20210128100404.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20150701xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s10994-015-5481-4 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s10994-015-5481-4 | ||
| 245 | 0 | 0 | |a Gradient-based boosting for statistical relational learning: the Markov logic network and missing data cases |h [Elektronische Daten] |c [Tushar Khot, Sriraam Natarajan, Kristian Kersting, Jude Shavlik] |
| 520 | 3 | |a Recent years have seen a surge of interest in Statistical Relational Learning (SRL) models that combine logic with probabilities. One prominent and highly expressive SRL model is Markov Logic Networks (MLNs), but the expressivity comes at the cost of learning complexity. Most of the current methods for learning MLN structure follow a two-step approach where first they search through the space of possible clauses (i.e. structures) and then learn weights via gradient descent for these clauses. We present a functional-gradient boosting algorithm to learn both the weights (in closed form) and the structure of the MLN simultaneously. Moreover most of the learning approaches for SRL apply the closed-world assumption, i.e., whatever is not observed is assumed to be false in the world. We attempt to open this assumption. We extend our algorithm for MLN structure learning to handle missing data by using an EM-based approach and show this algorithm can also be used to learn Relational Dependency Networks and relational policies. Our results in many domains demonstrate that our approach can effectively learn MLNs even in the presence of missing data. | |
| 540 | |a The Author(s), 2015 | ||
| 690 | 7 | |a Statistical relational learning |2 nationallicence | |
| 690 | 7 | |a Markov logic networks |2 nationallicence | |
| 690 | 7 | |a Missing data |2 nationallicence | |
| 690 | 7 | |a Expectation maximization |2 nationallicence | |
| 700 | 1 | |a Khot |D Tushar |u University of Wisconsin, Madison, WI, USA |4 aut | |
| 700 | 1 | |a Natarajan |D Sriraam |u Indiana University, Bloomington, IN, USA |4 aut | |
| 700 | 1 | |a Kersting |D Kristian |u TU Dortmund University, Dortmund, Germany |4 aut | |
| 700 | 1 | |a Shavlik |D Jude |u University of Wisconsin, Madison, WI, USA |4 aut | |
| 773 | 0 | |t Machine Learning |d Springer US; http://www.springer-ny.com |g 100/1(2015-07-01), 75-100 |x 0885-6125 |q 100:1<75 |1 2015 |2 100 |o 10994 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s10994-015-5481-4 |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s10994-015-5481-4 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Khot |D Tushar |u University of Wisconsin, Madison, WI, USA |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Natarajan |D Sriraam |u Indiana University, Bloomington, IN, USA |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Kersting |D Kristian |u TU Dortmund University, Dortmund, Germany |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Shavlik |D Jude |u University of Wisconsin, Madison, WI, USA |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Machine Learning |d Springer US; http://www.springer-ny.com |g 100/1(2015-07-01), 75-100 |x 0885-6125 |q 100:1<75 |1 2015 |2 100 |o 10994 | ||