{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:41:20Z","timestamp":1742384480636,"version":"3.37.3"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100012913","name":"Tata Consultancy Services","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100012913","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001403","name":"Indian Institute of Technology Kanpur","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001403","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/tkde.2019.2935448","type":"journal-article","created":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T19:43:41Z","timestamp":1566503021000},"page":"1-1","source":"Crossref","is-referenced-by-count":9,"title":["TIPS: Mining Top-K Locations to Minimize User-Inconvenience for Trajectory-Aware Services"],"prefix":"10.1109","author":[{"given":"Shubhadip","family":"Mitra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Priya","family":"Saraf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnab","family":"Bhattacharya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653820"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1033770"},{"key":"ref33","first-page":"1","article-title":"A constant-factor approximation algorithm for the k-median problem","author":"charikar","year":"1999","journal-title":"Proc 31st Annu ACM Symp Theory Comput"},{"journal-title":"Finding Groups in Data","year":"1990","author":"rousseeuw","key":"ref32"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10852-008-9098-5"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702416402"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1100"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814609"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375845"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2996913.2996927"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2935448"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.46"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.06.036"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2580138"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2818179"},{"key":"ref15","first-page":"51","article-title":"A branch and bound method for min-dist location selection queries","volume":"124","author":"qi","year":"2012","journal-title":"Proc 23rd Australasian Database Conf"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0347-5"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3239124"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/UIC-ATC-ScalCom.2014.112"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687754"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(01)00079-X"},{"key":"ref4","first-page":"643","article-title":"Progressive computation of the min-dist optimal-location query","author":"zhang","year":"2006","journal-title":"Proc 32nd Int Conf Very Large Data Bases"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF02031943"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/11535331_10"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767845"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/S0966-8349(98)00047-3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1869790.1869866"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.45"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612172"},{"journal-title":"Facility Location Applications and Theory","year":"2002","author":"hamacher","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-013-0223-7"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5355-6"},{"key":"ref20","first-page":"1319","article-title":"Efficient processing of optimal meeting point queries in euclidean space and road networks","volume":"42","author":"yanemail","year":"2015","journal-title":"Knowl Inf Syst"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2525314.2525444"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-64367-0_18"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.26.3.201"},{"article-title":"Clustering of sites in a road network based on coverage of trajectories","year":"2016","author":"bhandari","key":"ref41"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(81)90208-3"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1869790.1869807"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.4.623"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020462"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.29.3.276"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/08807216.pdf?arnumber=8807216","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:04:39Z","timestamp":1642003479000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8807216\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/tkde.2019.2935448","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2019]]}}}