【24h】

Clue-based Spatio-textual Query

机译:基于线索的时空文本查询

获取原文

摘要

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(只有一些线索)。例如,用户想要识别许多年前访问过的城市中的咖啡馆。他忘记了名字和地址,但她仍然记得“咖啡馆距离饭店约200米;在餐厅左转,还有一家面包店500米,依此类推”。直观上,线索(甚至是部分的和近似的)描述了目标POI周围的时空文本上下文。出于这种观察的动机,这项工作研究了基于线索的时空文本查询,该查询允许用户在POI检索中提供线索,即一些附近的POI及其之间的空间关系。目的是从针对该线索的时空文本上下文相似度最高的POI数据库中检索k个POI。这项工作有意设计了可容忍数据质量的时空-文本上下文相似性度量,以应对线索和POI数据库中的各种数据质量问题。通过交叉估值,通过集成方法可以进一步提高查询的准确性。此外,这项工作还开发了一个名为“推出星形R-树(RSR-tree)”的索引,以显着提高查询处理效率。对来自现实世界的数据集的广泛测试已经证明了我们方法在各个方面的优越性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号