Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article

Nationwide Behavior-Aware Coordinates Mining From Uncertain Delivery Events

Published: 10 June 2024 Publication History

Abstract

Geocoding, associating textual addresses with corresponding GPS coordinates, is vital for many location-based services (e.g., logistics, ridesharing, and social networks). One of the most common Geocoding solutions is using commercial map services such as Google Maps. However, this is typically not practical for some location-based service providers due to real-world challenges like commercial competition and high costs (recurring fees). In this paper, we design a new cost-effective Geocoding framework to automatically infer the geographic coordinates from textual addresses. To achieve this, we take the E-Commerce logistics service as a concrete scenario and design <monospace>CoMiner</monospace>, an unsupervised coordinate inference framework based on textual address data, delivery event data, and courier trajectory data. <monospace>CoMiner</monospace> includes three main components, (1) A POI-level clustering model, (2) A Delivery Mobility Graph (<italic>DMG</italic>), and (3) A behavior-driven address ranking model. Furthermore, we design <monospace>CoMiner-W</monospace>, a coordinates mining algorithm based on WiFi data, to further enhance the effectiveness of <monospace>CoMiner</monospace>. We conduct extensive experiments on three large-scale datasets where <monospace>CoMiner</monospace> outperforms the state-of-the-art methods by 20.3&#x0025;. Moreover, we have designed an abnormal delivery event detection system based on <monospace>CoMiner</monospace> and deployed it at JD Logistics, which brings a significant reduction in abnormal delivery event rates.

References

