On socialtemporal group query with acquaintance constraint

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

Research output: Contribution to journalArticlepeer-review

32 Scopus citations

Abstract

Three essential criteria are important for activity planning, including: (1) finding a group of attendees familiar with the initiator, (2) ensuring each attendee in the group to have tight social relations with most of the members in the group, and (3) selecting an activity period available for all attendees. Therefore, this paper proposes Social-Temporal Group Query to find the activity time and attendees with the minimum total social distance to the initiator. Moreover, this query incorporates an acquaintance constraint to avoid finding a group with mutually unfamiliar attendees. Efficient processing of the social-temporal group query is very challenging. We show that the problem is NP-hard via a proof and formulate the problem with Integer Programming. We then propose two efficient algorithms, SGSelect and STGSelect, which include effective pruning techniques and employ the idea of pivot time slots to substantially reduce the running time, for finding the optimal solutions. Experimental results indicate that the proposed algorithms are much more efficient and scalable. In the comparison of solution quality, we show that STGSelect outperforms the algorithm that represents manual coordination by the initiator.

Original languageEnglish (US)
Pages (from-to)397-408
Number of pages12
JournalProceedings of the VLDB Endowment
Volume4
Issue number6
DOIs
StatePublished - Mar 2011

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On socialtemporal group query with acquaintance constraint'. Together they form a unique fingerprint.

Cite this