Abstract
The problem of searching radius-bounded k-cores (RB-k-cores) for a given query vertex is to find cohesive subgraphs satisfying both social and spatial constraints on geo-social networks. However, the search results are effected by two parameters: the cohesive constraint k and the query radius r. Furthermore, as the users lack of enough professional knowledge, it is very hard to provide reasonable parameters for RB-k-core searches. In this case, some users will confuse that why some expected vertices are not included in the search results, which called why-not questions. Therefore, we will investigate the problem of answering why-not questions on radius-bound k-core searches in this paper, which is to find why some expected vertices are missing in the search results and how to make the expected vertices appear in the same RB-k-cores with query vertices. To tackle this problem, we firstly analyze the effect of the two parameters on the search results of RB-k-core searches. Then, we explore two effective algorithms by refining the initial search parameters k and r of RB-k-core searches. Finally, we conduct comprehensive experimental studies on four real geo-social networks to evaluate both the effectiveness and efficiency of our proposed explanation algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chapman, A., Jagadish, H.V.: Why not ‘?’. In: SIGMOD, pp. 523–534 (2009)
Tran, Q., Chan, C.: How to ConQueR Why-not Questions. In: SIGMOD, pp. 15–26 (2010)
Yang, D., Shen, C., Lee, W., Chen, M.: On socio-spatial group query for location-based social networks. In: KDD, pp. 949–957 (2012)
Fang, Y., Cheng, R., Li, X., Luo, S., Hu, J.: Effective community search over large spatial graphs. In: PVLDB, pp. 709–720 (2017)
Wang, K., Cao, X., Lin, X., Zhang, W., Qin, L.: Efficient computing of radius-bounded k-cores. In: ICDE, pp. 233–244 (2018)
Kim, J., Guo, T., Feng, K., Cong, G., Khan, A., Choudhury, F.: Densely Connected User Community and Location Cluster Search in Location-Based Social Networks. In: SIGMOD, pp. 2199–2209 (2020)
Zhu, H., et al.: Continuous geo-social group monitoring over moving users. In: ICDE, pp. 312–324 (2022)
Chen, L., Lin, X., Hu, H., Jensen, C.S., Xu, J.L.: Answering why-not spatial keyword top-k queries via keyword adaption. In: ICDE, pp. 697–708 (2016)
Islam, M.S., Liu, C., Li, J.: Efficient answering of why-not questions in similar graph matching. In: TKDE, pp. 2672–2686 (2015)
Zong, C., et al.: Answering why-not questions on structural graph clustering. In: DASFAA, pp. 255–271 (2018)
Zong, B., et al.: Answering why-not group spatial keyword queries. In: TKDE, pp. 26–39 (2020)
Zhang, W., Li, Y., Shu, L., Luo, C., Li, J.: Shadow: answering why-not questions on top-k spatial keyword queries over moving objects. In: DASFAA, pp. 738–760 (2021)
Song, S., Huang, R., Gao, Y., Wang, J.: why not match: on explanations of event pattern queries. In: SIGMOD, pp. 1705–1717(2021)
Diestelkamper, R., Lee, S., Herschel, M., Glavic, B.: To not miss the forest for the trees - a holistic approach for explaining missing answers over nested data. In: SIGMOD, pp. 405–417 (2021)
Song, Q., Namaki, M.H., Lin, P., Wu, Y.: Answering why-questions for subgraph queries. In: TKDE, pp. 4636–4649 (2022)
Batagelj, V., Zaversnik, M.: An O(m) Algorithm for Cores Decomposition of Networks. In: cs.DS, pp. 129–145 (2003)
Acknowledgements
The work is partially supported by the National Key Research and Development Program of China (2020YFB1707901), National Natural Science Foundation of China (Nos. U22A2025, 62072088, 62232007, 62002245, 62102271, 61802268), Ten Thousand Talent Program (No. ZX20200035), Liaoning Distinguished Professor (No. XLYC1902057), Natural Science Foundation of Liaoning Province (Nos. 2022-MS-303, 2022-BS-218, 2022-MS-302).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Zong, C., Dong, Z., Yang, X., Wang, B., Qiu, T., Zhu, H. (2023). Efficiently Answering Why-Not Questions on Radius-Bounded k-Core Searches. In: Wang, X., et al. Database Systems for Advanced Applications. DASFAA 2023. Lecture Notes in Computer Science, vol 13945. Springer, Cham. https://doi.org/10.1007/978-3-031-30675-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-031-30675-4_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-30674-7
Online ISBN: 978-3-031-30675-4
eBook Packages: Computer ScienceComputer Science (R0)