arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1104.1605cs.IRcs.DBcs.SI
收藏

在线社会标签网络中的Top-K检索

Efficient Top-K Retrieval in Online Social Tagging Networks

Silviu Maniu, Bogdan Cautis

摘要:

在本文中,我们认为在社会标签系统,也被称为大众分类的top-k查询回答。这个问题需要从现有的,社会不可知的技术显著偏离。在网络感知环境中,人们可以(也应该)利用社交链接,这可以表明用户与搜索者的关系以及他们的标记行为在结果构建中应该具有多大的权重。我们提出了一种算法,有可能扩展到当前的应用程序。虽然在以前的文献中已经考虑过这个问题,但这是在强简化假设下或在甚至不能扩展到中等规模的现实世界应用程序的选择下完成的。我们首先考虑问题的一个关键方面,即访问给定搜索者的最接近或最相关的用户。我们描述了如何在飞行中(没有任何预先计算)几个可能的选择-可以说是最自然的-在用户网络中的邻近计算。在此基础上,我们的top-k算法是健全和完整的,同时解决了现有的可扩展性问题。重要的是,我们的技术是实例优化的情况下,搜索完全依赖于标记动作的社会权重。为了进一步减少响应时间,我们考虑近似的效率方向。对真实世界数据的大量实验表明,我们的技术可以大大提高响应时间,而不牺牲精度。

英文摘要:

We consider in this paper top-k query answering in social tagging systems, also known as folksonomies. This problem requires a significant departure from existing, socially agnostic techniques. In a network-aware context, one can (and should) exploit the social links, which can indicate how users relate to the seeker and how much weight their tagging actions should have in the result build-up. We propose an algorithm that has the potential to scale to current applications. While the problem has already been considered in previous literature, this was done either under strong simplifying assumptions or under choices that cannot scale to even moderate-size real world applications. We first consider a key aspect of the problem, which is accessing the closest or most relevant users for a given seeker. We describe how this can be done on the fly (without any pre-computations) for several possible choices - arguably the most natural ones - of proximity computation in a user network. Based on this, our top-k algorithm is sound and complete, while addressing the scalability issues of the existing ones. Importantly, our technique is instance optimal in the case when the search relies exclusively on the social weight of tagging actions. To further reduce response times, we then consider directions for efficiency by approximation. Extensive experiments on real world data show that our techniques can drastically improve the response time, without sacrificing precision.

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

↑