Geo-social group queries with minimum acquaintance constraints

Qijun Zhu, Haibo Hu, Cheng Xu, Jianliang Xu, Wang-chien Lee

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

The prosperity of location-based social networking has paved the way for new applications of group-based activity planning and marketing. While such applications heavily rely on geo-social group queries (GSGQs), existing studies fail to produce a cohesive group in terms of user acquaintance. In this paper, we propose a new family of GSGQs with minimum acquaintance constraints. They are more appealing to users as they guarantee a worst-case acquaintance level in the result group. For efficient processing of GSGQs on large location-based social networks, we devise two social-aware spatial index structures, namely SaR-tree and SaR*-tree. The latter improves on the former by considering both spatial and social distances when clustering objects. Based on SaR-tree and SaR*-tree, novel algorithms are developed to process various GSGQs. Extensive experiments on real datasets Gowalla and Twitter show that our proposed methods substantially outperform the baseline algorithms under various system settings.

Original languageEnglish (US)
Pages (from-to)709-727
Number of pages19
JournalVLDB Journal
Volume26
Issue number5
DOIs
StatePublished - Oct 1 2017

Fingerprint

Marketing
Planning
Processing
Experiments

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Hardware and Architecture

Cite this

Zhu, Qijun ; Hu, Haibo ; Xu, Cheng ; Xu, Jianliang ; Lee, Wang-chien. / Geo-social group queries with minimum acquaintance constraints. In: VLDB Journal. 2017 ; Vol. 26, No. 5. pp. 709-727.
@article{13efb77490764c3cbab6909dc41beee9,
title = "Geo-social group queries with minimum acquaintance constraints",
abstract = "The prosperity of location-based social networking has paved the way for new applications of group-based activity planning and marketing. While such applications heavily rely on geo-social group queries (GSGQs), existing studies fail to produce a cohesive group in terms of user acquaintance. In this paper, we propose a new family of GSGQs with minimum acquaintance constraints. They are more appealing to users as they guarantee a worst-case acquaintance level in the result group. For efficient processing of GSGQs on large location-based social networks, we devise two social-aware spatial index structures, namely SaR-tree and SaR*-tree. The latter improves on the former by considering both spatial and social distances when clustering objects. Based on SaR-tree and SaR*-tree, novel algorithms are developed to process various GSGQs. Extensive experiments on real datasets Gowalla and Twitter show that our proposed methods substantially outperform the baseline algorithms under various system settings.",
author = "Qijun Zhu and Haibo Hu and Cheng Xu and Jianliang Xu and Wang-chien Lee",
year = "2017",
month = "10",
day = "1",
doi = "10.1007/s00778-017-0473-6",
language = "English (US)",
volume = "26",
pages = "709--727",
journal = "VLDB Journal",
issn = "1066-8888",
publisher = "Springer New York",
number = "5",

}

Geo-social group queries with minimum acquaintance constraints. / Zhu, Qijun; Hu, Haibo; Xu, Cheng; Xu, Jianliang; Lee, Wang-chien.

In: VLDB Journal, Vol. 26, No. 5, 01.10.2017, p. 709-727.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Geo-social group queries with minimum acquaintance constraints

AU - Zhu, Qijun

AU - Hu, Haibo

AU - Xu, Cheng

AU - Xu, Jianliang

AU - Lee, Wang-chien

PY - 2017/10/1

Y1 - 2017/10/1

N2 - The prosperity of location-based social networking has paved the way for new applications of group-based activity planning and marketing. While such applications heavily rely on geo-social group queries (GSGQs), existing studies fail to produce a cohesive group in terms of user acquaintance. In this paper, we propose a new family of GSGQs with minimum acquaintance constraints. They are more appealing to users as they guarantee a worst-case acquaintance level in the result group. For efficient processing of GSGQs on large location-based social networks, we devise two social-aware spatial index structures, namely SaR-tree and SaR*-tree. The latter improves on the former by considering both spatial and social distances when clustering objects. Based on SaR-tree and SaR*-tree, novel algorithms are developed to process various GSGQs. Extensive experiments on real datasets Gowalla and Twitter show that our proposed methods substantially outperform the baseline algorithms under various system settings.

AB - The prosperity of location-based social networking has paved the way for new applications of group-based activity planning and marketing. While such applications heavily rely on geo-social group queries (GSGQs), existing studies fail to produce a cohesive group in terms of user acquaintance. In this paper, we propose a new family of GSGQs with minimum acquaintance constraints. They are more appealing to users as they guarantee a worst-case acquaintance level in the result group. For efficient processing of GSGQs on large location-based social networks, we devise two social-aware spatial index structures, namely SaR-tree and SaR*-tree. The latter improves on the former by considering both spatial and social distances when clustering objects. Based on SaR-tree and SaR*-tree, novel algorithms are developed to process various GSGQs. Extensive experiments on real datasets Gowalla and Twitter show that our proposed methods substantially outperform the baseline algorithms under various system settings.

UR - http://www.scopus.com/inward/record.url?scp=85025074137&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85025074137&partnerID=8YFLogxK

U2 - 10.1007/s00778-017-0473-6

DO - 10.1007/s00778-017-0473-6

M3 - Article

AN - SCOPUS:85025074137

VL - 26

SP - 709

EP - 727

JO - VLDB Journal

JF - VLDB Journal

SN - 1066-8888

IS - 5

ER -