Topic-based Community Search over Spatial-Social Networks (Technical Report)
Ahmed Al-Baghdadi, Xiang Lian

TL;DR
This paper introduces a new community search problem over spatial-social networks that considers social influence, travel time, and keywords, providing efficient algorithms and indexing for practical applications.
Contribution
It formulates the TCS-SSN problem, proposes pruning techniques, a novel social-spatial index, and an efficient query algorithm for community search in spatial-social networks.
Findings
Pruning techniques significantly reduce search space.
The social-spatial index improves query efficiency.
Experimental results validate effectiveness on real and synthetic data.
Abstract
Recently, the community search problem has attracted significant attention, due to its wide spectrum of real-world applications such as event organization, friend recommendation, advertisement in e-commence, and so on. Given a query vertex, the community search problem finds dense subgraph that contains the query vertex. In social networks, users have multiple check-in locations, influence score, and profile information (keywords). Most previous studies that solve the CS problem over social networks usually neglect such information in a community. In this paper, we propose a novel problem, named community search over spatial-social networks (TCS-SSN), which retrieves community with high social influence, small traveling time, and covering certain keywords. In order to tackle the TCS-SSN problem over the spatial-social networks, we design effective pruning techniques to reduce the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Complex Network Analysis Techniques · Recommender Systems and Techniques
