On Efficient Processing of Group and Subsequent Queries for Social Activity Planning

Yi Ling Chen, De Nian Yang, Chih Ya Shen, Wang Chien Lee, Ming Syan Chen

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Three essential criteria are important for social activity planning: (1) finding attendees familiar with the initiator, (2) ensuring most attendees have tight social relations with each other, and (3) selecting an activity period available to all. In this paper, we propose the Social-Temporal Group Query (STGQ) to find suitable time and attendees with minimum total social distance. We first prove that the problem is NP-hard and inapproximable within any ratio. Next, we design two algorithms, SGSelect and STGSelect, which include effective pruning techniques to substantially reduce running time. Moreover, as users may iteratively adjust query parameters to fine tune the results, we study the problem of Subsequent Social Group Query (SSGQ). We propose the Accumulative Search Tree and Social Boundary, to cache and index intermediate results of previous queries in order to accelerate subsequent query processing. Experimental results indicate that SGSelect and STGSelect are significantly more efficient than baseline approaches. With the caching mechanisms, processing time of subsequent queries can be further reduced by 50-75 percent. We conduct a user study to compare the proposed approach with manual activity coordination. The results show that our approach obtains higher quality solutions with lower coordination effort, thereby increasing the users' willingness to organize activities.

Original languageEnglish (US)
Article number8493329
Pages (from-to)2364-2378
Number of pages15
JournalIEEE Transactions on Knowledge and Data Engineering
Volume31
Issue number12
DOIs
StatePublished - Dec 1 2019

Fingerprint

Query processing
Computational complexity
Planning
Processing

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

Chen, Yi Ling ; Yang, De Nian ; Shen, Chih Ya ; Lee, Wang Chien ; Chen, Ming Syan. / On Efficient Processing of Group and Subsequent Queries for Social Activity Planning. In: IEEE Transactions on Knowledge and Data Engineering. 2019 ; Vol. 31, No. 12. pp. 2364-2378.
@article{99dd7e0b272749079bed77df3495edeb,
title = "On Efficient Processing of Group and Subsequent Queries for Social Activity Planning",
abstract = "Three essential criteria are important for social activity planning: (1) finding attendees familiar with the initiator, (2) ensuring most attendees have tight social relations with each other, and (3) selecting an activity period available to all. In this paper, we propose the Social-Temporal Group Query (STGQ) to find suitable time and attendees with minimum total social distance. We first prove that the problem is NP-hard and inapproximable within any ratio. Next, we design two algorithms, SGSelect and STGSelect, which include effective pruning techniques to substantially reduce running time. Moreover, as users may iteratively adjust query parameters to fine tune the results, we study the problem of Subsequent Social Group Query (SSGQ). We propose the Accumulative Search Tree and Social Boundary, to cache and index intermediate results of previous queries in order to accelerate subsequent query processing. Experimental results indicate that SGSelect and STGSelect are significantly more efficient than baseline approaches. With the caching mechanisms, processing time of subsequent queries can be further reduced by 50-75 percent. We conduct a user study to compare the proposed approach with manual activity coordination. The results show that our approach obtains higher quality solutions with lower coordination effort, thereby increasing the users' willingness to organize activities.",
author = "Chen, {Yi Ling} and Yang, {De Nian} and Shen, {Chih Ya} and Lee, {Wang Chien} and Chen, {Ming Syan}",
year = "2019",
month = "12",
day = "1",
doi = "10.1109/TKDE.2018.2875911",
language = "English (US)",
volume = "31",
pages = "2364--2378",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "12",

}

On Efficient Processing of Group and Subsequent Queries for Social Activity Planning. / Chen, Yi Ling; Yang, De Nian; Shen, Chih Ya; Lee, Wang Chien; Chen, Ming Syan.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 31, No. 12, 8493329, 01.12.2019, p. 2364-2378.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On Efficient Processing of Group and Subsequent Queries for Social Activity Planning

AU - Chen, Yi Ling

AU - Yang, De Nian

AU - Shen, Chih Ya

AU - Lee, Wang Chien

AU - Chen, Ming Syan

PY - 2019/12/1

Y1 - 2019/12/1

N2 - Three essential criteria are important for social activity planning: (1) finding attendees familiar with the initiator, (2) ensuring most attendees have tight social relations with each other, and (3) selecting an activity period available to all. In this paper, we propose the Social-Temporal Group Query (STGQ) to find suitable time and attendees with minimum total social distance. We first prove that the problem is NP-hard and inapproximable within any ratio. Next, we design two algorithms, SGSelect and STGSelect, which include effective pruning techniques to substantially reduce running time. Moreover, as users may iteratively adjust query parameters to fine tune the results, we study the problem of Subsequent Social Group Query (SSGQ). We propose the Accumulative Search Tree and Social Boundary, to cache and index intermediate results of previous queries in order to accelerate subsequent query processing. Experimental results indicate that SGSelect and STGSelect are significantly more efficient than baseline approaches. With the caching mechanisms, processing time of subsequent queries can be further reduced by 50-75 percent. We conduct a user study to compare the proposed approach with manual activity coordination. The results show that our approach obtains higher quality solutions with lower coordination effort, thereby increasing the users' willingness to organize activities.

AB - Three essential criteria are important for social activity planning: (1) finding attendees familiar with the initiator, (2) ensuring most attendees have tight social relations with each other, and (3) selecting an activity period available to all. In this paper, we propose the Social-Temporal Group Query (STGQ) to find suitable time and attendees with minimum total social distance. We first prove that the problem is NP-hard and inapproximable within any ratio. Next, we design two algorithms, SGSelect and STGSelect, which include effective pruning techniques to substantially reduce running time. Moreover, as users may iteratively adjust query parameters to fine tune the results, we study the problem of Subsequent Social Group Query (SSGQ). We propose the Accumulative Search Tree and Social Boundary, to cache and index intermediate results of previous queries in order to accelerate subsequent query processing. Experimental results indicate that SGSelect and STGSelect are significantly more efficient than baseline approaches. With the caching mechanisms, processing time of subsequent queries can be further reduced by 50-75 percent. We conduct a user study to compare the proposed approach with manual activity coordination. The results show that our approach obtains higher quality solutions with lower coordination effort, thereby increasing the users' willingness to organize activities.

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

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

U2 - 10.1109/TKDE.2018.2875911

DO - 10.1109/TKDE.2018.2875911

M3 - Article

AN - SCOPUS:85055038486

VL - 31

SP - 2364

EP - 2378

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 12

M1 - 8493329

ER -