Yusheng Liu

Yusheng Liu

Auto-generated profile, based on publicly available information

Yusheng Liu

School of Artificial Intelligence and Big Data, Hefei University, Hefei, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
18 January 2025 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
LXLixiang Xu
Lixiang Xu
YLYusheng Liu
Yusheng Liu
Tong XuTong Xu
Tong Xu
ECEnhong Chen
Enhong Chen
YTYuanyan Tang
Yuanyan Tang
The application of contrastive learning (CL) to collaborative filtering (CF) in recommender systems has achieved remarkable success. CL-based recommendation models mainly focus on creating multiple augmented views by employing different graph augmentation methods and utilizing these views for self-supervised learning. However, current CL methods for recommender systems usually struggle to fully address the problem of noisy data. To address this problem, we propose the G raph A ugmentation E mpowered C ontrastive L earning (GAECL) for recommendation framework, which uses graph augmentation based on topological and semantic dual adaptation and global co-modeling via structural optimization to co-create contrasting views for better augmentation of the CF paradigm. Specifically, we strictly filter out unimportant topologies by reconstructing the adjacency matrix and mask unimportant attributes in nodes according to the PageRank centrality principle to generate an augmented view that filters out noisy data. Additionally, GAECL achieves global collaborative modeling through structural optimization and generates another augmented view based on the PageRank centrality principle. This helps to filter the noisy data while preserving the original semantics of the data for more effective data augmentation. Extensive experiments are conducted on five datasets to demonstrate the superior performance of our model over various recommendation models.

18 September 2023 in IEEE Access
Verified
Journal Article
Open access
HTHe Tong
He Tong
YLYusheng Liu
Yusheng Liu
LLLin Liu
Lin Liu
NLNing Li
Ning Li
SCSi-Bao Chen
Si-Bao Chen
YTYuanyan Tang
Yuanyan Tang
Stock index is an indicator that describes the changes in the total price level of the stock market, and it is susceptible to many dynamic factors, with such characteristics as high dimension, uncertainty, non-linearity, time delay, complexity, etc., resulting in abnormal and missing values in stock index data, which will lead to instability or unreliability of the stock index tracking model. In order to solve these problems, we take the historical stock index as the input, model the internal dynamic changes of features, and learn the change rule. Firstly, we introduce an attention mechanism, that is, to assign different weights to the implicit state of the long short term memory network (LSTM) through mapping weights and learning parameters. We further propose a stock index data preprocessing model of the LSTM based on the attention mechanism. Secondly, the group method of data handling type neural networks (GMDH-NN) is a self-organizing data mining technology, which is especially suitable for modeling complex systems. So we choose a discrete form of Kolmogorov-Gabor ( K - G ) polynomial of the first-order as the reference function of GMDH-NN to establish the general relationship between input and output variables. We further present a deep evolutionary GMDH polynomial neural network (DGMDH) to perform stock index tracking. Moreover, for a high-dimensional stock index dataset, the traditional external criterion can no longer meet the needs of reality, so we propose a tracking error external criterion (TEEC) for stock indices, which is based on the difference between allocation yield and target yield. The TEEC provides better information for selecting the optimal complex DGMDH model. Our experiments clearly show the effectiveness of our methodology.