{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:17:22Z","timestamp":1740122242415,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,9,7]],"date-time":"2016-09-07T00:00:00Z","timestamp":1473206400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,9,7]],"date-time":"2016-09-07T00:00:00Z","timestamp":1473206400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-0917137"],"award-info":[{"award-number":["CNS-0917137"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Faculty Scholarship Award from Valdosta State University","award":["CNS-0917137"],"award-info":[{"award-number":["CNS-0917137"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10707-016-0271-0","type":"journal-article","created":{"date-parts":[[2016,9,7]],"date-time":"2016-09-07T10:09:14Z","timestamp":1473242954000},"page":"33-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Exploiting location-aware social networks for efficient spatial query processing"],"prefix":"10.1007","volume":"21","author":[{"given":"Liang","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiquan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Shinn","family":"Ku","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min-Te","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,7]]},"reference":[{"issue":"3","key":"271_CR1","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10707-010-0115-2","volume":"15","author":"H Chen","year":"2011","unstructured":"Chen H, Ku W-S, Sun M-T, Zimmermann R (2011) The partial sequenced route query with traveling rules in road networks. GeoInformatica 15(3):541\u2013569","journal-title":"GeoInformatica"},{"key":"271_CR2","doi-asserted-by":"crossref","unstructured":"Chen Z, Shen HT, Zhou X, Yu JX (2009) Monitoring path nearest neighbor in road networks. In: SIGMOD Conference, pages 591\u2013602","DOI":"10.1145\/1559845.1559907"},{"key":"271_CR3","doi-asserted-by":"crossref","unstructured":"Cheng Z, Caverlee J, Lee K (2010) You are where you tweet: a content-based approach to geo-locating twitter users. In: CIKM, pages 759\u2013768","DOI":"10.1145\/1871437.1871535"},{"key":"271_CR4","doi-asserted-by":"crossref","unstructured":"Cho E, Myers SA, Leskovec J (2011) Friendship and mobility: user movement in location-based social networks. In: KDD, pages 1082\u20131090","DOI":"10.1145\/2020408.2020579"},{"key":"271_CR5","doi-asserted-by":"crossref","unstructured":"Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the EM algorithm. J R Stat Soc:1\u201338","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"key":"271_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269\u2013271","journal-title":"Numer Math"},{"key":"271_CR7","doi-asserted-by":"crossref","unstructured":"Emrich T, Kriegel H-P, Mamoulis N, Niedermayer J, Renz M, Z\u00fcfle A (2014) Reverse-Nearest Neighbor Queries on Uncertain Moving Object Trajectories. In: DASFAA, pages 92\u2013107","DOI":"10.1007\/978-3-319-05813-9_7"},{"issue":"8","key":"271_CR8","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1093\/comjnl\/41.8.578","volume":"41","author":"C Fraley","year":"1998","unstructured":"Fraley C, Raftery AE (1998) How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis. Comput J 41(8):578\u2013588","journal-title":"Comput J"},{"issue":"458","key":"271_CR9","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1198\/016214502760047131","volume":"97","author":"C Fraley","year":"2002","unstructured":"Fraley C, Raftery AE (2002) Model-based clustering, discriminant analysis, and density estimation. J Am Stat Assoc 97(458):611\u2013631","journal-title":"J Am Stat Assoc"},{"issue":"12","key":"271_CR10","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1145\/358728.358741","volume":"25","author":"I Gargantini","year":"1982","unstructured":"Gargantini I (1982) An effective way to represent quadtrees. Commun ACM 25 (12):905\u2013910","journal-title":"Commun ACM"},{"key":"271_CR11","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: A dynamic index structure for spatial searching. In: SIGMOD Conference, pages 47\u201357","DOI":"10.1145\/971697.602266"},{"key":"271_CR12","unstructured":"Hu H, Lee DL, Lee VCS (2006) Distance indexing on road networks. In: VLDB, pages 894\u2013905"},{"key":"271_CR13","doi-asserted-by":"crossref","unstructured":"Hu H, Lee DL, Xu J (2006) Fast Nearest Neighbor Search on Road Networks. In: EDBT, pages 186\u2013203","DOI":"10.1007\/11687238_14"},{"key":"271_CR14","doi-asserted-by":"crossref","unstructured":"Huang X, Jensen CS, Saltenis S (2005) The Islands Approach to Nearest Neighbor Querying in Spatial Networks. In: SSTD, pages 73\u201390","DOI":"10.1007\/11535331_5"},{"key":"271_CR15","doi-asserted-by":"crossref","unstructured":"Jensen CS, Kol\u00e1rvr J, Pedersen TB, Timko I (2003) Nearest Neighbor Queries in Road Networks. In: GIS, pages 1\u20138","DOI":"10.1145\/956676.956677"},{"key":"271_CR16","unstructured":"Kolahdouzan MR, Shahabi C (2004) Voronoi-based k nearest neighbor search for spatial network databases. In: VLDB, pages 840\u2013851"},{"key":"271_CR17","unstructured":"Kriegel H-P, Kr\u00f6ger P, Renz M, Schmidt T (2008) Hierarchical graph embedding for efficient query processing in very large traffic networks. In: SSDBM, 150\u2013167"},{"key":"271_CR18","unstructured":"Ku W-S, Zimmermann R, Wang H, Wan C-N (2005) Adaptive nearest neighbor queries in travel time networks. In: GIS, pages 210\u2013219"},{"key":"271_CR19","doi-asserted-by":"crossref","unstructured":"Lee KCK, Lee W-C, Zheng B (2009) Fast object search on road networks, pp 1018\u20131029","DOI":"10.1145\/1516360.1516476"},{"issue":"3","key":"271_CR20","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1109\/TKDE.2010.243","volume":"24","author":"KCK Lee","year":"2012","unstructured":"Lee KCK, Lee W-C, Zheng B, Tian Y (2012) ROAD: a new spatial object search framework for road networks. IEEE Trans Knowl Data Eng 24(3):547\u2013560","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"271_CR21","doi-asserted-by":"crossref","unstructured":"Li F, Cheng D, Hadjieleftheriou M, Kollios G, Teng S-H (2005) On Trip Planning Queries in Spatial Databases. In: SSTD, pages 273\u2013290","DOI":"10.1007\/11535331_16"},{"key":"271_CR22","doi-asserted-by":"crossref","unstructured":"Li R, Wang S, Deng H, Wang R, Chang KC-C (2012) Towards social user profiling: unified and discriminative influence model for inferring home locations. In: KDD, pages 1023\u20131031","DOI":"10.1145\/2339530.2339692"},{"key":"271_CR23","doi-asserted-by":"crossref","unstructured":"Papadias D, Zhang J, Mamoulis N, Tao Y (2003) Query Processing in Spatial Network Databases. In: VLDB, pages 802\u2013813","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"271_CR24","doi-asserted-by":"crossref","unstructured":"Samet H, Sankaranarayanan J, Alborzi H (2008) Scalable network distance browsing in spatial databases. In: SIGMOD Conference, pages 43\u201354","DOI":"10.1145\/1376616.1376623"},{"key":"271_CR25","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan J, Alborzi H, Samet H (2005) Efficient query processing on spatial networks","DOI":"10.1145\/1097064.1097093"},{"issue":"2","key":"271_CR26","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1214\/aos\/1176344136","volume":"6","author":"G Schwarz","year":"1978","unstructured":"Schwarz G (1978) Estimating the dimension of a model. Ann Stat 6(2):461\u2013464","journal-title":"Ann Stat"},{"key":"271_CR27","doi-asserted-by":"crossref","unstructured":"Shahabi C, Kolahdouzan MR, Sharifzadeh M (2002) A road network embedding technique for k-nearest neighbor search in moving object databases. In: ACM-GIS, pages 94\u201310","DOI":"10.1145\/585147.585167"},{"key":"271_CR28","doi-asserted-by":"crossref","unstructured":"Tang L, Chen H, Ku W-S, Sun M-T (2014) Parameterized spatial query processing based on social probabilistic clustering. In: ACM SIGSPATIAL GIS, pages 410\u2013413","DOI":"10.1145\/2666310.2666428"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-016-0271-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-016-0271-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-016-0271-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T07:07:20Z","timestamp":1718780840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-016-0271-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,7]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["271"],"URL":"https:\/\/doi.org\/10.1007\/s10707-016-0271-0","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"type":"print","value":"1384-6175"},{"type":"electronic","value":"1573-7624"}],"subject":[],"published":{"date-parts":[[2016,9,7]]},"assertion":[{"value":"23 February 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2016","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2016","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2016","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}