Top-k Socio-Spatial Co-Engaged Location Selection for Social Users

With the advent of location-based social networks, users can tag their daily activities in different locations through check-ins. These check-in locations signify user preferences for various socio-spatial activities and can be used to improve the quality of services in some applications such as rec...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on knowledge and data engineering Ročník 35; číslo 5; s. 5325 - 5340
Hlavní autoři: Haldar, Nur Al Hasan, Li, Jianxin, Ali, Mohammed Eunus, Cai, Taotao, Chen, Yunliang, Sellis, Timos, Reynolds, Mark
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.05.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Advertising
Algorithms
Australia
Cultural differences
Datasets
Elections
Exact solutions
Heuristic methods
LBSN
Location based services
location selection in social networks
Organizations
Recommender systems
Social factors
social graph computing
Social networking (online)
Social networks
spatial database
Spatial databases
ISSN:1041-4347, 1558-2191
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:With the advent of location-based social networks, users can tag their daily activities in different locations through check-ins. These check-in locations signify user preferences for various socio-spatial activities and can be used to improve the quality of services in some applications such as recommendation systems, advertising, and group formation. To support such applications, in this paper, we formulate a new problem of identifying top-k S ocio- S patial co-engaged L ocation S election ( SSLS ) for users in a social graph, that selects the best set of <inline-formula><tex-math notation="LaTeX">k</tex-math> <mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href="li-ieq2-3151095.gif"/> </inline-formula> locations from a large number of location candidates relating to the user and her friends. The selected locations should be (i) spatially and socially relevant to the user and her friends, and (ii) diversified both spatially and socially to maximize the coverage of friends in the socio-spatial space. This problem has been proved as NP-hard. To address such a challenging problem, we first develop an Exact solution by designing some pruning strategies based on derived bounds on diversity. To make the solution scalable for large datasets, we also develop an approximate solution by deriving relaxed bounds and advanced termination rules to filter out insignificant intermediate results. To further accelerate the efficiency, we present one fast exact approach and a meta-heuristic approximate approach by avoiding the repeated computation of diversity at the running time. Finally, we have performed extensive experiments to evaluate the performance of our proposed algorithms against three adapted existing methods using four large real-world datasets.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1041-4347
1558-2191
DOI:10.1109/TKDE.2022.3151095