{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T20:03:21Z","timestamp":1773777801118,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T00:00:00Z","timestamp":1716595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T00:00:00Z","timestamp":1716595200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s10707-024-00524-w","type":"journal-article","created":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T07:01:46Z","timestamp":1716620506000},"page":"93-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Identifying and recommending taxi hotspots in spatio-temporal space"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1965-7905","authenticated-orcid":false,"given":"Saurabh","family":"Mishra","sequence":"first","affiliation":[]},{"given":"Sonia","family":"Khetarpaul","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,25]]},"reference":[{"issue":"4","key":"524_CR1","doi-asserted-by":"publisher","first-page":"3680","DOI":"10.1109\/TVT.2020.2978450","volume":"69","author":"H Yu","year":"2020","unstructured":"Yu H, Li Z, Zhang G, Liu P, Wang J (2020) Extracting and predicting taxi hotspots in spatiotemporal dimensions using conditional generative adversarial neural networks. IEEE Trans Veh Technol 69(4):3680\u20133692","journal-title":"IEEE Trans Veh Technol"},{"key":"524_CR2","first-page":"29","volume-title":"Australasian Database Conference","author":"M Li","year":"2020","unstructured":"Li M, He D, Zhou X (2020) Efficient kNN Search with Occupation in Large-Scale On-demand Ride-Hailing. Australasian Database Conference. Springer, Cham, pp 29\u201341"},{"key":"524_CR3","doi-asserted-by":"crossref","unstructured":"Zhou, D., Hong, R., Xia, J. 2017 Identification of taxi pick-up and drop-off hotspots using the density-based spatial clustering method. In: CICTP 2017: Transportation Reform and Change-Equity, Inclusiveness, Sharing, and Innovation. pp 196-204. Reston, VA: American Society of Civil Engineers","DOI":"10.1061\/9780784480915.020"},{"issue":"1","key":"524_CR4","first-page":"3","volume":"5","author":"HW Chang","year":"2010","unstructured":"Chang HW, Tai YC, Hsu JYJ (2010) Context-aware taxi demand hotspots prediction. Int J Bus Intel Data Mining 5(1):3\u201318","journal-title":"Int J Bus Intel Data Mining"},{"key":"524_CR5","doi-asserted-by":"crossref","unstructured":"Dwork C, Kumar R, Naor M, Sivakumar D (2001) Rank aggregation methods for the web. In: WWW. pp. 613-622","DOI":"10.1145\/371920.372165"},{"issue":"5","key":"524_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N Ailon","year":"2008","unstructured":"Ailon N, Charikar M, Newman A (2008) Aggregating inconsistent information: ranking and clustering. JACM 55(5):23","journal-title":"JACM"},{"issue":"1","key":"524_CR7","first-page":"72","volume":"59","author":"S Shekhar","year":"2016","unstructured":"Shekhar S, Feiner SK, Aref WG (2016) Spatial computing. Comm. of the ACM 59(1):72\u201381","journal-title":"Spatial computing. Comm. of the ACM"},{"key":"524_CR8","doi-asserted-by":"crossref","unstructured":"Mouratidis K, Bakiras S, D Papadias (2006) Continuous monitoring of top-k queries over sliding windows. In: SIGMOD. pp. 635-646","DOI":"10.1145\/1142473.1142544"},{"key":"524_CR9","doi-asserted-by":"crossref","unstructured":"Bohm C, Ooi BC, Plant C, Yan Y (2007) Efficiently processing continuous k-nn queries on data streams. In: ICDE. pp 156-165","DOI":"10.1109\/ICDE.2007.367861"},{"key":"524_CR10","doi-asserted-by":"crossref","unstructured":"Korn F, Muthukrishnan S, Srivastava D (2002) Reverse nearest neighbor aggregates over data streams. In: PVLDB. pp 814-825","DOI":"10.1016\/B978-155860869-6\/50077-9"},{"issue":"2","key":"524_CR11","first-page":"113","volume":"8","author":"C Li","year":"2014","unstructured":"Li C, Gu Y, Qi J, Yu G, Zhang R, Yi W (2014) Processing moving knn queries using influential neighbor sets. PVLDB 8(2):113\u2013124","journal-title":"PVLDB"},{"issue":"1","key":"524_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s00778-011-0235-9","volume":"21","author":"M Cheema","year":"2012","unstructured":"Cheema M, Zhang W, Lin X, Zhang Y, Li X (2012) Continuous reverse k nearest neighbors queries in euclidean space and in spatial networks. VLDB J 21(1):69\u201395","journal-title":"VLDB J"},{"key":"524_CR13","first-page":"142","volume-title":"Australasian Database Conference","author":"S Khetarpaul","year":"2015","unstructured":"Khetarpaul S, Gupta SK, Malhotra S, Subramaniam LV (2015) Bus arrival time prediction using a modified amalgamation of fuzzy clustering and neural network on spatio-temporal data. Australasian Database Conference. Springer, Cham, pp 142\u2013154"},{"key":"524_CR14","unstructured":"Xia T, Zhang D, Kanoulas E, Du Y (2005) On computing top-t most influential spatial sites. In PVLDB. pp 946-957"},{"issue":"4","key":"524_CR15","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF03037246","volume":"17","author":"Yasuyuki Sumi","year":"1999","unstructured":"Sumi Yasuyuki, Mase Kenji (1999) Toward a real-world knowledge medium: building a guidance system for exhibition tours. N Gener Comput 17(4):407\u2013416","journal-title":"N Gener Comput"},{"issue":"4","key":"524_CR16","first-page":"541","volume":"23","author":"J-L Koh","year":"2014","unstructured":"Koh J-L, Lin C-Y, Chen AP (2014) Finding k most favorite products based on reverse top-t queries. PVLDB 23(4):541\u2013564","journal-title":"PVLDB"},{"issue":"1\u20132","key":"524_CR17","first-page":"364","volume":"3","author":"A Vlachou","year":"2010","unstructured":"Vlachou A, Doulkeridis C, N\u00f8rv\u00e5g K, Kotidis Y (2010) Identifying the most influential data objects with reverse top-k queries. PVLDB 3(1\u20132):364\u2013372","journal-title":"PVLDB"},{"issue":"1","key":"524_CR18","first-page":"1126","volume":"2","author":"RC-W Wong","year":"2009","unstructured":"Wong RC-W, \u00d6zsu MT, Yu PS, Fu AW-C, Liu L (2009) Efficient method for maximizing bichromatic reverse nearest neighbor. PVLDB 2(1):1126\u20131137","journal-title":"PVLDB"},{"key":"524_CR19","doi-asserted-by":"crossref","unstructured":"Gkorgkas O, Vlachou A, Doulkeridis C, N\u00f8rv\u00e5g K (2013) Discovering influential data objects over time. In SSTD. pp 110-127","DOI":"10.1007\/978-3-642-40235-7_7"},{"key":"524_CR20","unstructured":"Choudhury FM, Bao Z, Culpepper JS, Sellis T (2016) Monitoring the top-m aggregation in a sliding window of spatial queries"},{"key":"524_CR21","unstructured":"Sampathkumar E, Walikar HB (1979) Connected domination number of a graph. J Math Phys"},{"issue":"19","key":"524_CR22","doi-asserted-by":"publisher","first-page":"3647","DOI":"10.1016\/j.ins.2010.06.009","volume":"180","author":"C Pang","year":"2010","unstructured":"Pang C, Zhang R, Zhang Q, Wang J (2010) Dominating sets in directed graphs. Inf Sci 180(19):3647\u2013365","journal-title":"Inf Sci"},{"key":"524_CR23","unstructured":"Wang G, Wang H, Tao X, Zhang J (2013) A self-stabilizing algorithm for finding a minimal positive influence dominating set in social networks. In: Proceedings of the 24th Australasian Database Conference (ADC 2013). Australian Computer Society Inc, pp 93-100"},{"issue":"6","key":"524_CR24","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1109\/TNN.2009.2015088","volume":"20","author":"H He","year":"2009","unstructured":"He H, Zhu Z, Makinen E (2009) A neural network model to minimize the connected dominating set for self-configuration of wireless sensor networks. IEEE Trans Neural Netw 20(6):973\u2013982","journal-title":"IEEE Trans Neural Netw"},{"key":"524_CR25","doi-asserted-by":"crossref","unstructured":"Davis N, Raina G, Jagannathan K (2016) A multi-level clustering approach for forecasting taxi travel demand. In: 2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC). IEEE, pp 223-228","DOI":"10.1109\/ITSC.2016.7795558"},{"key":"524_CR26","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/j.physa.2017.11.114","volume":"493","author":"J Tang","year":"2018","unstructured":"Tang J, Zhang S, Chen X, Liu F, Zou Y (2018) Taxi trips distribution modeling based on Entropy-Maximizing theory: a case study in Harbin City-China. Physica A 493:430\u2013443","journal-title":"Physica A"},{"issue":"1","key":"524_CR27","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00354-008-0074-4","volume":"28","author":"A Buccella","year":"2010","unstructured":"Buccella A, Cechich A, Gendarmi D, Lanubile F, Semeraro G, Colagrossi A (2010) GeoMergeP: geographic information integration through enriched ontology matching. N Gener Comput 28(1):41\u201371","journal-title":"N Gener Comput"},{"issue":"3","key":"524_CR28","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1109\/TITS.2013.2262376","volume":"14","author":"L Moreira-Matias","year":"2013","unstructured":"Moreira-Matias L, Gama J, Ferreira M, Mendes-Moreira J, Damas L (2013) Predicting taxi-passenger demand using streaming data. IEEE Trans Intell Transp Syst 14(3):1393\u20131402","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"524_CR29","first-page":"111","volume-title":"Australasian Database Conference","author":"S Mishra","year":"2021","unstructured":"Mishra S, Khetarpaul S (2021) Optimal Placement of Taxis in a City Using Dominating Set Problem. Australasian Database Conference. Springer, Cham, pp 111\u2013124"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-024-00524-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10707-024-00524-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-024-00524-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T09:19:19Z","timestamp":1739870359000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10707-024-00524-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,25]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["524"],"URL":"https:\/\/doi.org\/10.1007\/s10707-024-00524-w","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,25]]},"assertion":[{"value":"1 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors whose names are listed in this paper certify that they have no potential conflict of interest below mentioned:","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"\u2013 The authors did not receive support from any organization for the submitted work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"\u2013 The authors have NO affiliations with or involvement in any organization or entity other than the one mentioned in the manuscript.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"\u2013 The authors have no financial or proprietary interests in any material discussed in this article.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"\u2013 The authors have no relevant non-financial interests to disclose.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We confirm that the manuscript has been read and approved by all named authors and that there are no other persons who satisfied the criteria for authorship but are not listed. We further confirm that the order of authors listed in the manuscript has been approved by all of us. We confirm that we have given due consideration to the protection of intellectual property associated with this work and that there are no impediments to publication, including the timing of publication, with respect to intellectual property. In so doing, we confirm that we have followed the regulations of our institutions concerning intellectual property. We further confirm that any aspect of the work covered in this manuscript that has involved either experimental animals or human patients has been conducted with the ethical approval of all relevant bodies and that such approvals are acknowledged within the manuscript.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We understand that the Corresponding Author is the sole contact for the Editorial process (including Editorial Manager and direct communications with the office). He\/she is responsible for communicating with the other authors about progress, submissions of revisions, and final approval of proofs.","order":7,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":8,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}