Libin Zheng

Libin Zheng

Auto-generated profile, based on publicly available information

Libin Zheng

Sun Yat-sen University, Zhuhai, Guangdong, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 January 2022 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
LZLibin Zheng
Libin Zheng
LCLei Chen
Lei Chen
PCPeng Cheng
Peng Cheng

21 June 2018 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
LZLibin Zheng
Libin Zheng
LCLei Chen
Lei Chen
The increasing popularity of crowdsourcing markets enables the application of crowdsourcing classification tasks. How to conduct quality control in such an application to achieve accurate classification results from noisy workers is an important and challenging task, and has drawn broad research interests. However, most existing works do not exploit the label acquisition phase, which results in their disability of making a proper budget allocation. Moreover, some works impractically make the assumption of managing workers, which is not supported by common crowdsourcing platforms such as AMT or CrowdFlower. To overcome these drawbacks, in this paper, we devise a DLTA (Dynamic Label Acquisition and Answer Aggregation) framework for crowdsourcing classification tasks. The framework proceeds in a sequence of rounds, adaptively conducting label inference and label acquisition. In each round, it analyzes the collected answers of previous rounds to perform proper budget allocation, and then issues the resultant query to the crowd. To support DLTA, we propose a generative model for the collection of labels, and correspondingly strategies for label inference and budget allocation. Experimental results show that compared with existing methods, DLTA obtains competitive accuracy in the binary case. Besides, its extended version, which plugs in the state-of-the-art inference technique, achieves the highest accuracy.


16 January 2019 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
LZLibin Zheng
Libin Zheng
LCLei Chen
Lei Chen
Recently, spatial crowdsourcing has drawn increasing attention with its great potential in collecting geographical knowledge. The system throughput and workers' travel distance are two of many important factors in spatial crowdsourcing, and improving one of them usually means sacrificing the other. However, existing works either fail to consider the trade-off between these two factors or resolve their conflicts by simply targeting tasks within a bounding circle for each worker. In this paper, we compromise between the throughput and the distance by formulating these two factors as score terms in the objective function. This flexible formulation has advantages of abandoning distant tasks and minimizing workers' travel distance for reachable tasks. Apart from that, we study the multi-campaign scenario in our problem, which is not uncommon in practical applications while not yet discussed in existing works. The worker diversity of the campaigns is considered as another goal and formulated as another score term in the objective function. Subsequently, the problem of multi-campaign oriented spatial crowdsourcing is to maximize the objective function comprised by the aforementioned score terms. We prove that the problem is NP-hard, thus, we propose several approximation solutions. Extensive experiments have been conducted to confirm the effectiveness and the efficiency of the devised solutions.

1 July 2021 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
PCPeng Cheng
Peng Cheng
JJJiabao Jin
Jiabao Jin
LCLei Chen
Lei Chen
XLXuemin Lin
Xuemin Lin
LZLibin Zheng
Libin Zheng
With the rapid development of smart mobile devices, the car-hailing platforms (e.g., Uber or Lyft) have attracted much attention from the academia and the industry. In this paper, we consider a dynamic car-hailing problem, namely maximum revenue vehicle dispatching (MRVD), in which rider requests dynamically arrive and drivers need to serve riders such that the entire revenue of the platform is maximized. We prove that the MRVD problem is NP-hard and intractable. To handle the MRVD problem, we propose a queueing-based vehicle dispatching framework, which first uses existing machine learning models to predict the future vehicle demand of each region, then estimates the idle time periods of drivers through a double-sided queueing model for each region. With the information of the predicted vehicle demands and estimated idle time periods of drivers, we propose two batch-based vehicle dispatching algorithms to efficiently assign suitable drivers to riders such that the expected overall revenue of the platform is maximized during each batch processing. Through extensive experiments, we demonstrate the efficiency and effectiveness of our proposed approaches over both real and synthetic datasets. In summary, our methods can achieve 3% ~ 10% increase on overall revenue without sacrificing on running speed compared with the state-of-the-art solutions.

2 November 2022 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
HZHuaijie Zhu
Huaijie Zhu
WLWei Liu
Wei Liu
JYJian Yin
Jian Yin
LZLibin Zheng
Libin Zheng
XHXin Huang
Xin Huang
WLWang-Chien Lee
Wang-Chien Lee
Geo-social group queries, which return a social cohesive user group with a spatial constraint, have receive significant research interests due to their promising applications for group-based activity planning and scheduling in location-based social networks (LBSNs). However, existing studies on geo-social group queries mostly assume the users are stationary whereas in realistic LBSN application scenarios all users may continuously move over time. Thus, in this paper, we investigate the problem of continuous geo-social groups monitoring ( CGSGM ) over moving users. A challenge in answering CGSGM queries over moving users is how to efficiently update geo-social groups when users are continuously moving. To address the CGSGM problem, we first propose a baseline algorithm, namely Baseline-BB , which recomputes the new geo-social groups from scratch at each time instance by utilizing a branch and bound (BB) strategy. To improve the inefficiency of BB, we explore a new strategy, called common neighbor or neighbor expanding (CNNE), which expands the common neighbors of edges or the neighbors of users in intermediate groups to quickly produce the valid group combinations. Accordingly, another baseline algorithm, namely Baseline-CNNE , is proposed. As these baseline algorithms do not maintain intermediate results to facilitate further query processing, we develop an incremental algorithm, called incremental monitoring algorithm (IMA) , which maintains the support, common neighbors and the neighbors of current users when exploring possible user groups for further updates and query processing. Since IMA requires many times of truss decomposition when processing mutiple-users updates, we propose an improved incremental algorithm, called improved incremental monitoring algorithm (IIMA) , which performs truss decompostion only once. Moreover, we design algorithms for handling the social changes that result in insertion/deletion of some edges in the social network. Owing to the challenge in setting, an appropriate monitoring distance, we further study the top $N$ CGSGM problem, which finds top $N$ result groups at each time instance. Finally, we conduct extensive experiments using four real datasets to validate our ideas and evaluate the proposed algorithms.