Computer Science – Social and Information Networks
Scientific paper
2011-04-16
Proceedings of the VLDB Endowment (PVLDB), Vol. 4, No. 6, pp. 397-408 (2011)
Computer Science
Social and Information Networks
VLDB2011
Scientific paper
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.
Chen Ming-Syan
Chen Yi-Ling
Lee Wang-Chien
Yang De-Nian
No associations
LandOfFree
On Social-Temporal Group Query with Acquaintance Constraint does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Social-Temporal Group Query with Acquaintance Constraint, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Social-Temporal Group Query with Acquaintance Constraint will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-347018