A taxonomy of weight learning methods for statistical relational learning
A taxonomy of weight learning methods for statistical relational learning
复制标题
统计关系学习的权重学习方法分类
DOI:
10.1007/s10994-021-06069-5
复制
发表时间:
2021
期刊:
影响因子:
7.5
通讯作者:
Getoor, Lise
中科院分区:
文献类型:
--
作者:
Srinivasan, Sriram;Dickens, Charles;Augustine, Eriq;Farnadi, Golnoosh;Getoor, Lise
Statistical relational learning (SRL) frameworks are effective at defining probabilistic models over complex relational data. They often use weighted first-order logical rules where the weights of the rules govern probabilistic interactions and are usually learned from data. Existing weight learning approaches typically attempt to learn a set of weights that maximizes some function of data likelihood; however, this does not always translate to optimal performance on a desired domain metric, such as accuracy or F1 score. In this paper, we introduce a taxonomy of search-based weight learning approaches for SRL frameworks that directly optimize weights on a chosen domain performance metric. To effectively apply these search-based approaches, we introduce a novel projection, referred to as scaled space (SS), that is an accurate representation of the true weight space. We show that SS removes redundancies in the weight space and captures the semantic distance between the possible weight configurations. In order to improve the efficiency of search, we also introduce an approximation of SS which simplifies the process of sampling weight configurations. We demonstrate these approaches on two state-of-the-art SRL frameworks: Markov logic networks and probabilistic soft logic. We perform empirical evaluation on five real-world datasets and evaluate them each on two different metrics. We also compare them against four other weight learning approaches. Our experimental results show that our proposed search-based approaches outperform likelihood-based approaches and yield up to a 10% improvement across a variety of performance metrics. Further, we perform an extensive evaluation to measure the robustness of our approach to different initializations and hyperparameters. The results indicate that our approach is both accurate and robust.
登录
查看更多内容
DOI:
10.1609/aaai.v33i01.33017816
发表时间:
2019
期刊:
Int. J. Approx. Reason.
影响因子:
--
作者:
M. Das;D. Dhami;Gautam Kunapuli;K. Kersting;Sriraam Natarajan
通讯作者:
Sriraam Natarajan
DOI:
10.1609/aaai.v30i1.10429
发表时间:
2016-02
期刊:
--
影响因子:
--
作者:
Li Chou;Somdeb Sarkhel;Nicholas Ruozzi;Vibhav Gogate
通讯作者:
Li Chou;Somdeb Sarkhel;Nicholas Ruozzi;Vibhav Gogate
DOI:
10.1609/aaai.v30i1.10119
发表时间:
2016
期刊:
Int. J. Approx. Reason.
影响因子:
--
作者:
Somdeb Sarkhel;D. Venugopal;T. Pham;Parag Singla;Vibhav Gogate
通讯作者:
Vibhav Gogate
DOI:
--
发表时间:
2011
期刊:
SDM
影响因子:
--
作者:
Tuyen N. Huynh;R. Mooney
通讯作者:
R. Mooney
DOI:
--
发表时间:
2018
期刊:
International Conference on Artificial Intelligence and Statistics
影响因子:
--
作者:
Khan Mohammad Al Farabi;Somdeb Sarkhel;D. Venugopal
通讯作者:
D. Venugopal