{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:01:28Z","timestamp":1760061688960,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,12,19]],"date-time":"2018-12-19T00:00:00Z","timestamp":1545177600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the Key Disciplines of Computer Science and Technology of Shanghai Polytechnic University","award":["XXKZD1604"],"award-info":[{"award-number":["XXKZD1604"]}]},{"name":"the Research Project of Shanghai Polytechnic University","award":["EGD18XQD02"],"award-info":[{"award-number":["EGD18XQD02"]}]},{"name":"Australian Research Council (ARC) Discovery project","award":["DP180103332"],"award-info":[{"award-number":["DP180103332"]}]},{"name":"the Cultural Relic Protection Science and Technology project of Zhejiang Province"},{"DOI":"10.13039\/none","name":"Key Research and Development Program of Zhejiang Province","doi-asserted-by":"publisher","id":[{"id":"10.13039\/none","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the NSFC under Grants","award":["61522208"],"award-info":[{"award-number":["61522208"]}]},{"name":"the ZJU-Hikvision Joint Project","award":["None"],"award-info":[{"award-number":["None"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10115-018-1307-6","type":"journal-article","created":{"date-parts":[[2018,12,19]],"date-time":"2018-12-19T09:15:48Z","timestamp":1545210948000},"page":"873-903","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["GOAL: a clustering-based method for the group optimal location problem"],"prefix":"10.1007","volume":"61","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5496-9891","authenticated-orcid":false,"given":"Fangshu","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Qi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6313-5349","authenticated-orcid":false,"given":"Huaizhong","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunjun","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongming","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,19]]},"reference":[{"key":"1307_CR1","doi-asserted-by":"crossref","unstructured":"Alt H, Arkin EM, Br\u00f6nnimann H, Erickson J, Fekete SP, Knauer C, Lenchner J, Mitchell JSB, Whittlesey K (2006) Minimum-cost coverage of point sets by disks. In: Proceedings of the twenty-second annual symposium on Computational geometry, ACM, pp 449\u2013458","DOI":"10.1145\/1137856.1137922"},{"issue":"7","key":"1307_CR2","doi-asserted-by":"publisher","first-page":"1935","DOI":"10.1016\/j.comnet.2012.02.008","volume":"56","author":"HM Ammari","year":"2012","unstructured":"Ammari HM (2012) On the problem of k-coverage in mission-oriented mobile wireless sensor networks. Comput Netw 56(7):1935\u20131950","journal-title":"Comput Netw"},{"issue":"4","key":"1307_CR3","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10852-010-9142-0","volume":"9","author":"BB Bhattacharya","year":"2010","unstructured":"Bhattacharya BB (2010) Maximizing voronoi regions of a set of points enclosed in a circle with applications to facility location. J Math Modell Algorithms 9(4):375\u2013392","journal-title":"J Math Modell Algorithms"},{"issue":"1","key":"1307_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ejor.2009.04.021","volume":"202","author":"S Cabello","year":"2010","unstructured":"Cabello S, D\u00edaz-B\u00e1\u00f1ez JM, Langerman S, Seara C, Ventura I (2010) Facility location problems in the plane based on reverse nearest neighbor queries. Eur J Oper Res 202(1):99\u2013106","journal-title":"Eur J Oper Res"},{"key":"1307_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.eswa.2015.08.051","volume":"43","author":"F Chen","year":"2016","unstructured":"Chen F, Lin H, Gao Y, Dongming L (2016) Capacity constrained maximizing bichromatic reverse nearest neighbor search. Expert Syst Appl 43:93\u2013108","journal-title":"Expert Syst Appl"},{"key":"1307_CR6","doi-asserted-by":"crossref","unstructured":"Chen Z, Liu Y, Chi-Wing WR, Xiong J, Mai G, Long C (2014) Efficient algorithms for optimal location queries in road networks. In: SIGMOD, pp 123\u2013134","DOI":"10.1145\/2588555.2612172"},{"issue":"3","key":"1307_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/2818179","volume":"40","author":"Z Chen","year":"2015","unstructured":"Chen Z, Liu Y, Wong RC-W, Xiong J, Mai G, Long C (2015) Optimal location queries in road networks. ACM Trans Database Syst 40(3):17","journal-title":"ACM Trans Database Syst"},{"issue":"1","key":"1307_CR8","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00454-006-1273-8","volume":"37","author":"KL Clarkson","year":"2007","unstructured":"Clarkson KL, Varadarajan K (2007) Improved approximation algorithms for geometric set cover. Discrete Comput Geom 37(1):43\u201358","journal-title":"Discrete Comput Geom"},{"key":"1307_CR9","doi-asserted-by":"crossref","unstructured":"Du Y, Zhang D, Xia T (2005) The optimal-location query. In: International symposium on spatial and temporal databases, pp 163\u2013180","DOI":"10.1007\/11535331_10"},{"key":"1307_CR10","unstructured":"Erlebach T, Jansen K, Seidel E (2001) Polynomial-time approximation schemes for geometric graphs. In: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, pp 671\u2013679"},{"key":"1307_CR11","unstructured":"Ester M, Kriegel H-P, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, AAAI Press, pp 226\u2013231"},{"key":"1307_CR12","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ins.2014.11.038","volume":"298","author":"Y Gao","year":"2015","unstructured":"Gao Y, Shuyao Qi L, Chen BZ, Li X (2015) On efficient k-optimal-location-selection query processing in metric spaces. Inf Sci 298:98\u2013117","journal-title":"Inf Sci"},{"issue":"9","key":"1307_CR13","doi-asserted-by":"publisher","first-page":"1406","DOI":"10.1109\/TKDE.2010.259","volume":"23","author":"X He","year":"2011","unstructured":"He X, Cai D, Shao Y, Bao H, Han J (2011) Laplacian regularized gaussian mixture model for data clustering. IEEE Trans Knowl Data Eng 23(9):1406\u20131418","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"1307_CR14","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum DS, Maass W (1985) Approximation schemes for covering and packing problems in image processing and vlsi. J ACM 32(1):130\u2013136","journal-title":"J ACM"},{"key":"1307_CR15","doi-asserted-by":"crossref","unstructured":"Huang J, Wen Z, Qi J, Zhang R, Chen J, He Z (2011) Top-k most influential locations selection. In: CIKM, pp 2377\u20132380","DOI":"10.1145\/2063576.2063971"},{"issue":"1","key":"1307_CR16","first-page":"61","volume":"16","author":"M Kavaliauskas","year":"2005","unstructured":"Kavaliauskas M, Rudzkis R (2005) Multivariate data clustering for the gaussian mixture model. Inf Lith Acad Sci 16(1):61\u201374","journal-title":"Inf Lith Acad Sci"},{"issue":"12","key":"1307_CR17","doi-asserted-by":"publisher","first-page":"2627","DOI":"10.1016\/j.jss.2010.08.049","volume":"83","author":"C-H Lee","year":"2010","unstructured":"Lee C-H, Chung C-W, Chun S-J (2010) Effective processing of continuous group-by aggregate queries in sensor networks. J Syst Softw 83(12):2627\u20132641","journal-title":"J Syst Softw"},{"issue":"10","key":"1307_CR18","doi-asserted-by":"publisher","first-page":"1526","DOI":"10.1109\/TKDE.2010.181","volume":"23","author":"F Li","year":"2011","unstructured":"Li F, Yao B, Kumar P (2011) Group enclosing queries. IEEE Trans Knowl Data Eng 23(10):1526\u20131540","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1307_CR19","doi-asserted-by":"crossref","unstructured":"Lin H, Chen F, Gao Y, Lu D (2013) Optregion: finding optimal region for bichromatic reverse nearest neighbors. In: International conference on database systems for advanced applications, Springer, pp 146\u2013160","DOI":"10.1007\/978-3-642-37487-6_13"},{"issue":"1","key":"1307_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10115-012-0527-4","volume":"36","author":"Y Liu","year":"2013","unstructured":"Liu Y, Wong CW, Wang K, Li Z, Chen C, Chen Z (2013) A new approach for maximizing bichromatic reverse nearest neighbor search. Knowl Inf Syst 36(1):23\u201358","journal-title":"Knowl Inf Syst"},{"issue":"11","key":"1307_CR21","doi-asserted-by":"publisher","first-page":"2623","DOI":"10.1016\/j.mcm.2011.06.038","volume":"54","author":"M Mohammadi","year":"2011","unstructured":"Mohammadi M, Jolai F, Rostami H (2011) An m\/m\/c queue model for hub covering location problem. Math Comput Modell 54(11):2623\u20132638","journal-title":"Math Comput Modell"},{"issue":"4","key":"1307_CR22","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1007\/s00778-007-0045-2","volume":"17","author":"K Mouratidis","year":"2008","unstructured":"Mouratidis K, Papadias D, Papadimitriou S (2008) Tree-based partition querying: a methodology for computing medoids in large spatial datasets. VLDB J 17(4):923\u2013945","journal-title":"VLDB J"},{"key":"1307_CR23","first-page":"51","volume":"124","author":"J Qi","year":"2012","unstructured":"Qi J, Zhenghua X, Xue Y, Wen Z (2012) A branch and bound method for min-dist location selection queries. Proc Twenty-Third Australas Database Conf 124:51\u201360","journal-title":"Proc Twenty-Third Australas Database Conf"},{"key":"1307_CR24","doi-asserted-by":"crossref","unstructured":"Qi J, Zhang R, Kulik L, Lin D, Xue Y (2012) The min-dist location selection query. In: ICDE, pp 66\u2013377","DOI":"10.1109\/ICDE.2012.45"},{"issue":"12","key":"1307_CR25","doi-asserted-by":"publisher","first-page":"7273","DOI":"10.1109\/JSEN.2015.2474711","volume":"15","author":"K Sakai","year":"2015","unstructured":"Sakai K, Sun M-T, Ku W-S, Lai TH, Vasilakos AV (2015) A framework for the optimal-coverage deployment patterns of wireless sensors. IEEE Sens J 15(12):7273\u20137283","journal-title":"IEEE Sens J"},{"key":"1307_CR26","doi-asserted-by":"crossref","unstructured":"Shmoys DB, Tardos \u00c9, Aardal K (1997) Approximation algorithms for facility location problems. In: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pp 265\u2013274","DOI":"10.1145\/258533.258600"},{"issue":"1","key":"1307_CR27","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","volume":"16","author":"R Sibson","year":"1973","unstructured":"Sibson R (1973) SLINK: an optimally efficient algorithm for the single-link cluster method. Comput J 16(1):30\u201334","journal-title":"Comput J"},{"issue":"2","key":"1307_CR28","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1080\/13658816.2014.958154","volume":"29","author":"R Su\u00e1rez-Vega","year":"2015","unstructured":"Su\u00e1rez-Vega R, Guti\u00e9rrez-Acu\u00f1a JL, Rodr\u00edguez-D\u00edaz M (2015) Locating a supermarket using a locally calibrated huff model. Int J Geogr Inf Sci 29(2):217\u2013233","journal-title":"Int J Geogr Inf Sci"},{"issue":"4","key":"1307_CR29","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s00607-013-0382-5","volume":"97","author":"Y Sun","year":"2015","unstructured":"Sun Y, Qi J, Zhang R, Chen Y, Xiaoyong D (2015) Mapreduce based location selection algorithm for utility maximization with capacity constraints. Computing 97(4):403\u2013423","journal-title":"Computing"},{"key":"1307_CR30","doi-asserted-by":"crossref","unstructured":"Sun Y, Zhang R, Xue AY, Qi J, Du X (2016) Reverse nearest neighbor heat maps: a tool for influence exploration. In: ICDE, pp 966\u2013977","DOI":"10.1109\/ICDE.2016.7498305"},{"issue":"1","key":"1307_CR31","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.14778\/1687627.1687754","volume":"2","author":"RC-W Wong","year":"2009","unstructured":"Wong RC-W, Tamer \u00d6zsu M, Yu PS, Fu AW-C, Liu L (2009) Efficient method for maximizing bichromatic reverse nearest neighbor. Proc VLDB Endow 2(1):1126\u20131137","journal-title":"Proc VLDB Endow"},{"key":"1307_CR32","doi-asserted-by":"crossref","unstructured":"Xiao X, Yao B, Li F (2011) Optimal location queries in road network databases. In: ICDE, pp 804\u2013815","DOI":"10.1109\/ICDE.2011.5767845"},{"issue":"12","key":"1307_CR33","doi-asserted-by":"publisher","first-page":"2796","DOI":"10.1109\/TKDE.2012.160","volume":"25","author":"X Chuanfei","year":"2013","unstructured":"Chuanfei X, Yu G, Zimmermann R, Lin S, Ge Y (2013) Group location selection queries over uncertain objects. IEEE Trans Knowl Data Eng 25(12):2796\u20132808","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1307_CR34","first-page":"41","volume":"124","author":"X Chuanfei","year":"2012","unstructured":"Chuanfei X, Yanqiu Wang YG, Lin S, Ge Y (2012) Optimal k-constraint coverage queries on spatial objects. Proc Twenty-Third Australas Database Conf 124:41\u201350","journal-title":"Proc Twenty-Third Australas Database Conf"},{"key":"1307_CR35","unstructured":"Zhang D, Du Y, Xia T, Tao Y (2006) Progressive computation of the min-dist optimal-location query. In: VLDB, pp 643\u2013654"},{"key":"1307_CR36","doi-asserted-by":"crossref","unstructured":"Zhou Z, Wu W, Li X, Lee ML, Hsu W (2011) Maxfirst for maxbrknn. In: ICDE, pp 828\u2013839","DOI":"10.1109\/ICDE.2011.5767892"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-018-1307-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-018-1307-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-018-1307-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,18]],"date-time":"2019-12-18T19:20:33Z","timestamp":1576696833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-018-1307-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,19]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["1307"],"URL":"https:\/\/doi.org\/10.1007\/s10115-018-1307-6","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2018,12,19]]},"assertion":[{"value":"21 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}