Finding Effective Geo-social Group for Impromptu Activities with Diverse Demands

摘要: Geo-social group search aims to find a of people proximate location while socially related. One the driven applications for geo-social is organizing an impromptu activity. This because social cohesiveness found ensures good communication atmosphere activity and spatial closeness reduces preparation time Most existing works treat as problem that finds satisfying single constraint optimizing proximity. However, since different activities have diverse demands on attendees, e.g. could require (or prefer) attendees skills favorites) related activity, cannot this kind groups effectively. In paper, we propose novel model, equipped with elegant keyword constraints, fill gap. We framework which first significantly narrows down space theoretical guarantees then efficiently optimum result. To evaluate effectiveness, conduct experiments real datasets, demonstrating superiority our proposed model. extensive large semi-synthetic datasets justifying efficiency algorithms.