$O^{2}$-SiteRec: Store Site Recommendation under the O2O Model via Multi-graph Attention Networks
Hua Yan, Shuai Wang, Yu Yang, Baoshen Guo, Tian He, Desheng Zhang
Abstract
The emergence of Online-to-Offline (O2O) stores based on delivery platforms (e.g., Uber Eats, DoorDash, and Eleme) provides great convenience to people's lives. In the O2O model, one of the essential problems for merchants is to select a suitable store site, i.e., store site recommendation problem. We argue that the existing works for the traditional brick-and-mortar stores cannot address this problem due to two unique factors in the O2O model including (i) dynamic supply caused by courier capacity and dispatching strategies and (ii) various customer demands caused by delivery distance and customer preferences. To incorporate these new factors, we design <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$O^{2}$</tex> SiteRec, a store site recommendation method under the O2O model via multi-graph attention networks, which consists of (i) a courier capacity model based on a multi-semantic relation graph attention network to capture courier capacity; (ii) a heterogeneous multi-graph based recommendation model, where the courier capacity, customer preferences, and context features are fused. We evaluate our method based on one-month real-world data consisting of 39,465 stores and 23.6 million orders from one of the largest O2O platforms in China. Experimental results demonstrate that our method outperforms state-of-the-art baselines in various metrics.