公开(公告)号：US20150046473A1

公开(公告)日：2015-02-12

申请号：US14455384

申请日：2014-08-08

申请人： ACADEMIA SINICA

发明人： De-Nian YANG ,  Chih-Ya SHEN ,  Hong-Han SHUAI ,  Ming-Syan CHEN

IPC分类号： G06F17/30

CPC分类号： G06Q50/01 ,  G06Q10/109

摘要： A social activity planning method includes the following operation. A database storing multiple candidate invitees with their geographical locations and interest scores towards a topic, and a social graph including vertices representing the candidate invitees and edges connecting two vertices representing mutual acquaintance of the associated candidate invitees is accessed. A social activity request including an invitation number, information about a social activity, and a familiarity condition for the social activity request is received. At least one feasible solution including the invitation number of the candidate invitees and meeting the familiarity condition is generated. A group of selected invitees are found based on the feasible solution and the information about the social activity.

摘要翻译： 社会活动规划方法包括以下操作。 数据库，存储有多个候选受邀者及其与主题相关的地理位置和兴趣分数，以及包括表示候选受邀者的顶点和连接表示相关候选被邀请者相互认识的两个顶点的边缘的社交图。 收到社会活动请求，包括邀请号码，有关社会活动的信息以及社交活动请求的熟悉条件。 生成至少一个可行的解决方案，包括候选人的邀请号和满足熟悉条件。 根据可行的解决方案和有关社会活动的信息，找到一组被选中的被邀请者。