Delivery Time Prediction Using Large-Scale Graph Structure Learning Based on Quantile Regression

L. Zhang, Xin Zhou, Zhiwei Zeng, Yiming Cao, Yonghui Xu, Mingliang Wang, Xin Wu, Yong Liu, Li-zhen Cui, Zhiqi Shen
{"title":"Delivery Time Prediction Using Large-Scale Graph Structure Learning Based on Quantile Regression","authors":"L. Zhang, Xin Zhou, Zhiwei Zeng, Yiming Cao, Yonghui Xu, Mingliang Wang, Xin Wu, Yong Liu, Li-zhen Cui, Zhiqi Shen","doi":"10.1109/ICDE55515.2023.00261","DOIUrl":null,"url":null,"abstract":"Predicting Estimated Time of Arrival (ETA) for packages is a critical problem in e-commerce. The prediction is often made based on spatial (sending and receiving addresses), temporal (payment time), and context (merchants) attributes. Existing methods usually formalize this task as an Origin-Destination (OD) ETA prediction problem and exploit the attribute relations with graph learning. However, most existing methods make use of fixed and manually defined graph structures, which are often not optimal for downstream ETA task and hence lead to unsatisfactory prediction results. In addition, current ETA models tend to focus on prediction accuracy without considering fulfillment rate. This may lead to a low fulfillment rate in practice, i.e., actual delivery time is much longer than estimations provided by models, which consequently exacerbates the frustrating experiences for users. To address these issues, we propose a novel Graph Structure Learning-based Quantile Regression (GSL-QR) model for e-commerce ETA prediction in this paper. Specifically, we utilize graph structure learning to dynamically update the spatial and temporal relation graphs of orders and learn optimal graph structures and graph embeddings guided by downstream ETA prediction task. To guarantee both prediction accuracy and order fulfillment rate, we design a multi-objective quantile regression in GSL-QR that can find the Pareto solution of the problem. In order to extend GSL to large-scale real-world graphs, we devise a Fast Sampling-based Graph Structure Learning (FS-GSL) method, which can significantly reduce the computational complexity of graph structure learning. Finally, we conduct comprehensive experiments on three industrial datasets collected from Alibaba e-commerce platform. The results demonstrate that the proposed model can significantly outperform baselines on both ETA prediction accuracy and order fulfillment rate.","PeriodicalId":434744,"journal":{"name":"2023 IEEE 39th International Conference on Data Engineering (ICDE)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE 39th International Conference on Data Engineering (ICDE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE55515.2023.00261","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Predicting Estimated Time of Arrival (ETA) for packages is a critical problem in e-commerce. The prediction is often made based on spatial (sending and receiving addresses), temporal (payment time), and context (merchants) attributes. Existing methods usually formalize this task as an Origin-Destination (OD) ETA prediction problem and exploit the attribute relations with graph learning. However, most existing methods make use of fixed and manually defined graph structures, which are often not optimal for downstream ETA task and hence lead to unsatisfactory prediction results. In addition, current ETA models tend to focus on prediction accuracy without considering fulfillment rate. This may lead to a low fulfillment rate in practice, i.e., actual delivery time is much longer than estimations provided by models, which consequently exacerbates the frustrating experiences for users. To address these issues, we propose a novel Graph Structure Learning-based Quantile Regression (GSL-QR) model for e-commerce ETA prediction in this paper. Specifically, we utilize graph structure learning to dynamically update the spatial and temporal relation graphs of orders and learn optimal graph structures and graph embeddings guided by downstream ETA prediction task. To guarantee both prediction accuracy and order fulfillment rate, we design a multi-objective quantile regression in GSL-QR that can find the Pareto solution of the problem. In order to extend GSL to large-scale real-world graphs, we devise a Fast Sampling-based Graph Structure Learning (FS-GSL) method, which can significantly reduce the computational complexity of graph structure learning. Finally, we conduct comprehensive experiments on three industrial datasets collected from Alibaba e-commerce platform. The results demonstrate that the proposed model can significantly outperform baselines on both ETA prediction accuracy and order fulfillment rate.
基于分位数回归的大规模图结构学习交付时间预测
预测包裹的预计到达时间(ETA)是电子商务中的一个关键问题。预测通常基于空间(发送和接收地址)、时间(支付时间)和上下文(商家)属性。现有方法通常将该任务形式化为原点-目的地(OD) ETA预测问题,并利用图学习来利用属性关系。然而,大多数现有方法使用固定的和手动定义的图结构,这往往不是下游ETA任务的最佳选择,因此导致不满意的预测结果。此外,目前的ETA模型往往关注预测的准确性,而不考虑履约率。这可能会导致实践中的低完成率,即,实际交付时间比模型提供的估计时间长得多,从而加剧了用户的沮丧体验。为了解决这些问题,本文提出了一种新的基于图结构学习的分位数回归(GSL-QR)模型用于电子商务ETA预测。具体而言,我们利用图结构学习来动态更新阶次的时空关系图,并在下游ETA预测任务的指导下学习最优图结构和图嵌入。为了保证预测精度和订单完成率,我们在GSL-QR中设计了一个多目标分位数回归,可以找到问题的Pareto解。为了将GSL扩展到大规模的真实图,我们设计了一种基于快速采样的图结构学习(FS-GSL)方法,该方法可以显著降低图结构学习的计算复杂度。最后,我们对来自阿里巴巴电子商务平台的三个行业数据集进行了综合实验。结果表明,该模型在ETA预测精度和订单完成率上都明显优于基线。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信