{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T08:45:12Z","timestamp":1776588312441,"version":"3.51.2"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2018,10]]},"abstract":"<jats:p>\n            A socio spatial group query finds a group of users who possess strong social connections with each other and have the minimum aggregate spatial distance to a meeting point. Existing studies limit to either finding the best group of\n            <jats:italic>a fixed size<\/jats:italic>\n            for a single meeting location, or a single group of a fixed size w.r.t. multiple locations. However, it is highly desirable to consider multiple locations in a real-life scenario in order to organize impromptu activities of\n            <jats:italic>groups of various sizes.<\/jats:italic>\n            In this paper, we propose\n            <jats:italic>Top k Flexible Socio Spatial Group Query (Top k-FSSGQ)<\/jats:italic>\n            to find the top\n            <jats:italic>k<\/jats:italic>\n            groups w.r.t. multiple POIs where each group follows the minimum social connectivity constraints. We devise a ranking function to measure the group score by combining social closeness, spatial distance, and group size, which provides the flexibility of choosing groups of different sizes under different constraints. To effectively process the\n            <jats:italic>Top k-FSSGQ,<\/jats:italic>\n            we first develop an\n            <jats:italic>Exact<\/jats:italic>\n            approach that ensures early termination of the search based on the derived\n            <jats:italic>upper bounds.<\/jats:italic>\n            We prove that the problem is NP-hard, hence we first present a heuristic based approximation algorithm to effectively select members in intermediate solution groups based on the social connectivity of the users. Later we design a\n            <jats:italic>Fast Approximate<\/jats:italic>\n            approach based on the\n            <jats:italic>relaxed social and spatial bounds, and connectivity constraint heuristic.<\/jats:italic>\n            Experimental studies have verified the effectiveness and efficiency of our proposed approaches on real datasets.\n          <\/jats:p>","DOI":"10.14778\/3282495.3282497","type":"journal-article","created":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T13:35:28Z","timestamp":1546608928000},"page":"99-111","source":"Crossref","is-referenced-by-count":30,"title":["The flexible socio spatial group queries"],"prefix":"10.14778","volume":"12","author":[{"given":"Bishwamittra","family":"Ghosh","sequence":"first","affiliation":[{"name":"BUET, Bangladesh"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed Eunus","family":"Ali","sequence":"additional","affiliation":[{"name":"BUET, Bangladesh"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farhana M.","family":"Choudhury","sequence":"additional","affiliation":[{"name":"RMIT University and University of Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sajid Hasan","family":"Apon","sequence":"additional","affiliation":[{"name":"BUET, Bangladesh"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timos","family":"Sellis","sequence":"additional","affiliation":[{"name":"Swinburne University of Technology, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxin","family":"Li","sequence":"additional","affiliation":[{"name":"The University of Western Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,10]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"https:\/\/wiki.illinois.edu\/\/wiki\/display\/forward\/Dataset-UDI-TwitterCrawl-Aug2012. {Online","year":"2018","unstructured":"Twitter crawl datasets. https:\/\/wiki.illinois.edu\/\/wiki\/display\/forward\/Dataset-UDI-TwitterCrawl-Aug2012. {Online ; accessed 27-03- 2018 }. Twitter crawl datasets. https:\/\/wiki.illinois.edu\/\/wiki\/display\/forward\/Dataset-UDI-TwitterCrawl-Aug2012. {Online; accessed 27-03-2018}."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68155-9_1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2829943"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0400-7"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463722"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612179"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055337"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994538"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983748"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856323"},{"key":"e_1_2_1_13_1","first-page":"149","volume-title":"EWCG","author":"Cardinal J. J.","year":"2006","unstructured":"J. J. Cardinal and S. Langerman . Min-max-min geometric facility location problems . In EWCG , pages 149 -- 152 , 2006 . J. J. Cardinal and S. Langerman. Min-max-min geometric facility location problems. In EWCG, pages 149--152, 2006."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.45"},{"key":"e_1_2_1_15_1","volume-title":"Limits of modularity maximization in community detection. Physical review E, 84(6):066122","author":"Lancichinetti A.","year":"2011","unstructured":"A. Lancichinetti and S. Fortunato . Limits of modularity maximization in community detection. Physical review E, 84(6):066122 , 2011 . A. Lancichinetti and S. Fortunato. Limits of modularity maximization in community detection. Physical review E, 84(6):066122, 2011."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557074"},{"key":"e_1_2_1_17_1","unstructured":"J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014.  J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2010.12"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735484"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989429"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29035-0_9"},{"key":"e_1_2_1_22_1","volume-title":"Finding and evaluating community structure in networks. Physical review E, 69(2):026113","author":"Newman M. E.","year":"2004","unstructured":"M. E. Newman and M. Girvan . Finding and evaluating community structure in networks. Physical review E, 69(2):026113 , 2004 . M. E. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical review E, 69(2):026113, 2004."},{"key":"e_1_2_1_23_1","first-page":"301","volume-title":"ICDE","author":"Papadias D.","year":"2004","unstructured":"D. Papadias , Q. Shen , Y. Tao , and K. Mouratidis . Group nearest neighbor queries . In ICDE , pages 301 -- 312 , 2004 . D. Papadias, Q. Shen, Y. Tao, and K. Mouratidis. Group nearest neighbor queries. In ICDE, pages 301--312, 2004."},{"key":"e_1_2_1_24_1","first-page":"51","volume-title":"ADC","author":"Qi J.","year":"2012","unstructured":"J. Qi , Z. Xu , Y. Xue , and Z. Wen . A branch and bound method for min-dist location selection queries . In ADC , pages 51 -- 60 , 2012 . J. Qi, Z. Xu, Y. Xue, and Z. Wen. A branch and bound method for min-dist location selection queries. In ADC, pages 51--60, 2012."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2468726"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402734"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0686-y"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/1978665.1978671"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339679"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.87"},{"key":"e_1_2_1_32_1","first-page":"643","volume-title":"VLDB","author":"Zhang D.","year":"2006","unstructured":"D. Zhang , Y. Du , T. Xia , and Y. Tao . Progressive computation of the min-dist optimal-location query . In VLDB , pages 643 -- 654 , 2006 . D. Zhang, Y. Du, T. Xia, and Y. Tao. Progressive computation of the min-dist optimal-location query. In VLDB, pages 643--654, 2006."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0473-6"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3282495.3282497","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:30:44Z","timestamp":1672223444000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3282495.3282497"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["10.14778\/3282495.3282497"],"URL":"https:\/\/doi.org\/10.14778\/3282495.3282497","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2018,10]]}}}