A survey of community search over big graphs

Y Fang, X Huang, L Qin, Y Zhang, W Zhang, R Cheng… - The VLDB Journal, 2020 - Springer
With the rapid development of information technologies, various big graphs are prevalent in
many real applications (eg, social media and knowledge bases). An important component of …

Learned index for spatial queries

H Wang, X Fu, J Xu, H Lu - 2019 20th IEEE International …, 2019 - ieeexplore.ieee.org
With the pervasiveness of location-based services (LBS), spatial data processing has
received considerable attention in the research of database system management. Among …

When engagement meets similarity: efficient (k, r)-core computation on social networks

F Zhang, Y Zhang, L Qin, W Zhang, X Lin - arXiv preprint arXiv:1611.03254, 2016 - arxiv.org
In this paper, we investigate the problem of (k, r)-core which intends to find cohesive
subgraphs on social networks considering both user engagement and similarity …

Truss-based community search over large directed graphs

Q Liu, M Zhao, X Huang, J Xu, Y Gao - Proceedings of the 2020 ACM …, 2020 - dl.acm.org
Community search enables personalized community discovery and has wide applications in
large real-world graphs. While community search has been extensively studied for …

VAC: vertex-centric attributed community search

Q Liu, Y Zhu, M Zhao, X Huang, J Xu… - 2020 IEEE 36th …, 2020 - ieeexplore.ieee.org
Attributed community search aims to find the community with strong structure and attribute
cohesiveness from attributed graphs. However, existing works suffer from two major …

Efficient computing of radius-bounded k-cores

K Wang, X Cao, X Lin, W Zhang… - 2018 IEEE 34th …, 2018 - ieeexplore.ieee.org
Driven by real-life applications in geo-social networks, in this paper, we investigate the
problem of computing the radius-bounded k-cores (RB-k-cores) that aims to find cohesive …

Efficient size-bounded community search over large networks

K Yao, L Chang - Proceedings of the VLDB Endowment, 2021 - dl.acm.org
The problem of community search, which aims to find a cohesive subgraph containing user-
given query vertices, has been extensively studied recently. Most of the existing studies …

Location-based social network data generation based on patterns of life

JS Kim, H Jin, H Kavak, OC Rouly… - 2020 21st IEEE …, 2020 - ieeexplore.ieee.org
Location-based social networks (LBSNs) have been studied extensively in recent years.
However, utilizing real-world LBSN data sets yields several weaknesses: sparse and small …

Cs-mlgcn: Multiplex graph convolutional networks for community search in multiplex networks

A Behrouz, F Hashemi - Proceedings of the 31st ACM International …, 2022 - dl.acm.org
Community Search (CS) is one of the fundamental tasks in network science and has
attracted much attention due to its ability to discover personalized communities with a wide …

Community search over big graphs: Models, algorithms, and opportunities

X Huang, LVS Lakshmanan, J Xu - 2017 IEEE 33rd …, 2017 - ieeexplore.ieee.org
Communities serve as basic structures for understanding the organization of many real-
world networks, such as social, biological, collaboration, and communication networks …