Crawling Hidden Objects with kNN Queries

Hui Yan, Zhiguo Gong, Nan Zhang, Tao Huang, Hua Zhong, Jun Wei

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Many websites offering Location Based Services (LBS) provide a k NN search interface that returns the top-k nearest-neighbor objects (e.g., nearest restaurants) for a given query location. This paper addresses the problem of crawling all objects efficiently from an LBS website, through the public k NN web search interface it provides. Specifically, we develop crawling algorithm for 2D and higher-dimensional spaces, respectively, and demonstrate through theoretical analysis that the overhead of our algorithms can be bounded by a function of the number of dimensions and the number of crawled objects, regardless of the underlying distributions of the objects. We also extend the algorithms to leverage scenarios where certain auxiliary information about the underlying data distribution, e.g., the population density of an area which is often positively correlated with the density of LBS objects, is available. Extensive experiments on real-world datasets demonstrate the superiority of our algorithms over the state-of-the-art competitors in the literature.

Original languageEnglish (US)
Article number7335622
Pages (from-to)912-924
Number of pages13
JournalIEEE Transactions on Knowledge and Data Engineering
Volume28
Issue number4
DOIs
StatePublished - Apr 1 2016

Fingerprint

Location based services
Websites
World Wide Web
Experiments

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

Yan, H., Gong, Z., Zhang, N., Huang, T., Zhong, H., & Wei, J. (2016). Crawling Hidden Objects with kNN Queries. IEEE Transactions on Knowledge and Data Engineering, 28(4), 912-924. [7335622]. https://doi.org/10.1109/TKDE.2015.2502947
Yan, Hui ; Gong, Zhiguo ; Zhang, Nan ; Huang, Tao ; Zhong, Hua ; Wei, Jun. / Crawling Hidden Objects with kNN Queries. In: IEEE Transactions on Knowledge and Data Engineering. 2016 ; Vol. 28, No. 4. pp. 912-924.
@article{5ab74c24af2d4cd1a6c842c553140548,
title = "Crawling Hidden Objects with kNN Queries",
abstract = "Many websites offering Location Based Services (LBS) provide a k NN search interface that returns the top-k nearest-neighbor objects (e.g., nearest restaurants) for a given query location. This paper addresses the problem of crawling all objects efficiently from an LBS website, through the public k NN web search interface it provides. Specifically, we develop crawling algorithm for 2D and higher-dimensional spaces, respectively, and demonstrate through theoretical analysis that the overhead of our algorithms can be bounded by a function of the number of dimensions and the number of crawled objects, regardless of the underlying distributions of the objects. We also extend the algorithms to leverage scenarios where certain auxiliary information about the underlying data distribution, e.g., the population density of an area which is often positively correlated with the density of LBS objects, is available. Extensive experiments on real-world datasets demonstrate the superiority of our algorithms over the state-of-the-art competitors in the literature.",
author = "Hui Yan and Zhiguo Gong and Nan Zhang and Tao Huang and Hua Zhong and Jun Wei",
year = "2016",
month = "4",
day = "1",
doi = "10.1109/TKDE.2015.2502947",
language = "English (US)",
volume = "28",
pages = "912--924",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "4",

}

Yan, H, Gong, Z, Zhang, N, Huang, T, Zhong, H & Wei, J 2016, 'Crawling Hidden Objects with kNN Queries', IEEE Transactions on Knowledge and Data Engineering, vol. 28, no. 4, 7335622, pp. 912-924. https://doi.org/10.1109/TKDE.2015.2502947

Crawling Hidden Objects with kNN Queries. / Yan, Hui; Gong, Zhiguo; Zhang, Nan; Huang, Tao; Zhong, Hua; Wei, Jun.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 28, No. 4, 7335622, 01.04.2016, p. 912-924.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Crawling Hidden Objects with kNN Queries

AU - Yan, Hui

AU - Gong, Zhiguo

AU - Zhang, Nan

AU - Huang, Tao

AU - Zhong, Hua

AU - Wei, Jun

PY - 2016/4/1

Y1 - 2016/4/1

N2 - Many websites offering Location Based Services (LBS) provide a k NN search interface that returns the top-k nearest-neighbor objects (e.g., nearest restaurants) for a given query location. This paper addresses the problem of crawling all objects efficiently from an LBS website, through the public k NN web search interface it provides. Specifically, we develop crawling algorithm for 2D and higher-dimensional spaces, respectively, and demonstrate through theoretical analysis that the overhead of our algorithms can be bounded by a function of the number of dimensions and the number of crawled objects, regardless of the underlying distributions of the objects. We also extend the algorithms to leverage scenarios where certain auxiliary information about the underlying data distribution, e.g., the population density of an area which is often positively correlated with the density of LBS objects, is available. Extensive experiments on real-world datasets demonstrate the superiority of our algorithms over the state-of-the-art competitors in the literature.

AB - Many websites offering Location Based Services (LBS) provide a k NN search interface that returns the top-k nearest-neighbor objects (e.g., nearest restaurants) for a given query location. This paper addresses the problem of crawling all objects efficiently from an LBS website, through the public k NN web search interface it provides. Specifically, we develop crawling algorithm for 2D and higher-dimensional spaces, respectively, and demonstrate through theoretical analysis that the overhead of our algorithms can be bounded by a function of the number of dimensions and the number of crawled objects, regardless of the underlying distributions of the objects. We also extend the algorithms to leverage scenarios where certain auxiliary information about the underlying data distribution, e.g., the population density of an area which is often positively correlated with the density of LBS objects, is available. Extensive experiments on real-world datasets demonstrate the superiority of our algorithms over the state-of-the-art competitors in the literature.

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

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

U2 - 10.1109/TKDE.2015.2502947

DO - 10.1109/TKDE.2015.2502947

M3 - Article

AN - SCOPUS:84963781075

VL - 28

SP - 912

EP - 924

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 4

M1 - 7335622

ER -

Yan H, Gong Z, Zhang N, Huang T, Zhong H, Wei J. Crawling Hidden Objects with kNN Queries. IEEE Transactions on Knowledge and Data Engineering. 2016 Apr 1;28(4):912-924. 7335622. https://doi.org/10.1109/TKDE.2015.2502947