Suhua Wang

Dr. Suhua Wang

Changchun Humanities and Sciences College

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
12 May 2025 in Journal of King Saud University Computer and Information Sciences
Verified
Journal Article
Open access
PDF file
ZHZhen Huang
Zhen Huang
XZXiaoqian Zhou
Xiaoqian Zhou
XHXu He
Xu He
YWYangbo Wei
Yangbo Wei
WYWenkai Yang
Wenkai Yang
HLHan Li
Han Li
Anatomical landmark detection is crucial in medical image analysis, facilitating accurate diagnosis, surgical planning, and treatment evaluation. However, existing methods often struggle to simultaneously capture global context and local details while exhibiting limited generalization across diverse datasets and imaging modalities. To relieve this, we propose a hybrid model that leverages convolutional operations to capture local information and a Swin Transformer to enhance global context. Specifically, we introduce a novel U-shaped architecture, termed Convolutional Attention Swin Enhanced Landmark Detection Network (CASEMark). CASEMark integrates three key innovations: (1) a Convolutional Attention Swin Transformer module (CAST) that integrates transformer-based global context modeling with convolutional operations for local feature extraction, (2) an Enhanced Skip Attention Module (ESAM) enabling adaptive feature fusion between encoder and decoder pathways, and (3) a multi-resolution heatmap learning strategy that aggregates information across scales. This approach effectively balances global-local feature extraction with robust cross-modality generalization. Extensive experiments on four public datasets demonstrate the superiority of CASEMark. The code and datasets will be made publicly available.

31 May 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
SWSuhua Wang
Suhua Wang
HJHongjie Ji
Hongjie Ji
HSHui Sun
Hui Sun
YWYuling Wang
Yuling Wang
MLMengzhu Lu
Mengzhu Lu
HSHui Sun
Hui Sun
The goal of the recommender system is to learn the user’s preferences from the entity (user–item) historical interaction data, so as to predict the user’s ratings on new items or recommend new item sequences to users. There are two major challenges: (1) Datasets are usually sparse. The item side is often accompanied by some auxiliary information, such as attributes or context; it can help to slightly improve its representation. However, the user side is usually presented in the form of ID due to personal privacy. (2) Due to the influences of confounding factors, such as the popularity of items, users’ ratings on items often have bias that cannot be recognized by the traditional recommendation methods. In order to solve these two problems, in this paper, (1) we explore the use of a graph model to fuse the interactions between users and common rating items, that is, incorporating the “neighbor” information into the target user to enrich user representations; (2) the do() operator is used to deduce the causality after removing the influences of confounding factors, rather than the correlation of the data surface fitted by traditional machine learning. We propose the EGCI model, i.e., enhanced graph learning for recommendation via causal inference. The model embeds user relationships and item attributes into the latent semantic space to obtain high-quality user and item representations. In addition, the mixed bias implied in the rating process is calibrated by considering the popularity of items. Experimental results on three real-world datasets show that EGCI is significantly better than the baselines.

20 June 2022 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
SWSuhua Wang
Suhua Wang
ZMZhiQiang Ma
ZhiQiang Ma
XSXiaoxin Sun
Xiaoxin Sun
HZHuiNan Zhao
HuiNan Zhao
XWXiuZhuo Wei
XiuZhuo Wei
BTBo Tang
Bo Tang

1 January 2022 in STEM Education
Verified
Journal Article
Open access
PDF file
SWSuhua Wang
Suhua Wang
ZMZhiqiang Ma
Zhiqiang Ma
HJHongjie Ji
Hongjie Ji
TLTong Liu
Tong Liu
ACAnqi Chen
Anqi Chen
DZDawei Zhao
Dawei Zhao
The COVID-19 pandemic has accelerated innovations for supporting learning and teaching online. However, online learning also means a reduction of opportunities in direct communication between teachers and students. Given the inevitable diversity in learning progress and achievements for individual online learners, it is difficult for teachers to give personalized guidance to a large number of students. The personalized guidance may cover many aspects, including recommending tailored exercises to a specific student according to the student′s knowledge gaps on a subject. In this paper, we propose a personalized exercise recommendation method named causal deep learning (CDL) based on the combination of causal inference and deep learning. Deep learning is used to train and generate initial feature representations for the students and the exercises, and intervention algorithms based on causal inference are then applied to further tune these feature representations. Afterwards, deep learning is again used to predict individual students′ score ratings on exercises, from which the Top-N ranked exercises are recommended to similar students who likely need enhancing of skills and understanding of the subject areas indicated by the chosen exercises. Experiments of CDL and four baseline methods on two real-world datasets demonstrate that CDL is superior to the existing methods in terms of capturing students′ knowledge gaps in learning and more accurately recommending appropriate exercises to individual students to help bridge their knowledge gaps.

1 January 2023 in Electronic Research Archive
Verified
Journal Article
Open access
PDF file
BZBingjie Zhang
Bingjie Zhang
JYJunchao Yu
Junchao Yu
ZKZhe Kang
Zhe Kang
TWTianyu Wei
Tianyu Wei
XLXiaoyu Liu
Xiaoyu Liu
SWSuhua Wang
Suhua Wang
Collaborative filtering is one of the most widely used methods in recommender systems. In recent years, Graph Neural Networks (GNN) were naturally applied to collaborative filtering methods to model users' preference representation. However, empirical research has ignored the effects of different items on user representation, which prevented them from capturing fine-grained users' preferences. Besides, due to the problem of data sparsity in collaborative filtering, most GNN-based models conduct a large number of graph convolution operations in the user-item graph, resulting in an over-smoothing effect. To tackle these problems, Adaptive Preference Retention Graph Convolutional Collaborative Filtering Method (APR-GCCF) was proposed to distinguish the difference among the items and capture the fine-grained users' preferences. Specifically, the graph convolutional method was applied to model the high-order relationship on the user-item graph and an adaptive preference retention mechanism was used to capture the difference between items adaptively. To obtain a unified users' preferences representation and alleviate the over-smoothing effect, we employed a residual preference prediction mechanism to concatenate the representation of users' preferences generated by each layer of the graph neural network. Extensive experiments were conducted based on three real datasets and the experimental results demonstrate the effectiveness of the model.

4 February 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
XSXiaoxin Sun
Xiaoxin Sun
LGLiqiu Gong
Liqiu Gong
ZHZhichao Han
Zhichao Han
PZPeng Zhao
Peng Zhao
JYJunchao Yu
Junchao Yu
SWSuhua Wang
Suhua Wang
All current recommendation algorithms, when modeling user–item interactions, basically use dot product. This dot product calculation is derived from matrix factorization. We argue that an inherent drawback of matrix factorization is that latent semantic vectors of users or items sometimes do not satisfy triangular inequalities, which may affect the performance of the recommendation. Recently, metric factorization was proposed to replace matrix factorization and has achieved some improvements in terms of recommendation accuracy. However, similar to matrix factorization, metric factorization still uses a simple, linear fashion. In this paper, we explore leveraging nonlinear deep neural networks to realize Euclidean distance interaction between users and items. We propose a generic Neural Metric Factorization Framework (NMetricF), which learns representations for users and items by incorporating Euclidean metric factorization into deep neural networks. Extensive experiments on six real-world datasets show that, compared to the previous recommendation algorithms based purely on rating data, NMetricF achieves the best performance.