{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:59:43Z","timestamp":1770994783208,"version":"3.50.1"},"reference-count":72,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2022,3,17]],"date-time":"2022-03-17T00:00:00Z","timestamp":1647475200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJGI"],"abstract":"<jats:p>Task allocation is a critical issue of spatial crowdsourcing. Although the batching strategy performs better than the real-time matching mode, it still has the following two drawbacks: (1) Because the granularity of the batch size set obtained by batching is too coarse, it will result in poor matching accuracy. However, roughly designing the batch size for all possible delays will result in a large computational overhead. (2) Ignoring non-stationary factors will lead to a change in optimal batch size that cannot be found as soon as possible. Therefore, this paper proposes a fine-grained, batching-based task allocation algorithm (FGBTA), considering non-stationary setting. In the batch method, the algorithm first uses variable step size to allow for fine-grained exploration within the predicted value given by the multi-armed bandit (MAB) algorithm and uses the results of pseudo-matching to calculate the batch utility. Then, the batch size with higher utility is selected, and the exact maximum weight matching algorithm is used to obtain the allocation result within the batch. In order to cope with the non-stationary changes, we use the sliding window (SW) method to retain the latest batch utility and discard the historical information that is too far away, so as to finally achieve refined batching and adapt to temporal changes. In addition, we also take into account the benefits of requesters, workers, and the platform. Experiments on real data and synthetic data show that this method can accomplish the task assignment of spatial crowdsourcing effectively and can adapt to the non-stationary setting as soon as possible. This paper mainly focuses on the spatial crowdsourcing task of ride-hailing.<\/jats:p>","DOI":"10.3390\/ijgi11030203","type":"journal-article","created":{"date-parts":[[2022,3,20]],"date-time":"2022-03-20T21:30:14Z","timestamp":1647811814000},"page":"203","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Fine-Grain Batching-Based Task Allocation Algorithm for Spatial Crowdsourcing"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3428-4203","authenticated-orcid":false,"given":"Yuxin","family":"Jiao","sequence":"first","affiliation":[{"name":"The Academy of Digital China (Fujian), Fuzhou University, Fuzhou 350108, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhikun","family":"Lin","sequence":"additional","affiliation":[{"name":"The Academy of Digital China (Fujian), Fuzhou University, Fuzhou 350108, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Yu","sequence":"additional","affiliation":[{"name":"The Academy of Digital China (Fujian), Fuzhou University, Fuzhou 350108, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8397-510X","authenticated-orcid":false,"given":"Xiaozhu","family":"Wu","sequence":"additional","affiliation":[{"name":"The Academy of Digital China (Fujian), Fuzhou University, Fuzhou 350108, China"},{"name":"College of Computer and Data Science\/College of Software, Fuzhou University, Fuzhou 350108, China"},{"name":"Key Lab of Spatial Data Mining & Information Sharing, MOE, Fuzhou University, Fuzhou 350108, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,3,17]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s00778-019-00568-7","article-title":"Spatial crowdsourcing: A survey","volume":"29","author":"Tong","year":"2020","journal-title":"VLDB J."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"120218","DOI":"10.1109\/ACCESS.2020.3005543","article-title":"A Framework for Optimal Worker Selection in Spatial Crowdsourcing Using Bayesian Network","volume":"8","author":"Abdullah","year":"2020","journal-title":"IEEE Access"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Aloufi, E., Alharthi, R., Zohdy, M., Alsulami, D., Alrashdi, I., and Olawoyin, R. (2020, January 12). An Efficient Approach for Task Assignment in Spatial Crowdsourcing. Proceedings of the IEEE International IOT, Electronics and Mechatronics Conference (IEMTRONICS), Vancouver, India.","DOI":"10.1109\/IEMTRONICS51293.2020.9216447"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"2536","DOI":"10.1109\/TMC.2020.2984380","article-title":"An Approximation Algorithm for Bounded Task Assignment Problem in Spatial Crowdsourcing","volume":"20","author":"Bhatti","year":"2021","journal-title":"IEEE. Trans. Mob. Comput."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/s11432-019-3061-x","article-title":"Real-time bottleneck matching in spatial crowdsourcing","volume":"64","author":"Li","year":"2021","journal-title":"Sci. China-Inf. Sci."},{"key":"ref_6","first-page":"14","article-title":"TASC-MADM: Task Assignment in Spatial Crowdsourcing Based on Multiattribute Decision-Making","volume":"2021","author":"Li","year":"2021","journal-title":"Secur. Commun. Netw."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.resourpol.2021.102082","article-title":"Spatial crowdsourcing in natural resource revenue management","volume":"72","author":"Ogbe","year":"2021","journal-title":"Resour. Policy"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/j.neucom.2019.11.121","article-title":"Worker Collaborative group estimation in spatial crowdsourcing","volume":"428","author":"Wang","year":"2021","journal-title":"Neurocomputing"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/3291933","article-title":"A Survey of Spatial Crowdsourcing","volume":"44","author":"Gummidi","year":"2019","journal-title":"ACM Trans. Database Syst."},{"key":"ref_10","unstructured":"(2021, December 20). Uber. Available online: https:\/\/www.uber.com\/."},{"key":"ref_11","unstructured":"(2021, December 20). Waze. Available online: https:\/\/www.waze.com\/."},{"key":"ref_12","unstructured":"(2021, December 20). GrubHub. Available online: https:\/\/www.grubhub.com\/."},{"key":"ref_13","unstructured":"(2021, December 20). Gigwalk. Available online: https:\/\/www.gigwalk.com\/."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.trb.2019.02.011","article-title":"On the supply curve of ride-hailing systems","volume":"132","author":"Xu","year":"2020","journal-title":"Transp. Res. Part B-Methodol."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s10707-019-00351-4","article-title":"Multi-skill aware task assignment in real-time spatial crowdsourcing","volume":"24","author":"Song","year":"2020","journal-title":"Geoinformatica"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Cheng, Y.R., Li, B.Y., Zhou, X.M., Yuan, Y., Wang, G.R., and Chen, L. (2020, January 20\u201324). Real-Time Cross Online Matching in Spatial Crowdsourcing. Proceedings of the IEEE 36th International Conference on Data Engineering (ICDE), Dallas, TX, USA.","DOI":"10.1109\/ICDE48307.2020.00008"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Kazemi, L., and Shahabi, C. (2012, January 6\u20139). Geocrowd: Enabling query answering with spatial crowdsourcing. Proceedings of the 20th international conference on advances in geographic information systems, Redondo Beach, CA, USA.","DOI":"10.1145\/2424321.2424346"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2729713","article-title":"A Server-Assigned Spatial Crowdsourcing Framework","volume":"1","author":"To","year":"2015","journal-title":"ACM Trans. Spat. Algorithms Syst."},{"key":"ref_19","unstructured":"Ke, J., Xiao, F., Yang, H., and Ye, J. (2020). Learning to delay in ride-sourcing systems: A multi-agent deep reinforcement learning framework. IEEE Transactions on Knowledge and Data Engineering, IEEE."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.trb.2019.11.005","article-title":"Optimizing matching time interval and matching radius in on-demand ride-sourcing markets","volume":"131","author":"Yang","year":"2020","journal-title":"Transp. Res. Part B-Methodol."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.trc.2021.103239","article-title":"Optimizing matching time intervals for ride-hailing services using reinforcement learning","volume":"129","author":"Qin","year":"2021","journal-title":"Transp. Res. Part C-Emerg. Technol."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/3459925","article-title":"Online Service with Delay","volume":"17","author":"Azar","year":"2021","journal-title":"ACM Trans. Algorithms"},{"key":"ref_23","unstructured":"Ashlagi, I., Burq, M., Dutta, C., Jaillet, P., Saberi, A., and Sholley, C. (2018). Maximum weight online matching with deadlines. arXiv."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"132324","DOI":"10.1109\/ACCESS.2019.2940028","article-title":"Enhancing User Experience of Task Assignment in Spatial Crowdsourcing: A Self-Adaptive Batching Approach","volume":"7","author":"Qian","year":"2019","journal-title":"IEEE Access"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Nevo, D., and Kotlarsky, J. (2020). Crowdsourcing as a strategic is sourcing phenomenon: Critical review and insights for future research. J. Strateg. Inf. Syst., 29.","DOI":"10.2139\/ssrn.3663509"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1038\/s43018-020-0065-z","article-title":"Crowdsourcing a crisis response for COVID-19 in oncology","volume":"1","author":"Desai","year":"2020","journal-title":"Nat. Cancer"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"3241","DOI":"10.1109\/TWC.2020.2971981","article-title":"A crowdsourcing framework for on-device federated learning","volume":"19","author":"Pandey","year":"2020","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Wang, Y., Gao, Y., Li, Y., and Tong, X.J.C.N. (2020). A worker-selection incentive mechanism for optimizing platform-centric mobile crowdsourcing systems. Computer Netw., 171.","DOI":"10.1016\/j.comnet.2020.107144"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Modaresnezhad, M., Iyer, L., Palvia, P., and Taras, V.J.I.P. (2020). Information Technology (IT) enabled crowdsourcing: A conceptual framework. Inf. Process., 57.","DOI":"10.1016\/j.ipm.2019.102135"},{"key":"ref_30","first-page":"1","article-title":"The rise of crowdsourcing","volume":"14","author":"Howe","year":"2006","journal-title":"Wired Mag."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Bhatti, S.S., Gao, X., and Chen, G.J.J.o.S. (2020). General framework, opportunities and challenges for crowdsourcing techniques: A Comprehensive survey. J. Syst. Softw., 167.","DOI":"10.1016\/j.jss.2020.110611"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Moghadas, M., Rajabifard, A., Fekete, A., and K\u00f6tter, T. (2022). A Framework for Scaling Urban Transformative Resilience Through Utilizing Volunteered Geographic Information. ISPRS Int. J. Geo-Inf., 11.","DOI":"10.3390\/ijgi11020114"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Herold, H., Behnisch, M., Hecht, R., and Leyk, S.J.I.I.J.o.G.-I. (2022). Geospatial Modeling Approaches to Historical Settlement and Landscape Analysis. ISPRS Int. J. Geo-Inf., 11.","DOI":"10.3390\/ijgi11020075"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Hacar, M.J.I.I.J.o.G.-I. (2022). Analyzing the Behaviors of OpenStreetMap Volunteers in Mapping Building Polygons Using a Machine Learning Approach. ISPRS Int. J. Geo-Inf., 11.","DOI":"10.3390\/ijgi11010070"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Cao, S., Du, S., Yang, S., and Du, S. (2021). Functional Classification of Urban Parks Based on Urban Functional Zone and Crowd-Sourced Geographical Data. ISPRS Int. J. Geo-Inf., 10.","DOI":"10.3390\/ijgi10120824"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1080\/17538941003759255","article-title":"Crowdsourcing geographic information for disaster response: A research frontier","volume":"3","author":"Goodchild","year":"2010","journal-title":"Int. J. Digit. Earth"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Elwood, S., Goodchild, M.F., and Sui, D. (2013). Prospects for VGI research and the emerging fourth paradigm. Crowdsourcing Geographic Knowledge, Springer.","DOI":"10.1007\/978-94-007-4587-2_20"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1080\/13658816.2019.1673397","article-title":"Real-time GIS for smart cities","volume":"34","author":"Li","year":"2020","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"1588","DOI":"10.1080\/13658816.2019.1593422","article-title":"Crowdsourced geospatial data quality: Challenges and future directions","volume":"33","author":"Basiri","year":"2019","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Haklay, M. (2013). Citizen science and volunteered geographic information: Overview and typology of participation. Crowdsourcing Geographic Knowledge, Springer.","DOI":"10.1007\/978-94-007-4587-2_7"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Khajwal, A.B., and Noshadravan, A. (2021). An uncertainty-aware framework for reliable disaster damage assessment via crowdsourcing. Int. J. Disaster Risk Reduct., 55.","DOI":"10.1016\/j.ijdrr.2021.102110"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Vrb\u00edk, D., and L\u00e1bus, V. (2021). Crowdsourcing of Popular Toponyms: How to Collect and Preserve Toponyms in Spoken Use. Int. J. Geo-Inf., 10.","DOI":"10.3390\/ijgi10050303"},{"key":"ref_43","unstructured":"(2022, March 01). Geo-Wiki. Available online: https:\/\/www.geo-wiki.org\/."},{"key":"ref_44","unstructured":"(2022, March 01). Global Earthquake Model (GEM). Available online: https:\/\/www.globalquakemodel.org\/."},{"key":"ref_45","unstructured":"(2022, March 01). ClickWorkers. Available online: http:\/\/www.nasaclickworkers.com\/."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Wang, Y.S., Tong, Y.X., Long, C., Xu, P., Xu, K., and Lv, W.F. (2019, January 8\u201311). Adaptive Dynamic Bipartite Graph Matching: A Reinforcement Learning Approach. Proceedings of the IEEE 35th International Conference on Data Engineering (ICDE), Macau, China.","DOI":"10.1109\/ICDE.2019.00133"},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"25323","DOI":"10.1109\/JSEN.2021.3057376","article-title":"Deep Reinforcement Learning for Task Assignment in Spatial Crowdsourcing and Sensing","volume":"21","author":"Sun","year":"2021","journal-title":"IEEE Sens. J."},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Wang, K., Long, C., Tong, Y., Zhang, J., and Xu, Y. (May, January 29). Adaptive Holding for Online Bottleneck Matching with Delays. Proceedings of the Proceedings of the 2021 SIAM International Conference on Data Mining (SDM), Online.","DOI":"10.1137\/1.9781611976700.27"},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Manome, N., Shinohara, S., Suzuki, K., Tomonaga, K., and Mitsuyoshi, S. (2019, January 17). A Multi-armed Bandit Algorithm Available in Stationary or Non-stationary Environments Using Self-organizing Maps. Proceedings of the 28th International Conference on Artificial Neural Networks (ICANN), Munich, Germany.","DOI":"10.1007\/978-3-030-30487-4_41"},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"2167","DOI":"10.1109\/LCOMM.2020.3004523","article-title":"An Online Algorithm for Computation Offloading in Non-Stationary Environments","volume":"24","author":"Rahman","year":"2020","journal-title":"IEEE Commun. Lett."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"75503","DOI":"10.1109\/ACCESS.2020.2988671","article-title":"Non-Stationary Bandit Strategy for Rate Adaptation With Delayed Feedback","volume":"8","author":"Zhao","year":"2020","journal-title":"IEEE Access"},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"7108","DOI":"10.1109\/TWC.2020.3008091","article-title":"Multi-Armed Bandit-Based Client Scheduling for Federated Learning","volume":"19","author":"Xia","year":"2020","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1109\/LSP.2020.3047725","article-title":"Risk-Aware Multi-Armed Bandits With Refined Upper Confidence Bounds","volume":"28","author":"Liu","year":"2021","journal-title":"IEEE Signal Process. Lett."},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Roy, K., Zhang, Q., Gaur, M., and Sheth, A. (2021, January 13\u201317). Knowledge Infused Policy Gradients with Upper Confidence Bound for Relational Bandits. Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), Online.","DOI":"10.1007\/978-3-030-86486-6_3"},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.compeleceng.2021.107537","article-title":"Hardware implementation of the upper confidence-bound algorithm for reinforcement learning","volume":"96","author":"Radovic","year":"2021","journal-title":"Comput. Electr. Eng."},{"key":"ref_56","unstructured":"Vaswani, S., Mehrabian, A., Durand, A., and Kveton, B. (2020, January 26\u201328). Old Dog Learns New Tricks: Randomized UCB for Bandit Problems. Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics (AISTATS), Online."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1093\/biomet\/25.3-4.285","article-title":"On the likelihood that one unknown probability exceeds another in view of the evidence of two samples","volume":"25","author":"Thompson","year":"1933","journal-title":"Biometrika"},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1007\/s11036-019-01453-x","article-title":"Collaborative Thompson Sampling","volume":"25","author":"Zhu","year":"2020","journal-title":"Mobile Netw. Appl."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.neucom.2020.01.086","article-title":"Self-accelerated Thompson sampling with near-optimal regret upper bound","volume":"399","author":"Zhu","year":"2020","journal-title":"Neurocomputing"},{"key":"ref_60","doi-asserted-by":"crossref","unstructured":"Moradipari, A., Alizadeh, M., and Thrampoulidis, C. (2020, January 4\u20138). Linear Thompson Sampling Under Unknown Linear Constraints. Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, Barcelona, Spain.","DOI":"10.1109\/ICASSP40776.2020.9053865"},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"4137","DOI":"10.1109\/TAC.2019.2895253","article-title":"Thompson Sampling for Stochastic Control: The Continuous Parameter Case","volume":"64","author":"Banjevic","year":"2019","journal-title":"IEEE Trans. Autom. Control"},{"key":"ref_62","unstructured":"Cao, Y., Wen, Z., Kveton, B., and Xie, Y. (2019, January 16\u201318). Nearly Optimal Adaptive Procedure with Change Detection for Piecewise-Stationary Bandit. Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics (AISTATS), Naha, Japan."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1613\/jair.1.11407","article-title":"Sliding-Window Thompson Sampling for Non-Stationary Settings","volume":"68","author":"Trovo","year":"2020","journal-title":"J. Artif. Intell. Res."},{"key":"ref_64","doi-asserted-by":"crossref","unstructured":"Cavenaghi, E., Sottocornola, G., Stella, F., and Zanker, M. (2021). Non Stationary Multi-Armed Bandit: Empirical Evaluation of a New Concept Drift-Aware Algorithm. Entropy, 23.","DOI":"10.3390\/e23030380"},{"key":"ref_65","doi-asserted-by":"crossref","unstructured":"Galmeanu, H., and Andonie, R. (2021). Concept Drift Adaptation with Incremental-Decremental SVM. Appl. Sci., 11.","DOI":"10.3390\/app11209644"},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.knosys.2021.106749","article-title":"Semi-supervised classification on data streams with recurring concept drift and concept evolution","volume":"215","author":"Zheng","year":"2021","journal-title":"Knowledge-Based Syst."},{"key":"ref_67","doi-asserted-by":"crossref","unstructured":"Halstead, B., Koh, Y.S., Riddle, P., Pears, R., Pechenizkiy, M., Bifet, A., Olivares, G., and Coulson, G. (2021). Analyzing and repairing concept drift adaptation in data stream classification. Mach. Learn., 1\u201335.","DOI":"10.1109\/DSAA53316.2021.9564191"},{"key":"ref_68","first-page":"465","article-title":"Concept Drift Detection Based on Pre-Clustering and Statistical Testing","volume":"22","author":"Wan","year":"2021","journal-title":"J. Internet Technol."},{"key":"ref_69","first-page":"128","article-title":"Adaptive online learning for classification under concept drift","volume":"24","author":"Goel","year":"2021","journal-title":"Int. J. Comput. Sci. Eng."},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"349","DOI":"10.3390\/smartcities4010021","article-title":"Concept Drift Adaptation Techniques in Distributed Environment for Real-World Data Streams","volume":"4","author":"Mehmood","year":"2021","journal-title":"Smart Cities"},{"key":"ref_71","unstructured":"(2021, December 20). Xiamen Big Data Security Open Innovation Application Competition, Available online: https:\/\/data.xm.gov.cn\/opendata-contest\/#\/."},{"key":"ref_72","unstructured":"(2021, December 20). Gaia Data Opening Plan. Available online: https:\/\/outreach.didichuxing.com\/research\/opendata\/."}],"container-title":["ISPRS International Journal of Geo-Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2220-9964\/11\/3\/203\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:38:31Z","timestamp":1760135911000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2220-9964\/11\/3\/203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,17]]},"references-count":72,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2022,3]]}},"alternative-id":["ijgi11030203"],"URL":"https:\/\/doi.org\/10.3390\/ijgi11030203","relation":{},"ISSN":["2220-9964"],"issn-type":[{"value":"2220-9964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,17]]}}}