k-nearest reliable neighbor search in crowdsourced LBSs

Hong Jun Jang, Byoungwook Kim, Soon Young Jung

Research output: Contribution to journalArticle

Abstract

To improve the quality of spatial information in a location-based services (LBS), crowdsourced LBS (cLBS) applications that receive additional information such as the visit time of static spatial objects from users have appeared. In this paper, we propose a new type of nearest neighbor (NN) query called the k-nearest reliable neighbor (kNRN) query, which searches for objects that are likely to exist. Suppose that in cLBSs, the user wants to find a restaurant that is likely to exist and is close to the user. In such a case, a kNRN query is highly recommended. In this paper, we formally define a data model in cLBSs and define reliable objects and a kNRN problem. As a brute-force approach to this problem in a massive dataset that has large computational and I/O costs, we propose a 3DR-tree-based baseline algorithm, 2DR-tree-based incremental algorithm, and an a3DR-tree-based branch-and-bound algorithm for kNRN queries. A performance study is conducted on both synthetic and real datasets. Our experimental results show the efficiency of our proposed methods.

Original languageEnglish
Article numbere4097
JournalInternational Journal of Communication Systems
DOIs
Publication statusAccepted/In press - 2019 Jan 1

Fingerprint

Location based services
Trees (mathematics)
Data structures
Nearest neighbor search
Costs

Keywords

  • k-nearest reliable neighbor query
  • location-based services
  • nearest neighbor query
  • spatial databases
  • spatio-temporal databases

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

k-nearest reliable neighbor search in crowdsourced LBSs. / Jang, Hong Jun; Kim, Byoungwook; Jung, Soon Young.

In: International Journal of Communication Systems, 01.01.2019.

Research output: Contribution to journalArticle

@article{cbfc10dd3a904a0793628f2ab3533771,
title = "k-nearest reliable neighbor search in crowdsourced LBSs",
abstract = "To improve the quality of spatial information in a location-based services (LBS), crowdsourced LBS (cLBS) applications that receive additional information such as the visit time of static spatial objects from users have appeared. In this paper, we propose a new type of nearest neighbor (NN) query called the k-nearest reliable neighbor (kNRN) query, which searches for objects that are likely to exist. Suppose that in cLBSs, the user wants to find a restaurant that is likely to exist and is close to the user. In such a case, a kNRN query is highly recommended. In this paper, we formally define a data model in cLBSs and define reliable objects and a kNRN problem. As a brute-force approach to this problem in a massive dataset that has large computational and I/O costs, we propose a 3DR-tree-based baseline algorithm, 2DR-tree-based incremental algorithm, and an a3DR-tree-based branch-and-bound algorithm for kNRN queries. A performance study is conducted on both synthetic and real datasets. Our experimental results show the efficiency of our proposed methods.",
keywords = "k-nearest reliable neighbor query, location-based services, nearest neighbor query, spatial databases, spatio-temporal databases",
author = "Jang, {Hong Jun} and Byoungwook Kim and Jung, {Soon Young}",
year = "2019",
month = "1",
day = "1",
doi = "10.1002/dac.4097",
language = "English",
journal = "International Journal of Communication Systems",
issn = "1074-5351",
publisher = "John Wiley and Sons Ltd",

}

TY - JOUR

T1 - k-nearest reliable neighbor search in crowdsourced LBSs

AU - Jang, Hong Jun

AU - Kim, Byoungwook

AU - Jung, Soon Young

PY - 2019/1/1

Y1 - 2019/1/1

N2 - To improve the quality of spatial information in a location-based services (LBS), crowdsourced LBS (cLBS) applications that receive additional information such as the visit time of static spatial objects from users have appeared. In this paper, we propose a new type of nearest neighbor (NN) query called the k-nearest reliable neighbor (kNRN) query, which searches for objects that are likely to exist. Suppose that in cLBSs, the user wants to find a restaurant that is likely to exist and is close to the user. In such a case, a kNRN query is highly recommended. In this paper, we formally define a data model in cLBSs and define reliable objects and a kNRN problem. As a brute-force approach to this problem in a massive dataset that has large computational and I/O costs, we propose a 3DR-tree-based baseline algorithm, 2DR-tree-based incremental algorithm, and an a3DR-tree-based branch-and-bound algorithm for kNRN queries. A performance study is conducted on both synthetic and real datasets. Our experimental results show the efficiency of our proposed methods.

AB - To improve the quality of spatial information in a location-based services (LBS), crowdsourced LBS (cLBS) applications that receive additional information such as the visit time of static spatial objects from users have appeared. In this paper, we propose a new type of nearest neighbor (NN) query called the k-nearest reliable neighbor (kNRN) query, which searches for objects that are likely to exist. Suppose that in cLBSs, the user wants to find a restaurant that is likely to exist and is close to the user. In such a case, a kNRN query is highly recommended. In this paper, we formally define a data model in cLBSs and define reliable objects and a kNRN problem. As a brute-force approach to this problem in a massive dataset that has large computational and I/O costs, we propose a 3DR-tree-based baseline algorithm, 2DR-tree-based incremental algorithm, and an a3DR-tree-based branch-and-bound algorithm for kNRN queries. A performance study is conducted on both synthetic and real datasets. Our experimental results show the efficiency of our proposed methods.

KW - k-nearest reliable neighbor query

KW - location-based services

KW - nearest neighbor query

KW - spatial databases

KW - spatio-temporal databases

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

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

U2 - 10.1002/dac.4097

DO - 10.1002/dac.4097

M3 - Article

AN - SCOPUS:85071504147

JO - International Journal of Communication Systems

JF - International Journal of Communication Systems

SN - 1074-5351

M1 - e4097

ER -