TY - JOUR
T1 - Cohesive Group Nearest Neighbor Queries on Road-Social Networks under Multi-Criteria
AU - Guo, Fangda
AU - Yuan, Ye
AU - Wang, Guoren
AU - Chen, Lei
AU - Lian, Xiang
AU - Wang, Zimeng
N1 - Publisher Copyright:
© 1989-2012 IEEE.
PY - 2021/11/1
Y1 - 2021/11/1
N2 - The group nearest neighbor (GNN) search on a road network G_rGr, i.e., finding the spatial objects as activity assembly points with the smallest sum of distances to query users on G_rGr, has been extensively studied; however, previous works neglected the fact that social relationships among query users, which ensure the maximally favorable atmosphere in the activity, can play an important role in GNN queries. Meanwhile, the ratings of spatial objects can also be used as recommended guidelines. Many real-world applications, such as location-based social networking services, require such queries. In this paper, we study two new problems: (1) a GNN search on a road network that incorporates cohesive social relationships (CGNN) and (2) a CGNN query under multi-criteria (MCGNN). Specifically, both the query users of highest closeness and the corresponding top-jj objects are retrieved. To address critical challenges on the effectiveness of results and the efficiency of computation over large road-social networks: (1) for CGNN, we propose a filtering-and-verification framework. During filtering, we prune substantial unpromising users and objects using social and geospatial constraints. During verification, we obtain the object candidates, among which the top jj are selected, with respect to the qualified users; (2) for MCGNN, we propose threshold-based selection and expansion strategies, where different strict boundaries are proposed to ensure that correct top-jj objects are found early. Moreover, we further optimize search strategies to improve query performance. Finally, experimental results on real social and road networks significantly demonstrate the efficiency and efficacy of our solutions.
AB - The group nearest neighbor (GNN) search on a road network G_rGr, i.e., finding the spatial objects as activity assembly points with the smallest sum of distances to query users on G_rGr, has been extensively studied; however, previous works neglected the fact that social relationships among query users, which ensure the maximally favorable atmosphere in the activity, can play an important role in GNN queries. Meanwhile, the ratings of spatial objects can also be used as recommended guidelines. Many real-world applications, such as location-based social networking services, require such queries. In this paper, we study two new problems: (1) a GNN search on a road network that incorporates cohesive social relationships (CGNN) and (2) a CGNN query under multi-criteria (MCGNN). Specifically, both the query users of highest closeness and the corresponding top-jj objects are retrieved. To address critical challenges on the effectiveness of results and the efficiency of computation over large road-social networks: (1) for CGNN, we propose a filtering-and-verification framework. During filtering, we prune substantial unpromising users and objects using social and geospatial constraints. During verification, we obtain the object candidates, among which the top jj are selected, with respect to the qualified users; (2) for MCGNN, we propose threshold-based selection and expansion strategies, where different strict boundaries are proposed to ensure that correct top-jj objects are found early. Moreover, we further optimize search strategies to improve query performance. Finally, experimental results on real social and road networks significantly demonstrate the efficiency and efficacy of our solutions.
KW - GNN query
KW - Query processing
KW - graph algorithm
KW - k -core
KW - road network
KW - social network
UR - https://www.scopus.com/pages/publications/85116943496
U2 - 10.1109/TKDE.2020.2974943
DO - 10.1109/TKDE.2020.2974943
M3 - Article
AN - SCOPUS:85116943496
SN - 1041-4347
VL - 33
SP - 3520
EP - 3536
JO - IEEE Transactions on Knowledge and Data Engineering
JF - IEEE Transactions on Knowledge and Data Engineering
IS - 11
ER -