Wenhao Ying

Wenhao Ying


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
1 February 2024 in Expert Systems with Applications
Verified
Journal Article
Closed access
ZSZhongqiang Sun
Zhongqiang Sun
WYWenhao Ying
Wenhao Ying
WZWenjin Zhang
Wenjin Zhang
SGShengrong Gong
Shengrong Gong

13 May 2022 in Frontiers in Psychology
Verified
Journal Article
Open access
XGXiaokang Gong
Xiaokang Gong
WYWenhao Ying
Wenhao Ying
SZShan Zhong
Shan Zhong
SGShengrong Gong
Shengrong Gong
With the development of Internet technology, social media platforms have become an indispensable part of people’s lives, and social media have been integrated into people’s life, study, and work. On various forums, such as Taobao and Weibo, a large number of people’s footprints are left all the time. It is these chats, comments, and other remarks with people’s emotional evaluations that make up part of public opinion. Analysis of this network public opinion is conducive to maintaining the peaceful development of society. Therefore, sentiment analysis has become a hot research field and has made great strides as one of the hot topics in the field of natural language processing. Currently, the BERT model and its variants have achieved excellent results in the field of NLP. However, these models cannot be widely used due to huge demands on computing resources. Therefore, this paper proposes a model based on the transformer mechanism, which mainly includes two parts: knowledge distillation and text augmentation. The former is mainly used to reduce the number of parameters of the model, reducing the computational cost and training time of the model, and the latter is mainly used to expand the task text so that the model can achieve excellent results in the few-sample sentiment analysis task. Experiments show that our model achieves competitive results.

29 August 2023 in IEEE Journal of Biomedical and Health Informatics
Verified
Journal Article
Closed access
QWQiong Wu
Qiong Wu
JWJun Wang
Jun Wang
ZSZongqiong Sun
Zongqiong Sun
LXLei Xiao
Lei Xiao
WYWenhao Ying
Wenhao Ying
JSJun Shi
Jun Shi
Immunotherapy is an effective way to treat non-small cell lung cancer (NSCLC). The efficacy of immunotherapy differs from person to person and may cause side effects, making it important to predict the efficacy of immunotherapy before surgery. Radiomics based on machine learning has been successfully used to predict the efficacy of NSCLC immunotherapy. However, most studies only consider the radiomic features of the individual patient, ignoring the inter-patient correlations. Besides, they usually concatenate different features as the input of a single-view model, failing to consider the complex correlation among features of multiple types. To this end, we propose a multi-view adaptive weighted graph convolutional network (MVAW-GCN) for the prediction of NSCLC immunotherapy efficacy. Specifically, we divide the radiomic features into several views according to the type of the filtered images they extracted from. We construct a graph in each view based on the radiomic features and phenotypic information. An attention mechanism is introduced to automatically assign weights to each view. Considering the view-shared and view-specific knowledge of radiomic features, we propose separable graph convolution that decomposes the output of the last convolution layer into two components, i.e., the view-shared and view-specific outputs. We maximize the consistency and enhance the diversity among different views in the learning procedure. The proposed MVAW-GCN is evaluated on 107 NSCLC patients, including 52 patients with valid efficacy and 55 patients with invalid efficacy. Our method achieved an accuracy of 77.27% and an area under the curve (AUC) of 0.7780, indicating its effectiveness in NSCLC immunotherapy efficacy prediction.

26 May 2021 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
WZWei Zhang
Wei Zhang
ZDZhaohong Deng
Zhaohong Deng
JWJun Wang
Jun Wang
KCKup-Sze Choi
Kup-Sze Choi
TZTe Zhang
Te Zhang
SWShitong Wang
Shitong Wang
Multiview fuzzy systems aim to deal with fuzzy modeling in multiview scenarios effectively and to obtain the interpretable model through multiview learning. However, current studies of multiview fuzzy systems still face several challenges, one of which is how to achieve efficient collaboration between multiple views when there are few labeled data. To address this challenge, this article explores a novel transductive multiview fuzzy modeling method. The dependency on labeled data is reduced by integrating transductive learning into the fuzzy model to simultaneously learn both the model and the labels using a novel learning criterion. Matrix factorization is incorporated to further improve the performance of the fuzzy model. In addition, collaborative learning between multiple views is used to enhance the robustness of the model. The experimental results indicate that the proposed method is highly competitive with other multiview learning methods.

2 March 2020 in IEEE Access
Verified
Journal Article
Open access
SZShan Zhong
Shan Zhong
WYWenhao Ying
Wenhao Ying
XCXuemei Chen
Xuemei Chen
QFQiMing Fu
QiMing Fu
Online context-based domains such as recommendation systems strive to promptly suggest the appropriate items to users according to the information about items and users. However, such contextual information may be not available in practical, where the only information we can utilize is users' interaction data. Furthermore, the lack of clicked records, especially for the new users, worsens the performance of the system. To address the issues, similarity measuring, one of the key techniques in collaborative filtering, as well as the online context-based multiple armed bandit mechanism, are combined. The similarity between the context of a selected item and any candidate item is calculated and weighted. An adaptive method for adjusting the weights according to the passed time from clicking is proposed. The weighted similarity is then multiplied with the action value to decide which action is optimal or the poorest. Additionally, we come up with an exploration probability equation by introducing the selected times for the poorest action and the variance of the action values, to balance the exploration and exploitation. The regret analysis is given and the upper bound of the regret is proved. Empirical studies on three benchmarks, random dataset, Yahoo!R6A, and MovieLens, demonstrate the effectiveness of the proposed method.

8 April 2024 in IEEE Transactions on Cognitive and Developmental Systems
Verified
Journal Article
Closed access
SZShan Zhong
Shan Zhong
GLGuoqiang Li
Guoqiang Li
WYWenhao Ying
Wenhao Ying
FZFuzhou Zhao
Fuzhou Zhao
XGXIE GENGSHENG
XIE GENGSHENG
GSGong Shengrong
Gong Shengrong
Video object segmentation uses the first annotated video mask to achieve consistent and precise segmentation in subsequent frames. Recently, memory-based methods have received significant attention owing to their substantial performance enhancements. However, these approaches rely on a fixed global memory strategy, which poses a challenge to segmentation accuracy and speed in the context of longer videos. To alleviate this limitation, we propose a novel semi-supervised video object segmentation model, founded on the principles of the adaptive memory network. Our proposed model adaptively extracts object features by focusing on the object area while effectively filtering out extraneous background noise. An identification mechanism is also thoughtfully applied to discern each object in multiobject scenarios. To further reduce storage consumption without compromising the saliency of object information, the outdated features residing in the memory pool are compressed into salient features through the employment of a self-attention mechanism. Furthermore, we introduce a local matching module, specifically devised to refine object features by fusing the contextual information from historical frames. We demonstrate the efficiency of our approach through experiments, substantially augmenting both the speed and precision of segmentation for long-term videos, while maintaining comparable performance for short videos. The source code is available at https://github.com/GQLi-cong/AMN .