【24h】

Clue-based Spatio-textual Query

机译:基于线索的Spatio-Textual查询

获取原文

摘要

Along with the proliferation of online digital map and location-based service, very large POI (point of interest) databases have been constructed where a record corresponds to a POI with information including name, category, address, geographical location and other features. A basic spatial query in POI database is POI retrieval. In many scenarios, a user cannot provide enough information to pinpoint the POI except some clue. For example, a user wants to identify a cafe in a city visited many years ago. SHe cannot remember the name and address but she still recalls that "the cafe is about 200 meters away from a restaurant; and turning left at the restaurant there is a bakery 500 meters away, etc.". Intuitively, the clue, even partial and approximate, describes the spatio-textual context around the targeted POI. Motivated by this observation, this work investigates clue-based spatio-textual query which allows user providing clue, i.e., some nearby POIs and the spatial relationships between them, in POI retrieval. The objective is to retrieve k POIs from a POI database with the highest spatio-textual context similarities against the clue. This work has deliberately designed data-quality-tolerant spatio-textual context similarity metric to cope with various data quality problems in both the clue and the POI database. Through crossing valuation, the query accuracy is further enhanced by ensemble method. Also, this work has developed an index called roll-out-star R-tree (RSR-tree) to dramatically improve the query processing efficiency. The extensive tests on data sets from the real world have verified the superiority of our methods in all aspects.
机译:随着在线数字地图和基于位置的服务的扩散,已经构建了非常大的POI(兴趣点)数据库,其中记录对应于具有名称,类别,地址,地理位置和其他功能的POI的POI。 POI数据库中的基本空间查询是POI检索。在许多场景中,用户不能提供足够的信息来查明除某些线索之外的POI。例如,用户想要识别多年前访问的城市的咖啡馆。她不记得姓名和地址,但她还记得“咖啡馆距离餐厅约有200米;在餐厅左转,有一个面包店500米距离等等”。直观地,线索,甚至部分和近似,描述了目标POI周围的时空上下文。这项工作激励,该工作调查了基于线索的时空文本查询,允许用户提供线索,即一些附近的POI和它们之间的空间关系,在POI检索中。目标是从POI数据库中检索K POI,其与线索的最高的时空上下文相似度。这项工作故意设计了数据质量容忍的时空上下文相似度标准,以应对线索和POI数据库中的各种数据质量问题。通过交叉估值,通过集合方法进一步增强了查询精度。此外,这项工作开发了一个名为ROLL-OUT-STAR R树(RSR树)的索引,从而大大提高查询处理效率。来自现实世界的数据集的广泛测试已经验证了各方面的方法的优势。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号