当前位置: X-MOL 学术Mach. Learn. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Transfer learning by mapping and revising boosted relational dependency networks
Machine Learning ( IF 7.5 ) Pub Date : 2020-05-11 , DOI: 10.1007/s10994-020-05871-x
Rodrigo Azevedo Santos , Aline Paes , Gerson Zaverucha

Statistical machine learning algorithms usually assume the availability of data of considerable size to train the models. However, they would fail in addressing domains where data is difficult or expensive to obtain. Transfer learning has emerged to address this problem of learning from scarce data by relying on a model learned in a source domain where data is easy to obtain to be a starting point for the target domain. On the other hand, real-world data contains objects and their relations, usually gathered from noisy environments. Finding patterns through such uncertain relational data has been the focus of the Statistical Relational Learning (SRL) area. Thus, to address domains with scarce, relational, and uncertain data , in this paper, we propose TreeBoostler, an algorithm that transfers the SRL state-of-the-art Boosted Relational Dependency Networks learned in a source domain to the target domain. TreeBoostler first finds a mapping between pairs of predicates to accommodate the additive trees into the target vocabulary. After, it employs two theory revision operators devised to handle incorrect relational regression trees aiming at improving the performance of the mapped trees. In the experiments presented in this paper, TreeBoostler has successfully transferred knowledge between several distinct domains. Moreover, it performs comparably or better than learning from scratch methods in terms of accuracy and outperforms a transfer learning approach in terms of accuracy and runtime.

中文翻译:

通过映射和修改增强的关系依赖网络进行迁移学习

统计机器学习算法通常假设可以使用相当大的数据来训练模型。但是,它们无法解决难以获取数据或获取成本高昂的领域。迁移学习的出现是为了解决这个从稀缺数据中学习的问题,它依靠在源域中学习的模型作为目标域的起点。另一方面,现实世界的数据包含对象及其关系,通常是从嘈杂的环境中收集的。通过这种不确定的关系数据寻找模式一直是统计关系学习 (SRL) 领域的重点。因此,为了解决具有稀缺、相关和不确定数据的领域,在本文中,我们提出了 TreeBoostler,一种将在源域中学习的 SRL 最先进的增强关系依赖网络传输到目标域的算法。TreeBoostler 首先找到谓词对之间的映射,以将加性树容纳到目标词汇表中。之后,它采用了两个理论修正算子来处理不正确的关系回归树,旨在提高映射树的性能。在本文提出的实验中,TreeBoostler 成功地在几个不同的领域之间转移了知识。此外,它在准确性方面的表现与从头学习方法相当或更好,并且在准确性和运行时间方面优于迁移学习方法。TreeBoostler 首先找到谓词对之间的映射,以将加性树容纳到目标词汇表中。之后,它采用了两个理论修正算子来处理不正确的关系回归树,旨在提高映射树的性能。在本文提出的实验中,TreeBoostler 成功地在几个不同的领域之间转移了知识。此外,它在准确性方面的表现与从头学习方法相当或更好,并且在准确性和运行时间方面优于迁移学习方法。TreeBoostler 首先找到谓词对之间的映射,以将加性树容纳到目标词汇表中。之后,它采用了两个理论修正算子来处理不正确的关系回归树,旨在提高映射树的性能。在本文提出的实验中,TreeBoostler 成功地在几个不同的领域之间转移了知识。此外,它在准确性方面的表现与从头学习方法相当或更好,并且在准确性和运行时间方面优于迁移学习方法。TreeBoostler 已经成功地在几个不同的领域之间转移了知识。此外,它在准确性方面的表现与从头学习方法相当或更好,并且在准确性和运行时间方面优于迁移学习方法。TreeBoostler 已经成功地在几个不同的领域之间转移了知识。此外,它在准确性方面的表现与从头学习方法相当或更好,并且在准确性和运行时间方面优于迁移学习方法。
更新日期:2020-05-11
down
wechat
bug