论文标题

与人类在循环中扩展知识图

Expanding Knowledge Graphs with Humans in the Loop

论文作者

Manzoor, Emaad, Tong, Jordan, Vijayaraghavan, Sriniketh, Li, Rui

论文摘要

策划的知识图编码域专业知识并提高了一些域中的建议,分割,广告定位和其他机器学习系统的性能。随着新概念在域中出现,必须扩展知识图以保持机器学习的性能。但是,手动扩展知识图在大规模上是不可行的。在这项工作中,我们提出了一种通过人类在循环中扩展知识图的方法。具体而言,鉴于知识图,我们的方法预测了将添加到该图中的新概念的“父母”,以进一步验证人类专家。我们证明我们的方法既准确又“对人类友好”。具体来说,我们证明我们的方法预测了知识图中“近来”概念的真正父母的父母,即使预测不正确。然后,我们通过一个受控的实验表明,满足该属性会提高人类合作的速度和准确性。我们在Pinterest的知识图上进一步评估了我们的方法,并表明它在准确性和人类友好性上都优于竞争方法。在Pinterest的生产部署后,我们的方法将知识图扩展所需的时间降低了约400%(与手动扩展相比),并促成了随后的AD收入增加20%。

Curated knowledge graphs encode domain expertise and improve the performance of recommendation, segmentation, ad targeting, and other machine learning systems in several domains. As new concepts emerge in a domain, knowledge graphs must be expanded to preserve machine learning performance. Manually expanding knowledge graphs, however, is infeasible at scale. In this work, we propose a method for knowledge graph expansion with humans-in-the-loop. Concretely, given a knowledge graph, our method predicts the "parents" of new concepts to be added to this graph for further verification by human experts. We show that our method is both accurate and provably "human-friendly". Specifically, we prove that our method predicts parents that are "near" concepts' true parents in the knowledge graph, even when the predictions are incorrect. We then show, with a controlled experiment, that satisfying this property increases both the speed and the accuracy of the human-algorithm collaboration. We further evaluate our method on a knowledge graph from Pinterest and show that it outperforms competing methods on both accuracy and human-friendliness. Upon deployment in production at Pinterest, our method reduced the time needed for knowledge graph expansion by ~400% (compared to manual expansion), and contributed to a subsequent increase in ad revenue of 20%.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源