arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1711.04044cs.CLcs.IRcs.LG
收藏

用于关系抽取的核化散列码表示

Kernelized Hashcode Representations for Relation Extraction

USC Information Sciences Institute(南加州大学信息科学研究所);IBM Thomas J. Watson Research Center(IBM托马斯·J·沃森研究中心)

Sahil Garg, Aram Galstyan, Greg Ver Steeg, Irina Rish, Guillermo Cecchi, Shuyang Gao

摘要:

核方法已经为诸如关系抽取的许多NLP任务产生了最先进的结果,但是由于计算自然语言结构之间的核相似性的高成本而具有较差的可扩展性。最近提出的一种技术,核局部敏感哈希(KLSH),可以显着降低计算成本,但只适用于kNN图上操作的分类器。在这里,我们建议使用随机子空间的KLSH码有效地构建一个显式表示的NLP结构适用于一般的分类方法。此外,我们提出了一种方法,用于优化KLSH模型的分类问题,通过最大限度地近似之间的互信息的KLSH代码(特征向量)和类标签。我们在生物医学关系抽取数据集上评估了所提出的方法,并观察到在准确性方面的显著和稳健的改进。最先进的分类器,以及与传统内核方法相比的急剧(数量级)加速。

英文摘要:

Kernel methods have produced state-of-the-art results for a number of NLP tasks such as relation extraction, but suffer from poor scalability due to the high cost of computing kernel similarities between natural language structures. A recently proposed technique, kernelized locality-sensitive hashing (KLSH), can significantly reduce the computational cost, but is only applicable to classifiers operating on kNN graphs. Here we propose to use random subspaces of KLSH codes for efficiently constructing an explicit representation of NLP structures suitable for general classification methods. Further, we propose an approach for optimizing the KLSH model for classification problems by maximizing an approximation of mutual information between the KLSH codes (feature vectors) and the class labels. We evaluate the proposed approach on biomedical relation extraction datasets, and observe significant and robust improvements in accuracy w.r.t. state-of-the-art classifiers, along with drastic (orders-of-magnitude) speedup compared to conventional kernel methods.

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

↑