On Social-Temporal Group Query with Acquaintance Constraint

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. E...

• Type: Journal
• Year: 2011
• Where: CORR
• Authors: De-Nian Yang, Yi-Ling Chen, Wang-Chien Lee, Ming-Syan Chen
• Keywords: CORR 2011, Education, Group, Pivot Time Slots, Social-temporal Group Query