首页> 外文会议>International conference on database systems for advanced applications >In Good Company: Efficient Retrieval of the Top-k Most Relevant Event-Partner Pairs
【24h】

In Good Company: Efficient Retrieval of the Top-k Most Relevant Event-Partner Pairs

机译:在良好公司中:对前k个最相关的事件合作伙伴对的有效检索

获取原文

摘要

The proliferation of event-based social networking (ESBN) motivates a range of studies on topics such as event, venue, and friend recommendation and event creation and organization. In this setting, the notion of event-partner recommendation has recently attracted attention. When recommending an event to a user, this functionality allows recommendation of partner with whom to attend the event. However, existing proposals are push-based: recommendations are pushed to users at the system's initiative. In contrast, EBSNs provide users with keyword-based search functionality. This way, users may retrieve information in pull mode. We propose a new way of accessing information in EBSNs that combines push and pull, thus allowing users to not only conduct ad-hoc searches for events, but also to receive partner recommendations for retrieved events. Specifically, we define and study the top-k event-partner (kEP) pair retrieval query that integrates event-partner recommendation and keyword-based search for events. The query retrieves event-partner pairs, taking into account the relevance of events to user-supplied keywords and so-called together preferences that indicate the extent of a user's preference to attend an event with a given partner. In order to compute kEP queries efficiently, we propose a rank-join based framework with three optimizations. Results of empirical studies with implementations of the proposed techniques demonstrate that the proposed techniques are capable of excellent performance.
机译:基于事件的社交网络(ESBN)的激增激发了一系列有关事件,地点,朋友推荐以及事件创建和组织的研究。在这种情况下,事件合作伙伴推荐的概念最近引起了人们的关注。当向用户推荐活动时,此功能允许推荐参加活动的合作伙伴。但是,现有建议是基于推送的:系统主动将建议推送给用户。相反,EBSN为用户提供基于关键字的搜索功能。这样,用户可以以拉动模式检索信息。我们提出了一种结合推拉式方式访问EBSN中信息的新方式,从而使用户不仅可以对事件进行临时搜索,而且还可以接收合作伙伴对检索到的事件的建议。具体来说,我们定义和研究了前k个事件伙伴(kEP)对检索查询,该查询将事件伙伴推荐和基于关键字的事件搜索相集成。该查询会检索事件伙伴对,并考虑事件与用户提供的关键字的相关性以及所谓的首选项,这些首选项指示用户对与给定伙伴一起参加活动的偏好的程度。为了有效地计算kEP查询,我们提出了基于排名联接的框架,并进行了三种优化。对所提出的技术的实施的实证研究结果表明,所提出的技术具有出色的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号