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

无监督关键词提取的检索效率权衡

Retrieval-efficiency trade-off of Unsupervised Keyword Extraction

Blaž Škrlj, Boshko Koloski, Senja Pollak

AI总结:

本文提出一种无监督关键词提取方法,通过顺序合并文档部分并利用个性化PageRank,在保持最先进检索性能的同时,速度比现有方法快两个数量级,并能在不到一分钟内处理1400万篇文档。

摘要:

高效识别代表给定文档的关键短语是一项具有挑战性的任务。近年来,人们提出了大量关键词检测方法。这些方法可以基于统计(基于频率)的属性,例如词元、专门的神经语言模型,或基于给定文档派生的图结构。基于图的方法在保持检索性能的同时,可以成为计算上最高效的方法之一。图方法共有的一个主要属性是它们将词元空间直接转换为图,然后进行后续处理。在本文中,我们探索了一种新颖的无监督方法,该方法在构建词元图之前,以顺序形式合并文档的部分内容。此外,通过利用个性化的PageRank,在节点排名期间考虑此类子短语的频率以及词元长度,我们展示了最先进的检索能力,同时比当前最先进的无监督检测器(如YAKE和MultiPartiteRank)快多达两个数量级。所提出方法的可扩展性也得到了证明,通过计算包含1400万篇文档的生物医学语料库的关键短语,用时不到一分钟。

英文摘要:

Efficiently identifying keyphrases that represent a given document is a challenging task. In the last years, plethora of keyword detection approaches were proposed. These approaches can be based on statistical (frequency-based) properties of e.g., tokens, specialized neural language models, or a graph-based structure derived from a given document. The graph-based methods can be computationally amongst the most efficient ones, while maintaining the retrieval performance. One of the main properties, common to graph-based methods, is their immediate conversion of token space into graphs, followed by subsequent processing. In this paper, we explore a novel unsupervised approach which merges parts of a document in sequential form, prior to construction of the token graph. Further, by leveraging personalized PageRank, which considers frequencies of such sub-phrases alongside token lengths during node ranking, we demonstrate state-of-the-art retrieval capabilities while being up to two orders of magnitude faster than current state-of-the-art unsupervised detectors such as YAKE and MultiPartiteRank. The proposed method's scalability was also demonstrated by computing keyphrases for a biomedical corpus comprised of 14 million documents in less than a minute.

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

↑