Demo Data from EDBT 2026 / reviewers in the wild / expert
Fangxiao Du
dblp:273/0373
· DBLP profile ↗
3ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0003-3208-5160ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 since 2021Databases, data management, data science and information retrieval · 3 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Segmentation and scene understanding · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Smart cities and intelligent transportation · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Recommender systems · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 5 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Segmentation and scene understanding › instance segmentation
contour-based instance segmentation |
0.7 | 1 | 2023 | C-AOI: Contour-based Instance Segmentation for High-Quality Areas-of-Interest in Online Food Delivery Platform · KDD 2023 |
Computer vision › Segmentation and scene understanding
instance segmentation |
0.7 | 1 | 2023 | C-AOI: Contour-based Instance Segmentation for High-Quality Areas-of-Interest in Online Food Delivery Platform · KDD 2023 |
Smart cities and intelligent transportation › logistics
on-demand delivery |
0.4 | 1 | 2020 | Delivery Scope: A New Way of Restaurant Retrieval for On-demand Food Delivery Service · KDD 2020 |
Mathematical optimization › discrete optimization
binary integer programming |
0.1 | 1 | 2020 | Delivery Scope: A New Way of Restaurant Retrieval for On-demand Food Delivery Service · KDD 2020 |
Mathematical optimization
combinatorial optimization |
0.1 | 1 | 2020 | Delivery Scope: A New Way of Restaurant Retrieval for On-demand Food Delivery Service · KDD 2020 |
Methods — techniques the papers use, named apart from their topics
spatial computational techniques · 1.3machine learning · 1.3heuristic search · 1.3data mining · 1.3branch-and-bound · 1.3cyclic positional encoding · 0.7contour transformer · 0.7adaptive matching loss · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | C-AOI: Contour-based Instance Segmentation for High-Quality Areas-of-Interest in Online Food Delivery PlatformabstractOnline food delivery (OFD) services have become popular globally, serving people's daily needs. Precise area-of-interest (AOI) boundaries help OFD platforms determine customers' exact locations, which is crucial for maintaining consistency in delivery difficulty and providing a uniform customer experience within an AOI. Existing AOI generation methods primarily rely on predefined shapes or density-based clustering, which limits the quality of the contours. Recently, Meituan has treated the AOI contours as a binary semantic segmentation problem. Their approach involves a multi-step post-process to address the issues with boundary breaks caused by semantic segmentation models, leading to decreased quality and inefficiency in the learning process. In this paper, we propose a novel method for AOI contour generation called C-AOI (Contour-based Area-of-Interest). C-AOI is an instance segmentation model that focuses on generating high-quality AOI contours. Unlike the former method, which relies on pixel-by-pixel classification, C-AOI starts from the center point of the AOI and regresses the boundary. This approach results in a higher-quality boundary and is less computationally intensive. C-AOI first corrects errors on the contour using a local aggregation mechanism. Then, we propose a novel deforming module called the contour transformer, which captures the global geometry of the object. To enhance the positional relationship among vertices, we introduce a learnable cyclic positional encoding applied to the contour transformer. Finally, to improve the boundary details, we propose the Adaptive Matching Loss (AML) that eliminates over-smoothed boundaries and promotes optimized convergence pathways. Experimental results on real-world datasets collected from Meituan have demonstrated that C-AOI significantly improves the mask and boundary quality compared to Meituan's previous work. Moreover, Its inference speed is comparable to that of E2EC, a state-of-the-art real-time contour-based method. It is noteworthy that C-AOI has been deployed in the Meituan platform for producing AOIs. Yida Zhu, Daping Xiong, Shuiping Chen, Fangxiao Du, Jinghua Hao, Renqing He, Zhizhao Sun |
KDD | 5 |
| 2022 | Automatic generation of areas of interest using multimodal geospatial data from an on-demand food delivery platform (industrial paper)abstractOn-demand food delivery (ODFD) is booming globally. ODFD services rely heavily on accurate Areas of Interest (AOIs) data to make effective operational decisions, such as service areas of restaurants. Few methods can automatically generate AOIs with contours highly matched to geographic boundaries, so manual labeling and auditing still play a vital role in data production. Most existing studies can merely generate approximate ranges which are not accurate enough for business usage. The others, which can generate AOIs fitting geographic boundaries through map matching methods, are limited by the deficiency of road network data, as geographic boundaries contain rivers, mountains, and so on. To address this issue, we propose a novel AOI generation framework using large-scale geospatial data to generate AOIs which are closer to geographic boundaries. In our framework, we firstly extract multimodal features from satellite images, road networks as well as delivery data (customer addresses, locations, etc.), and then use a semantic segmentation model to infer pixel-level points that possibly lie within the boundaries of AOIs. After that, a contour learning method and simple post-processing are applied to fit the discrete pixel-level points to reconstruct contours of AOIs in arbitrary shapes. Experiments were conducted aiming at comparing the proposed framework with six competing methods qualitatively and quantitatively. As a result, our proposed framework performs better in generating AOIs with accurate and geometry-preserving contours. Daping Xiong, Shuiping Chen, Fangxiao Du, Renqing He, Zhizhao Sun |
SIGSPATIAL/GIS | 4 |
| 2020 | Delivery Scope: A New Way of Restaurant Retrieval for On-demand Food Delivery ServiceabstractRecently on-demand food delivery service has become very popular in China. More than 30 million orders are placed by eaters of Meituan-Dianping everyday. Delicacies are delivered to eaters in 30 minutes on average. To fully leverage the ability of our couriers and restaurants, delivery scope is proposed as an infrastructure product for on-demand food delivery area. A delivery scope based retrieval system is designed and built on our platform. In order to draw suitable delivery scopes for millions of restaurant partners, we propose a pioneering delivery scope generation framework. In our framework, a single delivery scope generation algorithm is proposed by using spatial computational techniques and data mining techniques. Moreover, a scope scoring algorithm and decision algorithm are proposed by utilizing machine learning models and combinatorial optimization techniques. Specifically, we propose a novel delivery scope sample generation method and use the scope related features to estimate order numbers and average delivery time in a period of time for each delivery scope. Then we formalize the candidate scopes selection process as a binary integer programming problem. Both branch&bound algorithm and a heuristic search algorithm are integrated in our system. Results of online experiments show that scopes generated by our new algorithm significantly outperform manual generated ones. Our algorithm brings more orders without hurt of users' experience. After deployed online, our system has saved thousands of hours for operation staff, and it is considered to be one of the most useful operation tools to balance demand of eaters and supply of restaurants and couriers. Xuetao Ding, Runfeng Zhang, Zhen Mao, Fangxiao Du, Guoxing Wei, Feifan Yin, Renqing He, Zhizhao Sun |
KDD | 5 |