Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Guoxing Wei

dblp:74/9196 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1

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.

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 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Smart cities and intelligent transportation › logistics
on-demand delivery
0.412020
Delivery Scope: A New Way of Restaurant Retrieval for On-demand Food Delivery Service · KDD 2020
Mathematical optimization › discrete optimization
binary integer programming
0.112020
Delivery Scope: A New Way of Restaurant Retrieval for On-demand Food Delivery Service · KDD 2020
Mathematical optimization
combinatorial optimization
0.112020
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.3
YearPublicationVenuePosition
2020 Delivery Scope: A New Way of Restaurant Retrieval for On-demand Food Delivery Service
abstract
Recently 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
KDD7
2009 Performance analysis of distributed and centralized scheduling in two-hop relaying cellular system
abstract
We consider the resource allocation of centralized and distributed scheduling in the two-hop relaying cellular system. The limited spectrum resource is one of the obstacles which conflicts with the evolution of being wider coverage and larger capacity in the wireless system. In this paper, system performance and signaling overhead are analyzed and compared. Then we propose a novel routing strategy for choosing the access link and three practical scheduling strategies. Simulation results are provided and analyzed in several scenarios, which show the benefit of adopting the relay technique.
Jian Geng, Guoxing Wei, Yafeng Wang, Dacheng Yang
PIMRC3