arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1301.4293cs.LGstat.ML
收藏

通用模式的潜在关系表示

Latent Relation Representations for Universal Schemas

University College London(伦敦大学学院);University of Massachusetts at Amherst(马萨诸塞大学阿默斯特分校)

Sebastian Riedel, Limin Yao, Andrew McCallum

摘要:

传统的关系抽取是在固定的、有限的目标模式中预测关系。完成此任务的机器学习方法需要手动注释,或者在远程监督的情况下,需要相同模式的现有结构化源。通过使用通用模式可以避免对现有数据集的需求:所有相关模式的联合(OpenIE中的表面形式谓词,以及预先存在的数据库模式中的关系)。该模式具有几乎无限的关系集(由于表面形式),并支持与现有结构化数据的集成(通过现有数据库的关系类型)。为了填充这样的模式的数据库,我们提出了一个家庭的矩阵分解模型,预测数据库元组和关系之间的亲和力。我们表明,这比传统的分类方法实现了更高的精度。更重要的是,通过同时操作在文本中观察到的关系和在先前存在的结构化数据库(如Freebase)中观察到的关系,我们能够以相互支持的方式对非结构化和结构化数据进行推理。通过这样做,我们的方法优于最先进的远程监控系统。

英文摘要:

Traditional relation extraction predicts relations within some fixed and finite target schema. Machine learning approaches to this task require either manual annotation or, in the case of distant supervision, existing structured sources of the same schema. The need for existing datasets can be avoided by using a universal schema: the union of all involved schemas (surface form predicates as in OpenIE, and relations in the schemas of pre-existing databases). This schema has an almost unlimited set of relations (due to surface forms), and supports integration with existing structured data (through the relation types of existing databases). To populate a database of such schema we present a family of matrix factorization models that predict affinity between database tuples and relations. We show that this achieves substantially higher accuracy than the traditional classification approach. More importantly, by operating simultaneously on relations observed in text and in pre-existing structured DBs such as Freebase, we are able to reason about unstructured and structured data in mutually-supporting ways. By doing so our approach outperforms state-of-the-art distant supervision systems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