{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T17:00:14Z","timestamp":1759683614207},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2011,3]]},"abstract":"<jats:p>\n            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\n            <jats:italic>Social-Temporal Group Query<\/jats:italic>\n            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,\n            <jats:italic>SGSelect<\/jats:italic>\n            and\n            <jats:italic>STGSelect<\/jats:italic>\n            , 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.\n          <\/jats:p>","DOI":"10.14778\/1978665.1978671","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"397-408","source":"Crossref","is-referenced-by-count":33,"title":["On social-temporal group query with acquaintance constraint"],"prefix":"10.14778","volume":"4","author":[{"given":"De-Nian","family":"Yang","sequence":"first","affiliation":[{"name":"Academia Sinica"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi-Ling","family":"Chen","sequence":"additional","affiliation":[{"name":"National Taiwan Univ."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang-Chien","family":"Lee","sequence":"additional","affiliation":[{"name":"The Penn State Univ."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming-Syan","family":"Chen","sequence":"additional","affiliation":[{"name":"National Taiwan Univ."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,3]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"The Events function of the Facebook website. http:\/\/www.facebook.com\/?sk=events.  The Events function of the Facebook website. http:\/\/www.facebook.com\/?sk=events."},{"key":"e_1_2_1_2_1","unstructured":"The Facebook website. http:\/\/www.facebook.com\/.  The Facebook website. http:\/\/www.facebook.com\/."},{"key":"e_1_2_1_3_1","unstructured":"The Google Calendar website. http:\/\/www.google.com\/calendar\/.  The Google Calendar website. http:\/\/www.google.com\/calendar\/."},{"key":"e_1_2_1_4_1","unstructured":"IBM ILOG CPLEX Optimizer. http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/.  IBM ILOG CPLEX Optimizer. http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/."},{"key":"e_1_2_1_5_1","unstructured":"The LinkedIn website. http:\/\/www.linkedin.com\/.  The LinkedIn website. http:\/\/www.linkedin.com\/."},{"key":"e_1_2_1_6_1","unstructured":"The Meetup website. http:\/\/www.meetup.com\/.  The Meetup website. http:\/\/www.meetup.com\/."},{"key":"e_1_2_1_7_1","unstructured":"Network Data. http:\/\/www-personal.umich.edu\/~mejn\/netdata\/.  Network Data. http:\/\/www-personal.umich.edu\/~mejn\/netdata\/."},{"key":"e_1_2_1_8_1","unstructured":"The statistics from Facebook website. http:\/\/www.facebook.com\/press\/info.php?statistics.  The statistics from Facebook website. http:\/\/www.facebook.com\/press\/info.php?statistics."},{"key":"e_1_2_1_9_1","unstructured":"The Yahoo Movie website. http:\/\/movies.yahoo.com\/.  The Yahoo Movie website. http:\/\/movies.yahoo.com\/."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1100.0851"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1518701.1518735"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1357054.1357212"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557074"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2010.12"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-010-9338-2"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00139635"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02011-7_22"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1978.9989883"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1780582.1780632"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1978665.1978671","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:19:23Z","timestamp":1672222763000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1978665.1978671"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["10.14778\/1978665.1978671"],"URL":"https:\/\/doi.org\/10.14778\/1978665.1978671","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}