Zhiwei Yang 0005

dblp:78/8054-5 · DBLP profile ↗
← Back
19ranked-venue papers
7as first author
18since 2021 · last 2026
0000-0002-0534-158XORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 14 · 5 first-author · 13 since 2021Databases, data management, data science and information retrieval · 5 · 1 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2026 A Graph-Enhanced Defense Framework for Explainable Fake News Detection with LLM
abstract
Explainable fake news detection aims to assess the veracity of news claims while providing human-friendly explanations. Existing methods incorporating investigative journalism are often inefficient and struggle with breaking news. Recent advances in large language models (LLMs) enable leveraging externally retrieved reports as evidence for detection and explanation generation, but unverified reports may introduce inaccuracies. Moreover, effective explainable fake news detection should provide a comprehensible explanation for all aspects of a claim to assist the public in verifying its accuracy. To address these challenges, we propose a graph-enhanced defense framework (G-Defense) that provides fine-grained explanations based solely on unverified reports. Specifically, we construct a claim-centered graph by decomposing the news claim into several sub-claims and modeling their dependency relationships. For each sub-claim, we use the retrieval-augmented generation (RAG) technique to retrieve salient evidence and generate competing explanations. We then introduce a defense-like inference module based on the graph to assess the overall veracity. Finally, we prompt an LLM to generate an intuitive explanation graph. Experimental results demonstrate that G-Defense achieves state-of-the-art performance in both veracity detection and the quality of its explanations.
Bo Wang 0069, Jing Ma 0004, Hongzhan Lin 0001, Zhiwei Yang 0005, Ruichao Yang, Yuan Tian 0016, Yi Chang 0001
ACM Trans. Inf. Syst.4
2025 Local-Global Cascaded Ensemble Learning on Hybrid Experts for Knowledge Concept Tagging
Zhiwei Yang 0005, Jiahua Yang, Longtao Wang, Rongxin Huo, Huiru Lin
AIED (4)1
2025 Enhancing Prompting with Deep Understanding and Extended Reasoning for Solving Mathematical Problems
Zhiwei Yang 0005, Rongxin Huo, Jiahua Yang, Longtao Wang
ICONIP (1)1
2025 The Imitation Game revisited: A comprehensive survey on recent advances in AI-generated text detection
Zhiwei Yang 0005, Zhengjie Feng, Rongxin Huo, Huiru Lin, Hanghan Zheng, Ruichi Nie, Hongrui Chen
Expert Syst. Appl.1
2025 SD-Meta: The Software-Defined Network of Human-Centric Metaverse for Multi-Lead or Multi-Media Data in Spread Spectrum Communications
abstract
This study proposes the concept of an adjacent two-end or multi-end link of a software-defined network to support the transmission of data from electroencephalogram as well as audio and video streaming through spread spectrum communications. Instead of solving the problem of the software-defined scheme of prioritization in networking-related calculation and communication, we identify the southbound–northbound structure of current neural or informational networks in control and perceptual interactions. The proposed framework of multi-lead and multi-media structures allows the human-centric metaverse to execute different operations for local and global planning schemes based on the transmission of high-speed lead or media-related data through spread spectrum streaming. This depends on the kind of brain–computer interaction and is similar to the system of multi-modal perception in routing or switching. First, we design the field-programmable gate array for conventional routing nodes used in computation by different neural networks. Second, we demonstrate its enhanced applicability with a software core for multiple routers in the computational power network of the Internet of Brains in different brain–computer smart terminals. The results of simulations verified the benefits of the proposed model and structure and revealed a variety of important operational indicators.
Mingyang Li 0006, Jingze Tong, Linlin Li 0006, Zhiwei Yang 0005
ACM Trans. Multim. Comput. Commun. Appl.5
2024 Explainable Fake News Detection with Large Language Model via Defense Among Competing Wisdom
abstract
Most fake news detection methods learn latent feature representations based on neural networks, which makes them black boxes to classify a piece of news without giving any justification. Existing explainable systems generate veracity justifications from investigative journalism, which suffer from debunking delayed and low efficiency. Recent studies simply assume that the justification is equivalent to the majority opinions expressed in the wisdom of crowds. However, the opinions typically contain some inaccurate or biased information since the wisdom of crowds is uncensored. To detect fake news from a sea of diverse, crowded and even competing narratives, in this paper, we propose a novel defense-based explainable fake news detection framework. Specifically, we first propose an evidence extraction module to split the wisdom of crowds into two competing parties and respectively detect salient evidences. To gain concise insights from evidences, we then design a prompt-based module that utilizes a large language model to generate justifications by inferring reasons towards two possible veracities. Finally, we propose a defense-based inference module to determine veracity via modeling the defense among these justifications. Extensive experiments conducted on two real-world benchmarks demonstrate that our proposed method outperforms state-of-the-art baselines in terms of fake news detection and provides high-quality justifications.
Bo Wang 0069, Jing Ma 0004, Hongzhan Lin 0001, Zhiwei Yang 0005, Ruichao Yang, Yuan Tian 0016, Yi Chang 0001
WWW4
2024 Towards low-resource rumor detection: Unified contrastive transfer with propagation structure
Hongzhan Lin 0001, Jing Ma 0004, Ruichao Yang, Zhiwei Yang 0005, Mingfei Cheng
Neurocomputing4
2024 CoTea: Collaborative teaching for low-resource named entity recognition with a divide-and-conquer strategy
Zhiwei Yang 0005, Jing Ma 0004, Huiru Lin, Hechang Chen, Ruichao Yang, Yi Chang 0001
Inf. Process. Manag.1
2024 Uncertainty-Aware Contrastive Learning for semi-supervised named entity recognition
Zhiwei Yang 0005, Songwei Zhao, Zhejian Yang, Sinuo Zhang, Hechang Chen
Knowl. Based Syst.2
2024 Context-Aware Attentive Multilevel Feature Fusion for Named Entity Recognition
abstract
In the era of information explosion, named entity recognition (NER) has attracted widespread attention in the field of natural language processing, as it is fundamental to information extraction. Recently, methods of NER based on representation learning, e.g., character embedding and word embedding, have demonstrated promising recognition results. However, existing models only consider partial features derived from words or characters while failing to integrate semantic and syntactic information, e.g., capitalization, inter-word relations, keywords, and lexical phrases, from multilevel perspectives. Intuitively, multilevel features can be helpful when recognizing named entities from complex sentences. In this study, we propose a novel attentive multilevel feature fusion (AMFF) model for NER, which captures the multilevel features in the current context from various perspectives. It consists of four components to, respectively, capture the local character-level (CL), global character-level (CG), local word-level (WL), and global word-level (WG) features in the current context. In addition, we further define document-level features crafted from other sentences to enhance the representation learning of the current context. To this end, we introduce a novel context-aware attentive multilevel feature fusion (CAMFF) model based on AMFF, to fully leverage document-level features from all the previous inputs. The obtained multilevel features are then fused and fed into a bidirectional long short-term memory (BiLSTM)-conditional random field (CRF) network for the final sequence labeling. Extensive experiments on four benchmark datasets demonstrate that our proposed AMFF and CAMFF models outperform a set of state-of-the-art baseline methods and the features learned from multiple levels are complementary.
Zhiwei Yang 0005, Jing Ma 0004, Hechang Chen, Jiawei Zhang 0001, Yi Chang 0001
IEEE Trans. Neural Networks Learn. Syst.1
2023 The Sufficiency of Off-Policyness and Soft Clipping: PPO Is Still Insufficient according to an Off-Policy Measure
abstract
The popular Proximal Policy Optimization (PPO) algorithm approximates the solution in a clipped policy space. Does there exist better policies outside of this space? By using a novel surrogate objective that employs the sigmoid function (which provides an interesting way of exploration), we found that the answer is "YES", and the better policies are in fact located very far from the clipped space. We show that PPO is insufficient in "off-policyness", according to an off-policy metric called DEON. Our algorithm explores in a much larger policy space than PPO, and it maximizes the Conservative Policy Iteration (CPI) objective better than PPO during training. To the best of our knowledge, all current PPO methods have the clipping operation and optimize in the clipped policy space. Our method is the first of this kind, which advances the understanding of CPI optimization and policy gradient methods. Code is available at https://github.com/raincchio/P3O.
Xing Chen 0022, Dongcui Diao, Hechang Chen, Hengshuai Yao, Haiyin Piao, Zhixiao Sun, Zhiwei Yang 0005, Randy Goebel, Bei Jiang, Yi Chang 0001
AAAI7
2023 WSDMS: Debunk Fake News via Weakly Supervised Detection of Misinforming Sentences with Contextualized Social Wisdom
abstract
In recent years, we witness the explosion of false and unconfirmed information (i.e., rumors) that went viral on social media and shocked the public.Rumors can trigger versatile, mostly controversial stance expressions among social media users.Rumor verification and stance detection are different yet relevant tasks.Fake news debunking primarily focuses on determining the truthfulness of news articles, which oversimplifies the issue as fake news often combines elements of both truth and falsehood.Thus, it becomes crucial to identify specific instances of misinformation within the articles.In this research, we investigate a novel task in the field of fake news debunking, which involves detecting sentence-level misinformation.One of the major challenges in this task is the absence of a training dataset with sentence-level annotations regarding veracity.Inspired by the Multiple Instance Learning (MIL) approach, we propose a model called Weakly Supervised Detection of Misinforming Sentences (WSDMS).This model only requires bag-level labels for training but is capable of inferring both sentence-level misinformation and article-level veracity, aided by relevant social media conversations that are attentively contextualized with news sentences.We evaluate WSDMS on three real-world benchmarks and demonstrate that it outperforms existing stateof-the-art baselines in debunking fake news at both the sentence and article levels.News Title: NASA Will Pay You 100,000 USD To Stay In Bed For 60 Days!News Article: 𝑠 !: Wouldn't you just love to carry on sleeping on a Monday morning without having to submit to the Monday morning blues and get ready for work?𝑠 " : What type of heaven would you envisage if you were paid to stay in bed 𝑠 # : You can get paid a huge sum of money just staying in bed for two whole months and by you know who, NASA no less!!! yes the American space agency NASA is paying $100,000 to stay in bed for 60 days.𝑠 $ : Most of us dream about hanging out in bed, all day, every day.𝑠 % : NASA is currently on the lookout for people to participate in their "Bed Rest Studies", in which participants will have to stay in bed for 60 days straight.𝑠 & : It does sound like the dream job, right?… 𝑠 ' : You wouldn't just be sleeping you can keep yourself occupied with books, TV, video games, and they can also use their phones as they please… Only $100,000?Not good enough.…
Ruichao Yang, Wei Gao 0001, Jing Ma 0004, Hongzhan Lin 0001, Zhiwei Yang 0005
EMNLP5
2022 A Coarse-to-fine Cascaded Evidence-Distillation Neural Network for Explainable Fake News Detection
abstract
Existing fake news detection methods aim to classify a piece of news as true or false and provide veracity explanations, achieving remarkable performances. However, they often tailor automated solutions on manual fact-checked reports, suffering from limited news coverage and debunking delays. When a piece of news has not yet been fact-checked or debunked, certain amounts of relevant raw reports are usually disseminated on various media outlets, containing the wisdom of crowds to verify the news claim and explain its verdict. In this paper, we propose a novel Coarse-to-fine Cascaded Evidence-Distillation (CofCED) neural network for explainable fake news detection based on such raw reports, alleviating the dependency on fact-checked ones. Specifically, we first utilize a hierarchical encoder for web text representation, and then develop two cascaded selectors to select the most explainable sentences for verdicts on top of the selected top-K reports in a coarse-to-fine manner. Besides, we construct two explainable fake news datasets, which is publicly available. Experimental results demonstrate that our model significantly outperforms state-of-the-art detection baselines and generates high-quality explanations from diverse evaluation perspectives.
Zhiwei Yang 0005, Jing Ma 0004, Hechang Chen, Hongzhan Lin 0001, Yi Chang 0001
COLING1
2022 AMIF: A Hybrid Model for Improving Fact Checking in Product Question Answering
abstract
Fact checking in product-related community question answering is the task of verifying the truthfulness of an answer towards a given question, where the study has just begun. Most existing related work has focused on tailoring solutions to shallow feature fusion for the single-text claim involved with fact-checked evidence, limiting their success and generality in such answer truthfulness prediction task on E-commerce platforms. In this study, we propose an attention-based hybrid framework for multi-feature interaction fusion to determine the truthfulness of the answer towards a product-related question in E-commerce, which could not only support fine-grained semantic calibration between question-answer pairs for better understanding of the target answers, but also substantially cross-check all retrieved evidence to mine coherent opinions towards the pair. In addition, our framework further integrates non-textual features from metadata for improving performance. Extensive experiments conducted on real-world representative benchmark data show that our proposed model achieves superior performance on the task of answer veracity prediction.
Hongzhan Lin 0001, Jing Ma 0004, Zhiwei Yang 0005, Guang Chen 0003
IJCNN4
2022 LAM: Lightweight Attention Module
Qiwei Ji, Bo Yu 0013, Zhiwei Yang 0005, Hechang Chen
KSEM (2)3
2021 Rumor Detection on Twitter with Claim-Guided Hierarchical Graph Attention Networks
abstract
Rumors are rampant in the era of social media.Conversation structures provide valuable clues to differentiate between real and fake claims.However, existing rumor detection methods are either limited to the strict relation of user responses or oversimplify the conversation structure.In this study, to substantially reinforces the interaction of user opinions while alleviating the negative impact imposed by irrelevant posts, we first represent the conversation thread as an undirected interaction graph.We then present a Claim-guided Hierarchical Graph Attention Network for rumor classification, which enhances the representation learning for responsive posts considering the entire social contexts and attends over the posts that can semantically infer the target claim.Extensive experiments on three Twitter datasets demonstrate that our rumor detection method achieves much better performance than stateof-the-art methods and exhibits a superior capacity for detecting rumors at early stages.
Hongzhan Lin 0001, Jing Ma 0004, Mingfei Cheng, Zhiwei Yang 0005, Guang Chen 0003
EMNLP (1)4
2021 Structure-Enhanced Graph Representation Learning for Link Prediction in Signed Networks
Yunke Zhang, Zhiwei Yang 0005, Bo Yu 0013, Hechang Chen, Yang Li 0030, Xuehua Zhao
KSEM2
2021 Bringing order to episodes: Mining timeline in social media
Zhiwei Yang 0005, Yi Chang 0001
Neurocomputing2
2020 Attention-based Multi-level Feature Fusion for Named Entity Recognition
abstract
Named entity recognition (NER) is a fundamental task in the natural language processing (NLP) area. Recently, representation learning methods (e.g., character embedding and word embedding) have achieved promising recognition results. However, existing models only consider partial features derived from words or characters while failing to integrate semantic and syntactic information (e.g., capitalization, inter-word relations, keywords, lexical phrases, etc.) from multi-level perspectives. Intuitively, multi-level features can be helpful when recognizing named entities from complex sentences. In this study, we propose a novel framework called attention-based multi-level feature fusion (AMFF), which is used to capture the multi-level features from different perspectives to improve NER. Our model consists of four components to respectively capture the local character-level, global character-level, local word-level, and global word-level features, which are then fed into a BiLSTM-CRF network for the final sequence labeling. Extensive experimental results on four benchmark datasets show that our proposed model outperforms a set of state-of-the-art baselines.
Zhiwei Yang 0005, Hechang Chen, Jiawei Zhang 0001, Jing Ma 0004, Yi Chang 0001
IJCAI1