LlamaFur:学习潜在类别矩阵以发现维基百科中的意外关系
LlamaFur: Learning Latent Category Matrix to Find Unexpected Relations in Wikipedia
摘要:
除了发现趋势和揭示典型模式之外,现代信息检索越来越关注在文本数据集中发现令人惊讶的信息。在这项工作中,我们专注于发现“意想不到的链接”超链接文档语料库时,文件被分配到类别。为了实现这一目标,我们通过节点类别对超链接图进行建模:弧的存在由弧的头部和尾部的类别来促进或阻止。具体来说,我们确定一个潜在的类别矩阵,解释共同的链接。该矩阵是使用基于边缘的在线学习算法(被动-主动)构建的,这使得我们能够在不到$10$分钟的时间内处理带有$10^{8}$链接的图形。我们表明,我们的方法提供了更好的准确性比大多数现有的基于文本的技术,具有更高的效率和依赖于一个更少量的信息。它还提供了比标准的链接预测更高的精度,特别是在低召回水平;这两种方法实际上是相互正交的,因此可以有效地结合起来。
英文摘要:
Besides finding trends and unveiling typical patterns, modern information retrieval is increasingly more interested in the discovery of surprising information in textual datasets. In this work we focus on finding "unexpected links" in hyperlinked document corpora when documents are assigned to categories. To achieve this goal, we model the hyperlinks graph through node categories: the presence of an arc is fostered or discouraged by the categories of the head and the tail of the arc. Specifically, we determine a latent category matrix that explains common links. The matrix is built using a margin-based online learning algorithm (Passive-Aggressive), which makes us able to process graphs with $10^{8}$ links in less than $10$ minutes. We show that our method provides better accuracy than most existing text-based techniques, with higher efficiency and relying on a much smaller amount of information. It also provides higher precision than standard link prediction, especially at low recall levels; the two methods are in fact shown to be orthogonal to each other and can therefore be fruitfully combined.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。