Publications-Proceedings

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 Composing activity groups in social networks
作者 Li, C.-T.;Shan, Man-Kwan
沈錳坤
貢獻者 資科系
關鍵詞 Cocktail party; Group formations; Group members; Group size; Networking services; Social Networks; Study Groups; Approximation algorithms;
日期 2012
上傳時間 11-Jun-2015 14:24:07 (UTC+8)
摘要 One important function of current social networking services is allowing users to initialize different kinds of activity groups (e.g. study group, cocktail party, and group buying) and invite friends to attend in either manual or collaborative manners. However, such process of group formation is tedious, and could either include inappropriate group members or miss relevant ones. This work proposes to automatically compose the activity groups in a social network according to user-specified activity information. Given the activity host, a set of labels representing the activity`s subjects, the desired group size, and a set of must-inclusive persons, we aim to find a set of individuals as the activity group, in which members are required to not only be familiar with the host but also have great communications with each other. We devise an approximation algorithm to greedily solve the group composing problem. Experiments on a real social network show the promising effectiveness of the proposed approach as well as the satisfactory human subjective study. © 2012 ACM.
關聯 ACM International Conference Proceeding SeriesKnowledge management; Social networking (online);CIKM 2012; Maui, HI; United States; 29 October 2012 through 2 November 2012; Code 94401
資料類型 conference
DOI http://dx.doi.org/10.1145/2396761.2398644
dc.contributor 資科系
dc.creator (作者) Li, C.-T.;Shan, Man-Kwan
dc.creator (作者) 沈錳坤zh_TW
dc.date (日期) 2012
dc.date.accessioned 11-Jun-2015 14:24:07 (UTC+8)-
dc.date.available 11-Jun-2015 14:24:07 (UTC+8)-
dc.date.issued (上傳時間) 11-Jun-2015 14:24:07 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/75693-
dc.description.abstract (摘要) One important function of current social networking services is allowing users to initialize different kinds of activity groups (e.g. study group, cocktail party, and group buying) and invite friends to attend in either manual or collaborative manners. However, such process of group formation is tedious, and could either include inappropriate group members or miss relevant ones. This work proposes to automatically compose the activity groups in a social network according to user-specified activity information. Given the activity host, a set of labels representing the activity`s subjects, the desired group size, and a set of must-inclusive persons, we aim to find a set of individuals as the activity group, in which members are required to not only be familiar with the host but also have great communications with each other. We devise an approximation algorithm to greedily solve the group composing problem. Experiments on a real social network show the promising effectiveness of the proposed approach as well as the satisfactory human subjective study. © 2012 ACM.
dc.format.extent 176 bytes-
dc.format.mimetype text/html-
dc.relation (關聯) ACM International Conference Proceeding SeriesKnowledge management; Social networking (online);CIKM 2012; Maui, HI; United States; 29 October 2012 through 2 November 2012; Code 94401
dc.subject (關鍵詞) Cocktail party; Group formations; Group members; Group size; Networking services; Social Networks; Study Groups; Approximation algorithms;
dc.title (題名) Composing activity groups in social networks
dc.type (資料類型) conferenceen
dc.identifier.doi (DOI) 10.1145/2396761.2398644
dc.doi.uri (DOI) http://dx.doi.org/10.1145/2396761.2398644