基于退避和聚集的张量分解的高阶关系模式归纳
Higher-order Relation Schema Induction using Tensor Factorization with Back-off and Aggregation
摘要:
关系模式归纳(RSI)是从未标记文本中识别关系参数的类型签名的问题。这一领域的大多数先前工作仅集中在二进制RSI上,即,每个关系仅引入主体和对象类型签名。然而,在实践中,许多关系是高阶的,即,它们有两个以上的参数,并且所有参数的归纳类型签名都是必要的。例如,在体育领域中,引入模式win(WinningPlayer,OpponentPlayer,Tournament,Location)比仅引入win(WinningPlayer,OpponentPlayer)信息量更大。我们把这个问题称为高阶关系模式归纳(HRSI)。在本文中,我们提出了张量分解与回退和聚合(TFBA),HRSI问题的一个新的框架。据我们所知,这是第一次尝试从未标记的文本中诱导高阶关系图式。通过对三个真实世界数据集的实验分析,我们展示了TFBA如何帮助处理稀疏性并诱导高阶模式。
英文摘要:
Relation Schema Induction (RSI) is the problem of identifying type signatures of arguments of relations from unlabeled text. Most of the previous work in this area have focused only on binary RSI, i.e., inducing only the subject and object type signatures per relation. However, in practice, many relations are high-order, i.e., they have more than two arguments and inducing type signatures of all arguments is necessary. For example, in the sports domain, inducing a schema win(WinningPlayer, OpponentPlayer, Tournament, Location) is more informative than inducing just win(WinningPlayer, OpponentPlayer). We refer to this problem as Higher-order Relation Schema Induction (HRSI). In this paper, we propose Tensor Factorization with Back-off and Aggregation (TFBA), a novel framework for the HRSI problem. To the best of our knowledge, this is the first attempt at inducing higher-order relation schemata from unlabeled text. Using the experimental analysis on three real world datasets, we show how TFBA helps in dealing with sparsity and induce higher order schemata.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。