Zehao Wang

Zehao Wang

Auto-generated profile, based on publicly available information

Zehao Wang

College of Intelligence and Computing, Tianjin University, Tianjin, China

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
23 October 2023 in IEEE Transactions on Artificial Intelligence
Verified
Journal Article
Closed access
ZWZehao Wang
Zehao Wang
Jin FanJin Fan
Jin Fan
Huifeng WuHuifeng Wu
Huifeng Wu
Danfeng SunDanfeng Sun
Danfeng Sun
Jia WUJia WU
Jia WU
Multivariate long-term time-series forecasting tasks are very challenging tasks in many real-world application areas. Recently, researchers focus on designing robust and effective methods, and have made considerable progress. However, there are several issues with existing models that need to be overcome. First, the lack of a relationship structure between multivariate variables needs to be addressed. Second, most models only have a weak ability to capture local dynamic changes across the entire long-term time-series. Third, current models suffer from high computational complexity and unsatisfactory accuracy. To figure out the above issues, we propose an effective and efficient method called Multi-view Time-series Graph Structure Representation (MTGSR). MTGSR uses GCNs to construct topological relationships in the multivariate time-series from three different perspectives: time, dimension, and crossing segments. Variation trends in different dimensions are extracted through a difference operation to construct topological maps that reflect the correlations between different dimensions. To capture the dynamically changing characteristics of fluctuation correlations between adjacent local sequences, MTGSR constructs a cross graph by calculating correlation coefficients between adjacent local sequences. Extensive experiments show that MTGSR reduces errors by 17.41% over the state-of-the-art. Additionally, memory use is decreased by 66.52% and the running time is reduced by 78.09%.

23 December 2022 in IEEE Transactions on Emerging Topics in Computing
Verified
Journal Article
Closed access
Jin FanJin Fan
Jin Fan
ZWZehao Wang
Zehao Wang
Danfeng SunDanfeng Sun
Danfeng Sun
Huifeng WuHuifeng Wu
Huifeng Wu
Forecasting long sequence time series plays a crucial role in many applications such as anomaly detection and financial predictions. Achieving consistently good results requires a model that can precisely capture the long-range dependencies in input sequences. And very few current models can meet the requirements. Informer has recently demonstrated state-of-the-art accuracy in LSTF. Yet several other aspects of its performance leave much room for improvement. These include: 1) complexity - Informer has a relatively high computational complexity and a high memory overhead; 2) nuance - there is limited ability to capture the subtle features in a data stream; 3) interpretability - the inference procedure of Informer is not explainable; 4) extensibility - accuracy is poor with extra-long multivariate time series. To address these issues, we propose a suite of models under the banner Sepformer. The set comprises Sepformer and two variants SWformer and Mini-SWformer. Sepformer uses separate networks to extract data stream features in parallel. SWformer and Mini-SWformer dramatically separate high-frequency and low-frequency components to process the data stream and reduce the requirement for GPU memory by adopting a discrete wavelet transform. Extensive experiments show that the Sepformer models substantially outperform state-of-the-art methods in terms of accuracy, computational complexity and usage of GPU memory use.

15 November 2022 in Future Generation Computer Systems
Verified
Journal Article
Closed access
ZWZehao Wang
Zehao Wang
HWHuifeng Wu
Huifeng Wu
Jin FanJin Fan
Jin Fan
Danfeng SunDanfeng Sun
Danfeng Sun
Jia WUJia WU
Jia WU

21 October 2024
Verified
Conference Paper
Open access
LWLanjun Wang
Lanjun Wang
ZWZehao Wang
Zehao Wang
LWLe Wu
Le Wu
ALAnan Liu
Anan Liu
The surge in detecting fake news on social networks leads to increased research attention, particularly in the realm of deep learning models based on graph neural networks (GNNs). However, as research progresses, concerns emerge about the vulnerability of these detection models. In this study, we introduce an attack problem that perturbs user-news engagements by injecting bots to shield the targeted fake news from being detected by GNN-based fake news detection models. We propose a black-box attack method named Query-enhanced Surrogate-based Attack under Assortativity Constraint (QSA-AC) to work for this attack problem. QSA-AC combines surrogate-based and query-based approaches to improve attack effectiveness. At the same time, QSA-AC maintains a balance between attack effectiveness and imperceptibility by adjusting the local fluctuations of the assortativity with respect to the news on the social network. In addition, we introduce an evaluation metric, local strength assortativity perturbation rate (LSAPR), to assess the imperceptibility of the attack from the local perspective. Extensive experiments on two fake news datasets demonstrate that the proposed QSA-AC can achieve the optimal attack effectiveness, and control the trade-off between the attack effectiveness and imperceptibility.

25 July 2022 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
Jin FanJin Fan
Jin Fan
XYXiaofeng Yu
Xiaofeng Yu
ZWZehao Wang
Zehao Wang
WWWeijie Wang
Weijie Wang
Danfeng SunDanfeng Sun
Danfeng Sun
Huifeng WuHuifeng Wu
Huifeng Wu

8 October 2023
Verified
Book Chapter
Closed access
PDF file
LLLishuang Li
Lishuang Li
HCHuxiong Chen
Huxiong Chen
XQXueyang Qin
Xueyang Qin
ZWZehao Wang
Zehao Wang
JDJiangyuan Dong
Jiangyuan Dong