首页> 外文会议>IEEE International Conference on Mobile Data Management >Crowdsourcing Based Evaluation of Ranking Approaches for Spatial Keyword Querying
【24h】

Crowdsourcing Based Evaluation of Ranking Approaches for Spatial Keyword Querying

机译:基于众包的空间关键词查询排序方法评价

获取原文

摘要

Spatial keyword querying has attracted considerable research efforts in the past few years. A prototypical query takes a location and keywords as arguments and returns the k objects that score the highest according to a ranking function. While different scoring functions have been used, how to compare different ranking functions for spatial keyword querying still remains an open question with little investigation. We propose a crowdsourcing-based approach to evaluate and compare ranking functions for spatial keyword search. Given two ranking functions f and f, we use a matrix to model all possible binary questions regarding the different results produced by f and f. We propose a multi-step process to reduce the number of binary questions, identifying the most important questions to ask. Further, we design a crowdsourcing model that obtains the answers to those important binary questions from crowd workers. We also devise a global evaluation process that is able to quantitatively compare f and f based on a multitude of answers received. According to the results of empirical studies using real data, the proposed approach is efficient and able to draw reliable conclusions in comparing ranking functions for spatial keyword search.
机译:在过去的几年中,空间关键词查询吸引了大量的研究工作。原型查询将位置和关键字作为参数,并根据排名函数返回得分最高的k个对象。尽管已使用了不同的评分功能,但如何比较不同的排名功能以进行空间关键字查询仍然是一个悬而未决的问题,需要进行很少的调查。我们提出了一种基于众包的方法来评估和比较用于空间关键字搜索的排名函数。给定两个排名函数f和f,我们使用矩阵对与f和f产生的不同结果有关的所有可能的二元问题建模。我们提出了一个多步骤的过程,以减少二元问题的数量,从而确定最重要的问题。此外,我们设计了一个众包模型,该模型可以从人群工作者那里获得那些重要的二元问题的答案。我们还设计了一种全局评估流程,该流程能够根据收到的大量答案对f和f进行定量比较。根据使用实际数据进行的实证研究的结果,该方法是有效的,并且能够在比较空间关键词搜索的排名函数时得出可靠的结论。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号