Liangmin Guo

Liangmin Guo

Auto-generated profile, based on publicly available information

Liangmin Guo

School of Computer and Information, Anhui Normal University, Wuhu, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
6 May 2022 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
Xiaoyao ZhengXiaoyao Zheng
Xiaoyao Zheng
MGManping Guan
Manping Guan
XJXianmin Jia
Xianmin Jia
LGLiangmin Guo
Liangmin Guo
YLYonglong Luo
Yonglong Luo
The recommendation system (RS) predicts user ratings by collecting user information, but the users’ private information may be exposed in this process. Thus, it is crucial to achieving a balance between recommendation performance and privacy-preserving of RSs. Aiming to solve the above problem, this article proposes a novel matrix factorization (MF) algorithm. The algorithm predicts the user rating through a linear weighting of global average rating, item average rating, user average rating, and MF, which improves the prediction accuracy. Then, based on the above algorithm, this article proposes a MF RS for preserving user privacy by using local differential privacy technology. In this algorithm, the rating data are normalized on the user side to reduce global sensitivity. Then, Laplace noise is added to sensitive data before it is sent to the aggregator. Finally, based on the disturbed data, rating prediction is realized by using the MF algorithm. The proposed method is compared with five well-known recommendation methods on four public datasets. The experimental results show that the proposed algorithm achieves better recommendation performance at the same privacy-preserving level.

14 July 2018 in Journal of Intelligent Information Systems
Verified
Journal Article
Closed access
PDF file
LGLiangmin Guo
Liangmin Guo
JLJiakun Liang
Jiakun Liang
YZYing Zhu
Ying Zhu
YLYonglong Luo
Yonglong Luo
LSLiping Sun
Liping Sun
Xiaoyao ZhengXiaoyao Zheng
Xiaoyao Zheng

26 February 2024 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Closed access
Xiaoyao ZhengXiaoyao Zheng
Xiaoyao Zheng
XLXingwang Li
Xingwang Li
Zhenghua ChenZhenghua Chen
Zhenghua Chen
LSLiping Sun
Liping Sun
QYQingying Yu
Qingying Yu
YLYonglong Luo
Yonglong Luo
Compared with traditional recommendation algorithms based on collaborative filtering and content, the sequential recommendation can better capture changes in user interests and recommend items that may be interacted with by the next time according to the user's historical interaction behaviors. Generally, there are several traditional methods for sequential recommendation: Markov Chain (MC) and Deep Neutral Network (DNN), both of which ignore the relationship between various behaviors and the dynamic changes of user interest in items over time. Furthermore, the early research methods usually deal with the user's historical interaction behavior in chronological order, which may cause the loss of partial preference information. According to the perspective that user preferences will change over time, this paper proposes a long and short-term sequential recommendation model with the enhanced self-attention network, RP-SANRec. The short-term intent module of RP-SANRec uses the Gated Recurrent Unit (GRU) to learn the comprehensive historical interaction sequence of the user to calculate the position weight information in the time order, which can be used to enhance the input of the self-attention mechanism. The long-term module captures the user's preferences through a bidirectional long and short-term memory network (Bi-LSTM). Finally, the user's dynamic interests and general preferences are fused, and the following recommendation result is predicted. This article applies the RP-SANRec model to three different public datasets under two evaluation indicators of HR@10 and NDCG@10. The extensive experiments proved that our proposed RP-SANRec model performs better than existing models.

26 December 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
LGLiangmin Guo
Liangmin Guo
SZShiming Zhou
Shiming Zhou
HTHaiyue Tang
Haiyue Tang
Xiaoyao ZhengXiaoyao Zheng
Xiaoyao Zheng
YLYonglong Luo
Yonglong Luo
Most current session-based recommendations model session sequences solely based on the user's target behavior, ignoring the user's hidden preferences in auxiliary behaviors. Additionally, they use ordinary graphs to model one-to-one item correlations in the current session and fail to leverage other sessions to learn richer higher-order item correlations. To address these issues, a multi-behavior hypergraph contrastive learning model for session-based recommendations is proposed. This model represents all the sessions as global hypergraphs according to two types of behavior sequences. It employs contrastive learning to obtain global item embeddings, which are further aggregated to generate a global session representation that captures higher-order correlations of items from all session perspectives. A novel local heterogeneous hypergraph is designed for the current session to capture higher-order correlations between items with different behaviors in the current session, thus enhancing the local session representation. Additionally, a novel self-supervised signal is created by constructing a multi-behavior line graph, enhancing the global session representation. Finally, the local session representation, global session representation, and global item embedding are used to learn the predicted interaction probability of each item. Extensive experiments are conducted on three real datasets, and the results demonstrate that the proposed model significantly improves recommendation accuracy.

22 July 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
LGLiangmin Guo
Liangmin Guo
LSLi Sun
Li Sun
RJRong Jiang
Rong Jiang
YLYonglong Luo
Yonglong Luo
XZXiaoyao Zheng
Xiaoyao Zheng

28 December 2017 in IEEE Access
Verified
Journal Article
Open access
LGLiangmin Guo
Liangmin Guo
GHGuiyin Hu
Guiyin Hu
YDYan Dong
Yan Dong
YLYonglong Luo
Yonglong Luo
YZYing Zhu
Ying Zhu
To reduce energy consumption and balance the resource load of physical machines (PMs) in cloud data centers, we present a game-based consolidation method of virtual machines (VMs) with energy and load (applied load) constraints. First, we test every measured value of the resource load using a t-test to filter outliers. Based on these values, the future resource load is forecast using gray theory. Second, all online PMs are grouped by the number of VMs on them and their future load values. Based on the groupings, a pre-processing algorithm for selecting destination PMs is proposed to determine a set of destination PMs for a VM awaiting migration. Finally, we select the final destination PM for the VM using game-based methods aimed at optimizing overall energy consumption. The experimental results show that our method can reduce energy consumption as well as balance loads without unnecessarily increasing the number of VM migrations.