Reverse ranking query over imprecise spatial data

Ken C.K. Lee, Mao Ye, Wang-chien Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

The reverse rank of a (data) object o with respect to a given query object q (that measures the relative nearness of q to o) is said to be κ when q is the κ-th nearest neighbor of o in a geographical space. Based on the notion of reverse ranks, a Reverse Ranking (RR) query determines t objects with the smallest κ's with respect to a given query object q. In many situations that locations of objects and a query object can be imprecise, objects would receive multiple possible κ's. In this paper, we propose a notion of expected reverse ranks and evaluation of RR queries over imprecise data based on expected reverse ranks. For any object o, an expected reverse rank κ̄ is a weighted average of possible reverse ranks for individual instances of o with respect to different instances of a given query object q by taking their probabilities into account. We devise and present incremental κ̄ computation and two κ̄-Estimating algorithms to efficiently evaluate RR queries over imprecise data. The efficiency of our approach is demonstrated through experiments.

Original languageEnglish (US)
Title of host publicationCOM.Geo 2010 - 1st International Conference and Exhibition on Computing for Geospatial Research and Application
DOIs
StatePublished - Aug 6 2010
Event1st International Conference and Exhibition on Computing for Geospatial Research and Application, COM.Geo 2010 - Washington, DC, United States
Duration: Jun 21 2010Jun 23 2010

Other

Other1st International Conference and Exhibition on Computing for Geospatial Research and Application, COM.Geo 2010
CountryUnited States
CityWashington, DC
Period6/21/106/23/10

Fingerprint

Experiments

All Science Journal Classification (ASJC) codes

  • Human-Computer Interaction
  • Computer Networks and Communications
  • Computer Vision and Pattern Recognition
  • Software

Cite this

Lee, K. C. K., Ye, M., & Lee, W. (2010). Reverse ranking query over imprecise spatial data. In COM.Geo 2010 - 1st International Conference and Exhibition on Computing for Geospatial Research and Application [17] https://doi.org/10.1145/1823854.1823875
Lee, Ken C.K. ; Ye, Mao ; Lee, Wang-chien. / Reverse ranking query over imprecise spatial data. COM.Geo 2010 - 1st International Conference and Exhibition on Computing for Geospatial Research and Application. 2010.
@inproceedings{672f98f60ad84819b652f56dd158e6ab,
title = "Reverse ranking query over imprecise spatial data",
abstract = "The reverse rank of a (data) object o with respect to a given query object q (that measures the relative nearness of q to o) is said to be κ when q is the κ-th nearest neighbor of o in a geographical space. Based on the notion of reverse ranks, a Reverse Ranking (RR) query determines t objects with the smallest κ's with respect to a given query object q. In many situations that locations of objects and a query object can be imprecise, objects would receive multiple possible κ's. In this paper, we propose a notion of expected reverse ranks and evaluation of RR queries over imprecise data based on expected reverse ranks. For any object o, an expected reverse rank κ̄ is a weighted average of possible reverse ranks for individual instances of o with respect to different instances of a given query object q by taking their probabilities into account. We devise and present incremental κ̄ computation and two κ̄-Estimating algorithms to efficiently evaluate RR queries over imprecise data. The efficiency of our approach is demonstrated through experiments.",
author = "Lee, {Ken C.K.} and Mao Ye and Wang-chien Lee",
year = "2010",
month = "8",
day = "6",
doi = "10.1145/1823854.1823875",
language = "English (US)",
isbn = "9781450300315",
booktitle = "COM.Geo 2010 - 1st International Conference and Exhibition on Computing for Geospatial Research and Application",

}

Lee, KCK, Ye, M & Lee, W 2010, Reverse ranking query over imprecise spatial data. in COM.Geo 2010 - 1st International Conference and Exhibition on Computing for Geospatial Research and Application., 17, 1st International Conference and Exhibition on Computing for Geospatial Research and Application, COM.Geo 2010, Washington, DC, United States, 6/21/10. https://doi.org/10.1145/1823854.1823875

Reverse ranking query over imprecise spatial data. / Lee, Ken C.K.; Ye, Mao; Lee, Wang-chien.

COM.Geo 2010 - 1st International Conference and Exhibition on Computing for Geospatial Research and Application. 2010. 17.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Reverse ranking query over imprecise spatial data

AU - Lee, Ken C.K.

AU - Ye, Mao

AU - Lee, Wang-chien

PY - 2010/8/6

Y1 - 2010/8/6

N2 - The reverse rank of a (data) object o with respect to a given query object q (that measures the relative nearness of q to o) is said to be κ when q is the κ-th nearest neighbor of o in a geographical space. Based on the notion of reverse ranks, a Reverse Ranking (RR) query determines t objects with the smallest κ's with respect to a given query object q. In many situations that locations of objects and a query object can be imprecise, objects would receive multiple possible κ's. In this paper, we propose a notion of expected reverse ranks and evaluation of RR queries over imprecise data based on expected reverse ranks. For any object o, an expected reverse rank κ̄ is a weighted average of possible reverse ranks for individual instances of o with respect to different instances of a given query object q by taking their probabilities into account. We devise and present incremental κ̄ computation and two κ̄-Estimating algorithms to efficiently evaluate RR queries over imprecise data. The efficiency of our approach is demonstrated through experiments.

AB - The reverse rank of a (data) object o with respect to a given query object q (that measures the relative nearness of q to o) is said to be κ when q is the κ-th nearest neighbor of o in a geographical space. Based on the notion of reverse ranks, a Reverse Ranking (RR) query determines t objects with the smallest κ's with respect to a given query object q. In many situations that locations of objects and a query object can be imprecise, objects would receive multiple possible κ's. In this paper, we propose a notion of expected reverse ranks and evaluation of RR queries over imprecise data based on expected reverse ranks. For any object o, an expected reverse rank κ̄ is a weighted average of possible reverse ranks for individual instances of o with respect to different instances of a given query object q by taking their probabilities into account. We devise and present incremental κ̄ computation and two κ̄-Estimating algorithms to efficiently evaluate RR queries over imprecise data. The efficiency of our approach is demonstrated through experiments.

UR - http://www.scopus.com/inward/record.url?scp=77955124350&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955124350&partnerID=8YFLogxK

U2 - 10.1145/1823854.1823875

DO - 10.1145/1823854.1823875

M3 - Conference contribution

AN - SCOPUS:77955124350

SN - 9781450300315

BT - COM.Geo 2010 - 1st International Conference and Exhibition on Computing for Geospatial Research and Application

ER -

Lee KCK, Ye M, Lee W. Reverse ranking query over imprecise spatial data. In COM.Geo 2010 - 1st International Conference and Exhibition on Computing for Geospatial Research and Application. 2010. 17 https://doi.org/10.1145/1823854.1823875