[2]
“Cross-border e-commerce logisticstrends. 2020,” 2020. [Online]. Available: https://www.cnlogistics.com.hk/doc/CNL_intel_202011.pdf
[3]
Y. Song, J. Li, L. Chen, S. Chen, R. He, and Z. Sun, “A semantic segmentation based poi coordinates generating framework for on-demand food delivery service,” in Proc. 29th Int. Conf. Adv. Geographic Inf. Syst., 2021, pp. 379–388.
[4]
V. Srivastava, P. Tejaswin, L. Dhakad, M. Kumar, and A. Dani, “A geocoding framework powered by delivery data,” in Proc. 28th Int. Conf. Adv. Geographic Inf. Syst., 2020, pp. 568–577.
[5]
“Baidu maps. 2023,” 2023. [Online]. Available: https://map.baidu.com/
[6]
Q. Tian, F. Ren, T. Hu, J. Liu, R. Li, and Q. Du, “Using an optimized chinese address matching method to develop a geocoding service: A case study of shenzhen, China,” ISPRS Int. J. Geo- Inf., vol. 5, no. 5, 2016, Art. no.
[7]
Q. Tian, Y. Gong, M. Kang, S. Meng, and Q. Du, “A comparative evaluation of online geocoding services in China,” Geomatics Inf. Sci. Wuhan Univ., vol. 41, no. 10, pp. 1351–1358, 2016.
[8]
S. Rashidian, X. Dong, S. K. Jain, and F. Wang, “Easergeocoder: Integrative geocoding with machine learning (demo paper),” in Proc. 26th ACM SIGSPATIAL Int. Conf. Adv. Geographic Inf. Syst., 2018, pp. 572–575.
[9]
Z. Yin, A. Ma, and D. W. Goldberg, “A deep learning approach for rooftop geocoding,” Trans. GIS, vol. 23, no. 3, pp. 495–514, 2019.
[10]
M. Musleh, S. Abbar, R. Stanojevic, and M. Mokbel, “Qarta: An ML-based system for accurate map services,” in Proc. VLDB Endowment, vol. 14, no. 11, pp. 2273–2282, 2021.
[11]
S. Ruan et al., “Doing in one go: Delivery time inference based on couriers’ trajectories,” in Proc. 26th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2020, pp. 2813–2821.
[12]
Y. Zheng, “Trajectory data mining: An overview,” ACM Trans. Intell. Syst. Technol., vol. 6, no. 3, May 2015, Art. no.
[13]
Z. Huang, W. Xu, and K. Yu, “Bidirectional LSTM-CRF models for sequence tagging,” 2015,.
[14]
S. Hochreiter and J. Schmidhuber, “Long short-term memory,” Neural Computation, vol. 9, no. 8, pp. 1735–1780, 1997.
[15]
M. Ester, H.-P. Kriegel, J. Sander, and X. Xu, “A density-based algorithm for discovering clusters in large spatial databases with noise,” in Proc. 2d Int. Conf. Knowl. Discov. Data Mining, 1996, pp. 226–231.
[16]
A. Casteigts, P. Flocchini, W. Quattrociocchi, and N. Santoro, “Time-varying graphs and dynamic networks,” Int. J. Parallel, Emergent Distrib. Syst., vol. 27, no. 5, pp. 387–408, 2012.
[17]
Q. Li, Y. Zheng, X. Xie, Y. Chen, W. Liu, and W.-Y. Ma, “Mining user similarity based on location history,” in Proc. 16th ACM SIGSPATIAL Int. Conf. Adv. Geographic Inf. Syst., 2008, pp. 1–10.
[18]
B. Guo et al., “Wepos: Weak-supervised indoor positioning with unlabeled WiFi for on-demand delivery,” in Proc. ACM Interactive, Mobile, Wearable Ubiquitous Technol., vol. 6, no. 2, Jul. 2022, Art. no.
[19]
D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” 2014,.
[20]
R. Mihalcea et al., “Corpus-based and knowledge-based measures of text semantic similarity,” in Proc. AAAI Conf. Artif. Intell., 2006, pp. 775–780.
[21]
S. Kulkarni, S. Jain, M. J. Hosseini, J. Baldridge, E. Ie, and L. Zhang, “Multi-level gazetteer-free geocoding,” in Proc. 2nd Int. Combined Workshop Spatial Lang. Understanding Grounded Commun. Robot., 2021, pp. 79–88. [Online]. Available: https://aclanthology.org/2021.splurobonlp-1.9
[22]
B. J. Radford, “Regressing location on text for probabilistic geocoding,” in Proc. 4th Workshop Challenges Appl. Automated Extraction Socio-Political Events From Text, 2021, pp. 53–57. [Online]. Available: https://aclanthology.org/2021.case-1.8
[23]
T. Vu, S. Liu, R. Wang, and K. Valegerepura, “Noise prediction for geocoding queries using word geospatial embedding and bidirectional lstm,” in Proc. 28th Int. Conf. Adv. Geographic Inf. Syst., 2020, pp. 127–130.
[24]
P. Berkhin, M. R. Evans, F. Teodorescu, W. Wu, and D. Yankov, “A new approach to geocoding: BingGC,” in Proc. 23 rd SIGSPATIAL Int. Conf. Adv. Geographic Inf. Syst., New York, NY, USA: Association for Computing Machinery, 2015, pp. 1–10.
[25]
G. Forman, “Getting your package to the right place: Supervised machine learning for geolocation,” in Proc. Mach. Learn. Knowl. Discov. Databases. Appl. Data Sci. Track: Eur. Conf., Bilbao, Spain, 2021, pp. 403–419.
[26]
S. Ruan et al., “Discovering actual delivery locations from mis-annotated couriers’ trajectories,” in Proc. IEEE 38th Int. Conf. Data Eng., 2022, pp. 3241–3253.
[27]
A. Chatterjee, J. Anjaria, S. Roy, A. Ganguli, and K. Seal, “SAGEL: Smart address geocoding engine for supply-chain logistics,” in Proc. 24th ACM SIGSPATIAL Int. Conf. Adv. Geographic Inf. Syst., 2016, Art. no.
[28]
P. Roy, C. Sharma, C. Gao, and K. Valegerepura, “Deep query rewriting for geocoding,” in Proc. 32nd ACM Int. Conf. Inf. Knowl. Manage., 2023, pp. 4801–4807.
[29]
S. Maheshwary and S. Sohoney, “Learning geolocation by accurately matching customer addresses via graph based active learning,” in Proc. Companion Proc. ACM Web Conf., 2023, pp. 457–463.
[30]
“Openstreetmap. 2023,” 2023. [Online]. Available: http://nominatim.openstreetmap.org/
[31]
“Geonames. 2021,” 2021. [Online]. Available: http://www.geonames.org/
[32]
R. Zhang et al., “Map generation from large scale incomplete and inaccurate data labels,” in Proc. ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2020, pp. 2514–2522.
[33]
S. Wang, Z. Bao, J. S. Culpepper, and G. Cong, “A survey on trajectory data management, analytics, and learning,” ACM Comput. Surv., vol. 54, no. 2, Mar. 2021, Art. no.
[34]
Y. Zhao, S. Shang, Y. Wang, B. Zheng, Q. V. H. Nguyen, and K. Zheng, “Rest: A reference-based framework for spatio-temporal trajectory compression,” in Proc. ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2018, pp. 2797–2806.
[35]
H. Zhang, X. Zhang, Q. Jiang, B. Zheng, Z. Sun, and W. Sun, “Trajectory similarity learning with auxiliary supervision and optimal matching,” in Proc. Int. Joint Conf. Artif. Intell., 2020, pp. 11–17.
[36]
S. He and K. G. Shin, “Towards fine-grained flow forecasting: A graph attention approach for bike sharing systems,” in Proc. World Wide Web Conf., 2020, pp. 88–98.
[37]
Y. Luo, Q. Liu, and Z. Liu, “Stan: Spatio-temporal attention network for next location recommendation,” in Proc. World Wide Web Conf., 2021, pp. 2177–2185.
[38]
T. He et al., “POI alias discovery in delivery addresses using user locations,” in Proc. 29th Int. Conf. Adv. Geographic Inf. Syst., 2021, pp. 225–228.
[39]
E. Buckland, E. Tanin, N. Geard, C. Zachreson, H. Xie, and H. Samet, “Managing trajectories and interactions during a pandemic: A trajectory similarity-based approach (demo paper),” in Proc. 29th Int. Conf. Adv. Geographic Inf. Syst., 2021, pp. 423–426.
[40]
J. Gudmundsson, M. P. Seybold, and J. Pfeifer, “On practical nearest sub-trajectory queries under the fréchet distance,” in Proc. 29th Int. Conf. Adv. Geographic Inf. Syst., 2021, pp. 596–605.
[41]
Y. Yuan et al., “eroute: Mobility-driven integration of heterogeneous urban cyber-physical systems under disruptive events,” IEEE Trans. Mobile Comput., vol. 22, no. 2, pp. 906–922, Feb. 2023.
[42]
B. Guo et al., “Concurrent order dispatch for instant delivery with time-constrained actor-critic reinforcement learning,” in Proc. IEEE Real-Time Syst. Symp., 2021, pp. 176–187.
[43]
T. He, J. Bao, Y. Li, H. He, and Y. Zheng, “Crowd-sensing enhanced parking patrol using sharing bikes trajectories,” IEEE Trans. Knowl. Data Eng., vol. 35, no. 4, pp. 3589–3602, Apr. 2023.
[44]
M. Zhang, T. Li, and P. Hui, “Cityneuro: Towards location and time prediction for urban abnormal events,” IEEE Trans. Knowl. Data Eng., vol. 35, no. 12, pp. 12125–12138, Dec. 2023.
[45]
P. Tong, M. Li, M. Li, J. Huang, and X. Hua, “Large-scale vehicle trajectory reconstruction with camera sensing network,” in Proc. 27th Annu. Int. Conf. Mobile Comput. Netw., 2021, pp. 188–200.
[46]
S. Ruan et al., “Learning to generate maps from trajectories,” in Proc. AAAI Conf. Artif. Intell., vol. 34, no. 1, 2020, pp. 890–897.
[47]
R. Li et al., “TrajMesa: A distributed NoSQL-based trajectory data management system,” IEEE Trans. Knowl. Data Eng., vol. 35, no. 1, pp. 1013–1027, Jan. 2023.
[48]
S. Nair, K. Javkar, J. Wu, and V. Frias-Martinez, “Understanding cycling trip purpose and route choice using GPS traces and open data,” in Proc. ACM Interactive, Mobile, Wearable Ubiquitous Technol., vol. 3, no. 1, Mar. 2019, Art. no.
[49]
M. Li, P. Tong, M. Li, Z. Jin, J. Huang, and X.-S. Hua, “Traffic flow prediction with vehicle trajectories,” in Proc. AAAI Conf. Artif. Intell., 2021, pp. 294–302.
[50]
P. Zhang, Z. Bao, Y. Li, G. Li, Y. Zhang, and Z. Peng, “Trajectory-driven influential billboard placement,” in Proc. ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2018, pp. 2748–2757.
[51]
A. Das, E. S. Kolvig-Raun, and M. B. Kjærgaard, “Accurate trajectory prediction in a smart building using recurrent neural networks,” in Proc. ACM Int. Joint Conf. Pervasive Ubiquitous Comput., Proc. ACM Int. Symp. Wearable Comput., 2020, pp. 619–628.
[52]
F. Wang, Y. Zhu, F. Wang, and J. Liu, “Ridesharing as a service: Exploring crowdsourced connected vehicle information for intelligent package delivery,” in Proc. IEEE/ACM 26th Int. Symp. Qual. Service, 2018, pp. 1–10.
[53]
S. Ruan et al., “Filling delivery time automatically based on couriers’ trajectories,” IEEE Trans. Knowl. Data Eng., vol. 35, no. 2, pp. 1528–1540, Feb. 2023.
[54]
Y. Li, Q. Wu, X. Huang, J. Xu, W. Gao, and M. Xu, “Efficient adaptive matching for real-time city express delivery,” IEEE Trans. Knowl. Data Eng., vol. 35, no. 6, pp. 5767–5779, Jun. 2023.
[55]
K. Manchella, M. Haliem, V. Aggarwal, and B. Bhargava, “PassGoodPool: Joint passengers and goods fleet management with reinforcement learning aided pricing, matching, and route planning,” IEEE Trans. Intell. Transp. Syst., vol. 23, no. 4, pp. 3866–3877, Apr. 2022.
[56]
L. Chen, D. Xiong, S. Chen, F. Du, R. He, and Z. Sun, “Automatic generation of areas of interest using multimodal geospatial data from an on-demand food delivery platform (industrial paper),” in Proc. 30th Int. Conf. Adv. Geographic Inf. Syst., New York, NY, USA: Association for Computing Machinery, 2022.
[57]
B. Li et al., “Simultaneous detection of multiple areas-of-interest using geospatial data from an online food delivery platform (industrial paper),” in Proc. 30th Int. Conf. Adv. Geographic Inf. Syst., New York, NY, USA: Association for Computing Machinery, 2022, Art. no.
[58]
T. Khanna, A. Ganesan, J. Mathew, and K. M. Adusimilli, “Mining entry gates for points of interest,” in Proc. 31st ACM Int. Conf. Inf. Knowl. Manage., New York, NY, USA: Association for Computing Machinery, 2022, pp. 4114–4117.
[59]
Z. Hong et al., “Urban-scale poi updating with crowd intelligence,” in Proc. 32nd ACM Int. Conf. Inf. Knowl. Manage., New York, NY, USA: Association for Computing Machinery, 2023, pp. 4631–4638.
[60]
S. Ruan et al., “Service time prediction for delivery tasks via spatial meta-learning,” in Proc. 28th ACM SIGKDD Conf. Knowl. Discov. Data Mining, New York, NY, USA: Association for Computing Machinery, 2022, pp. 3829–3837.
[61]
H. Wen et al., “Graph2Route: A dynamic spatial-temporal graph neural network for pick-up and delivery route prediction,” in Proc. 28th ACM SIGKDD Conf. Knowl. Discov. Data Mining, New York, NY, USA: Association for Computing Machinery, 2022, pp. 4143–4152.
[62]
H. Wen et al., “Enough waiting for the couriers: Learning to estimate package pick-up arrival time from couriers’ spatial-temporal behaviors,” ACM Trans. Intell. Syst. Technol., vol. 14, no. 3, Apr. 2023, Art. no.
[63]
H. Wen et al., “Package pick-up route prediction via modeling couriers’ spatial-temporal behaviors,” in Proc. IEEE 37th Int. Conf. Data Eng., 2021, pp. 2141–2146.
[64]
B. Guo, Y. Liu, L. Wang, V. O. Li, J. C. Lam, and Z. Yu, “Task allocation in spatial crowdsourcing: Current state and future directions,” IEEE Internet Things J., vol. 5, no. 3, pp. 1749–1764, Jun. 2018.
[65]
C. Chen et al., “Crowddeliver: Planning city-wide package delivery paths leveraging the crowd of taxis,” IEEE Trans. Intell. Transp. Syst., vol. 18, no. 6, pp. 1478–1496, Jun. 2017.
[66]
Y. Pan et al., “Efficient schedule of energy-constrained UAV using crowdsourced buses in last-mile parcel delivery,” in Proc. ACM Interactive Mobile Wearable Ubiquitous Technol., vol. 5, no. 1, pp. 1–23, 2021.
[67]
W. Lyu et al., “Towards fair workload assessment via homogeneous order grouping in last-mile delivery,” in Proc. 31st ACM Int. Conf. Inf. Knowl. Manage., New York, NY, USA: Association for Computing Machinery, 2022, pp. 3361–3370.

Index Terms

  1. Nationwide Behavior-Aware Coordinates Mining From Uncertain Delivery Events
    Index terms have been assigned to the content through auto-classification.

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image IEEE Transactions on Knowledge and Data Engineering
    IEEE Transactions on Knowledge and Data Engineering  Volume 36, Issue 11
    Nov. 2024
    1887 pages

    Publisher

    IEEE Educational Activities Department

    United States

    Publication History

    Published: 10 June 2024

    Qualifiers

    • Research-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 0
      Total Downloads
    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 10 Nov 2024

    Other Metrics

    Citations

    View Options

    View options

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media