Weichao Liang

Weichao Liang

Auto-generated profile, based on publicly available information

Weichao Liang

School of Computing and Artificial Intelligence, Southwest Jiaotong University, Chengdu, Sichuan, 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
23 April 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
LCLei Chen
Lei Chen
GZGuixiang Zhu
Guixiang Zhu
WLWeichao Liang
Weichao Liang
YWYouquan Wang
Youquan Wang

13 October 2020 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
JCJie Cao
Jie Cao
YWYouquan Wang
Youquan Wang
JHJing He
Jing He
WLWeichao Liang
Weichao Liang
HTHaicheng Tao
Haicheng Tao
GZGuixiang Zhu
Guixiang Zhu
Predicting the grain losses and waste rate (LWR) is critical for agricultural planning and grain policy development. Capturing the stage interaction and generating robust features are the main challenges in grain LWR prediction. In this paper, we propose MTGA, a Multi-Task GRU Autoencoder approach to: 1) obtain the robust feature representation for prediction task and 2) explore the time-ordered interaction among different stages of grain chain. Specifically, we propose multiple GRU encoder-decoder pairs to co-reconstruct the features in a common space for robust feature learning. Then, an attention mechanism is proposed to better fuse the reconstructed features from the GRU encoder-decoder pairs. Furthermore, we utilize the multi-task for reconstructed loss and grain LWR prediction. We introduce the reconstructed loss task as an auxiliary task to help us better represent the robust features. Besides, we propose the LWR prediction as main task to learn the parameters for prediction task. We collected the data with questionnaires, interviews or data from grain management institutes for experiments. The evaluation results show that grain LWR prediction by our approach achieves the best results compared to several state-of-the-art prediction model. Moreover, our method gains overall performance decline of 12.5%-18.3% on MAE and RMSE metrics.

20 December 2022 in ACM Transactions on the Web
Verified
Journal Article
Open access
LCLei Chen
Lei Chen
JCJie Cao
Jie Cao
WLWeichao Liang
Weichao Liang
Jia WUJia WU
Jia WU
Qiaolin YeQiaolin Ye
Qiaolin Ye
Tourism is an important industry and a popular entertainment activity involving billions of visitors per annum. One challenging problem tourists face is identifying satisfactory products from vast tourism information. Most of travel recommendation methods regard the recommendation procedure as a static process and only focus on immediate rewards. Meanwhile, they often infer user intensions from click behaviors and ignore the informative keywords of the clicked products. To this end, in this article, we present a Keywords-enhanced Deep Reinforcement Learning model (KDRL) framework. Specifically, we formalize travel recommendation as a Markov Decision Process and implement it upon the Actor–Critic framework. It integrates keyword information into the reinforcement learning–(RL) based recommendation framework by devising novel state representation and reward function and learns the travel recommendation and keywords generation simultaneously. To the best of our knowledge, this is the first time that keywords are explicitly discussed and used in RL-based travel recommendations. Extensive experiments are performed on the real-world datasets and the results clearly show the superior performance of KDRL compared with the baseline methods.

25 March 2022 in ACM Transactions on Intelligent Systems and Technology
Verified
Journal Article
Open access
WLWeichao Liang
Weichao Liang
ZWZhiang Wu
Zhiang Wu
ZLZhe Li
Zhe Li
YGYong Ge
Yong Ge
Crime poses a major threat to human life and property, which has been recognized as one of the most crucial problems in our society. Predicting the number of crime incidents in each region of a city before they happen is of great importance to fight against crime. There has been a great deal of research focused on crime prediction, ranging from introducing diversified data sources to exploring various prediction models. However, most of the existing approaches fail to offer fine-scale prediction results and take little notice of the intricate spatial-temporal-categorical correlations contained in crime incidents. In this article, we propose a tailor-made framework called CrimeTensor to predict the number of crime incidents belonging to different categories within each target region via tensor learning with spatiotemporal consistency. In particular, we model the crime data as a tensor and present an objective function which tries to take full advantage of the spatial, temporal, and categorical correlations contained in crime incidents. Moreover, a well-designed optimization algorithm which transforms the objective into a compact form and then applies CP decomposition to find the optimal solution is elaborated to solve the objective function. Furthermore, we develop an enhanced framework which takes a set of pre-selected regions to conduct prediction so as to further improve the computational efficiency of the optimization algorithm. Finally, extensive experiments are performed on both proprietary and public datasets and our framework significantly outperforms all the baselines in terms of each evaluation metric.

10 December 2024 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
WLWeichao Liang
Weichao Liang
GGGuangliang Gao
Guangliang Gao
LCLei Chen
Lei Chen
YWYouquan Wang
Youquan Wang
The goal of partial multi-label learning is to induce a multi-label classifier from partial multi-label data where each instance is annotated with a number of candidate labels but only a subset of them are valid. Many of the existing studies either fail to fully utilize instance and label correlations to eliminate noisy labels or build an over-simplified multi-label classifier, both of which are unfavorable for the improvement of generalization performance. In this article, we put forward a novel model named P ml-ilc to learn a multi-label classifier from partial multi-label data. Specifically, P ml-ilc first encodes instances and labels into a compact semantic space and takes full advantage of instance and label correlations to eliminate noisy labels. Then, it induces a linear mapping from the feature space to the label space while exploiting label-specific features and instance correlations to facilitate the multi-label classifier learning process. Finally, the above two steps are combined into a joint optimization problem and an efficient alternating optimization procedure is developed to find a satisfactory solution. Extensive experiments show that P ml-ilc achieves superior performance on both real-world and synthetic partial multi-label datasets in terms of different evaluation metrics.

6 June 2023 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
WLWeichao Liang
Weichao Liang
JCJie Cao
Jie Cao
LCLei Chen
Lei Chen
YWYouquan Wang
Youquan Wang
Jia WUJia WU
Jia WU
JTJiangnan Tang
Jiangnan Tang
The goal of crime prediction is to forecast the number of crime incidents at each region of a city based on the historical crime data. It has attracted a great deal of attention from both academic and industrial communities due to its considerable significance in improving urban safety and reducing financial losses. Although much progress has been made in this field, most of the existing approaches assume that the historical crime data are complete, which does not hold in many real-world scenarios. Meanwhile, crime incidents are affected by multiple factors and have intricate spatial, temporal, and categorical correlations, which are not fully utilized by the current methods. In this article, we propose a novel tensor decomposition based framework, named TD-Crime, to conduct prediction directly on the incomplete crime data. Specifically, we first organize the crime data as a tensor and then apply the nonnegative CP decomposition to it, which not only provides a natural solution to the missing data problem but also captures the spatial, temporal, and categorical correlations implicitly. Moreover, we attempt to exploit the spatial and temporal correlations explicitly by directly learning from the crime data to further improve the forecasting performance. Finally, we obtain a joint optimization problem and present an efficient alternating optimization scheme to find a satisfactory solution. Extensive experiments on the real-world crime datasets show that TD-Crime can address the crime prediction task effectively under different missing data scenarios.