Group formation in large social networks: membership, growth, and evolution
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Harvesting with SONAR: the value of aggregating social network information
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Make new friends, but keep the old: recommending people on social networking sites
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Finding a team of experts in social networks
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Algorithms and Experiments for Clique Relaxations--Finding Maximum s-Plexes
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
A parallel algorithm for enumerating all the maximal k-plexes
PAKDD'07 Proceedings of the 2007 international conference on Emerging technologies in knowledge discovery and data mining
The community-search problem and how to plan a successful cocktail party
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Team Formation for Generalized Tasks in Expertise Social Networks
SOCIALCOM '10 Proceedings of the 2010 IEEE Second International Conference on Social Computing
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
Operations Research
Combinatorial algorithms for the maximum k-plex problem
Journal of Combinatorial Optimization
Circle of friend query in geo-social networks
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part II
On socio-spatial group query for location-based social networks
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Composing activity groups in social networks
Proceedings of the 21st ACM international conference on Information and knowledge management
Spatial-aware interest group queries in location-based social networks
Proceedings of the 21st ACM international conference on Information and knowledge management
Finding knowledgeable groups in enterprise corpora
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
| Hi-index | 0.00 |
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.