Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/94418
PIRA download icon_1.1View/Download Full Text
Title: Where to : crowd-aided path selection by Selective Bayesian Network
Authors: Zhang, C 
Zhang, H
Xie, W
Liu, N
Wu, K
Chen, L
Issue Date: 1-Jan-2023
Source: IEEE transactions on knowledge and data engineering, 1 Jan. 2023. v. 35, no. 1, p. 1072-1087
Abstract: With the wide usage of geo-positioning services (GPS), GPS-based navigation systems have become more and more of an integral part of people’s daily lives. GPS-based navigation systems usually suggest multiple paths for a pair of given source and target. Therefore, users become perplexed when trying to select the best one among them, namely the problem of best path selection. Too many suggested paths may jeopardize the usability of the recommendation data, and decrease user satisfaction. Although the existing studies have already partially relieved this problem through integrating historical traffic logs or updating traffic conditions periodically, their solutions neglect the potential contribution of human experiences. In this paper, we resort to crowdsourcing to ease the pain of best path selection. However, the first step of using the crowd is to ask the right questions. For best path selection problem, the simple questions (e.g. binary voting) on crowdsourcing platforms cannot be directly applied to road networks. Thus, in this paper, we have made the first contribution by designing two right types of questions, namely Routing Query (RQ) to ask the crowd to decide the direction at each road intersection. Secondly, we propose a series of efficient algorithms to dynamically manage the questions in order to reduce the selection hardness within a limited budget. In particular, we show that there are two factors affecting the informativeness of a question: the randomness (entropy) of the question and the structural position of the road intersection. Furthermore, we extend the framework to enable multiple RQs per round. To ease the pain of the sample sensitiveness, we propose a new approach to reduce the selection hardness by reasoning on a so-called Selective Bayesian network. We compare our approach against several baselines, and the effectiveness and efficiency of our proposal are verified by the results in simulations and experiments on real-world datasets. The experimental results show that, even the Selective Bayesian Network provides only partial information of causality, the performance on the reduction of the selection hardness are dramatically improved, especially when the size of samples are relatively small.
Keywords: Crowdsourcing
Approximation algorithm
Path selection
Publisher: Institute of Electrical and Electronics Engineers
Journal: IEEE transactions on knowledge and data engineering 
ISSN: 1041-4347
EISSN: 1558-2191
DOI: 10.1109/TKDE.2021.3078833
Rights: © 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
The following publication C. Zhang, H. Zhang, W. Xie, N. Liu, K. Wu and L. Chen, "Where to: Crowd-Aided Path Selection by Selective Bayesian Network," in IEEE Transactions on Knowledge and Data Engineering, vol. 35, no. 1, pp. 1072-1087, 1 Jan. 2023 is available at https://dx.doi.org/10.1109/TKDE.2021.3078833.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
Zhang_Where_To_Crowd-Aided.pdfPre-Published version3.75 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

70
Last Week
1
Last month
Citations as of Apr 21, 2024

Downloads

1
Citations as of Apr 21, 2024

SCOPUSTM   
Citations

1
Citations as of Apr 19, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.