Zhiwei Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Zhiwei Yang has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Jing Ma
Hong Kong Baptist University, Hong Kong, Hong Kong
8 shared publications - Yi Chang
Jilin University, China
5 shared publications - Hongzhan Lin
Hong Kong Baptist University, Hong Kong, Hong Kong
4 shared publications - Bo Wang
School of Artificial Intelligence, Jilin University, Changchun, China
3 shared publications - Hechang Chen
School of Artificial Intelligence, Jilin University, China
3 shared publications - Ruichao Yang
University of Science and Technology Beijing, Beijing, China
3 shared publications
Latest Publications
- Open Access
- 23 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 44 (7) , 1-2
Erratum: A Graph-Enhanced Defense Framework for Explainable Fake News Detection with LLM
This is an erratum for the article “A Graph-Enhanced Defense Framework for Explainable Fake News Detection with LLM” published in ACM Trans. Inf. Syst. 44, 5, Article 112 (June 2026), 36 pages.
- 23 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 44 (7) , 1-2
Open AccessErratum: A Graph-Enhanced Defense Framework for Explainable Fake News Detection with LLM
This is an erratum for the article “A Graph-Enhanced Defense Framework for Explainable Fake News Detection with LLM” published in ACM Trans. Inf. Syst. 44, 5, Article 112 (June 2026), 36 pages.
- Open Access
- 11 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 44 (5) , 1-36
A Graph-Enhanced Defense Framework for Explainable Fake News Detection with LLM
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.
- 11 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 44 (5) , 1-36
Open AccessA Graph-Enhanced Defense Framework for Explainable Fake News Detection with LLM
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.
- Open Access
- 30 June 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Multimedia Computing, Communications, and Applications
- Vol. 21 (6) , 1-23
SD-Meta: The Software-Defined Network of Human-Centric Metaverse for Multi-Lead or Multi-Media Data in Spread Spectrum Communications
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.
- 30 June 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Multimedia Computing, Communications, and Applications
- Vol. 21 (6) , 1-23
Open AccessSD-Meta: The Software-Defined Network of Human-Centric Metaverse for Multi-Lead or Multi-Media Data in Spread Spectrum Communications
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.
- 7 February 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 272
The Imitation Game revisited: A comprehensive survey on recent advances in AI-generated text detection
- 7 February 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 272
The Imitation Game revisited: A comprehensive survey on recent advances in AI-generated text detection
- Open Access
- 13 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 2452-2463
Explainable Fake News Detection with Large Language Model via Defense Among Competing Wisdom
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.
- 13 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 2452-2463
Open AccessExplainable Fake News Detection with Large Language Model via Defense Among Competing Wisdom
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.
- 1 May 2024
- Published by Elsevier in Knowledge-Based Systems
- Vol. 296
Uncertainty-Aware Contrastive Learning for semi-supervised named entity recognition
- 1 May 2024
- Published by Elsevier in Knowledge-Based Systems
- Vol. 296
Uncertainty-Aware Contrastive Learning for semi-supervised named entity recognition
- 20 January 2024
- Published by Elsevier in Information Processing & Management
- Vol. 61 (3)
CoTea: Collaborative teaching for low-resource named entity recognition with a divide-and-conquer strategy
- 20 January 2024
- Published by Elsevier in Information Processing & Management
- Vol. 61 (3)
CoTea: Collaborative teaching for low-resource named entity recognition with a divide-and-conquer strategy
- Open Access
A Unified Contrastive Transfer Framework with Propagation Structure for Boosting Low-Resource Rumor Detection
The truth is significantly hampered by massive rumors that spread along with breaking news or popular topics. Since there is sufficient corpus gathered from the same domain for model training, existing rumor detection algorithms show promising performance on yesterday's news. However, due to a lack of substantial training data and prior expert knowledge, they are poor at spotting rumors concerning unforeseen events, especially those propagated in different languages (i.e., low-resource regimes). In this paper, we propose a unified contrastive transfer framework to detect rumors by adapting the features learned from well-resourced rumor data to that of the low-resourced with only few-shot annotations. More specifically, we first represent rumor circulated on social media as an undirected topology for enhancing the interaction of user opinions, and then train a Multi-scale Graph Convolutional Network via a unified contrastive paradigm to mine effective clues simultaneously from post semantics and propagation structure. Our model explicitly breaks the barriers of the domain and/or language issues, via language alignment and a novel domain-adaptive contrastive learning mechanism. To well-generalize the representation learning using a small set of annotated target events, we reveal that rumor-indicative signal is closely correlated with the uniformity of the distribution of these events. We design a target-wise contrastive training mechanism with three event-level data augmentation strategies, capable of unifying the representations by distinguishing target events. Extensive experiments conducted on four low-resource datasets collected from real-world microblog platforms demonstrate that our framework achieves much better performance than state-of-the-art methods and exhibits a superior capacity for detecting rumors at early stages.
Open AccessA Unified Contrastive Transfer Framework with Propagation Structure for Boosting Low-Resource Rumor Detection
The truth is significantly hampered by massive rumors that spread along with breaking news or popular topics. Since there is sufficient corpus gathered from the same domain for model training, existing rumor detection algorithms show promising performance on yesterday's news. However, due to a lack of substantial training data and prior expert knowledge, they are poor at spotting rumors concerning unforeseen events, especially those propagated in different languages (i.e., low-resource regimes). In this paper, we propose a unified contrastive transfer framework to detect rumors by adapting the features learned from well-resourced rumor data to that of the low-resourced with only few-shot annotations. More specifically, we first represent rumor circulated on social media as an undirected topology for enhancing the interaction of user opinions, and then train a Multi-scale Graph Convolutional Network via a unified contrastive paradigm to mine effective clues simultaneously from post semantics and propagation structure. Our model explicitly breaks the barriers of the domain and/or language issues, via language alignment and a novel domain-adaptive contrastive learning mechanism. To well-generalize the representation learning using a small set of annotated target events, we reveal that rumor-indicative signal is closely correlated with the uniformity of the distribution of these events. We design a target-wise contrastive training mechanism with three event-level data augmentation strategies, capable of unifying the representations by distinguishing target events. Extensive experiments conducted on four low-resource datasets collected from real-world microblog platforms demonstrate that our framework achieves much better performance than state-of-the-art methods and exhibits a superior capacity for detecting rumors at early stages.
- 8 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 35 (1) , 973-984
Context-Aware Attentive Multilevel Feature Fusion for Named Entity Recognition
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.
- 8 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 35 (1) , 973-984
Context-Aware Attentive Multilevel Feature Fusion for Named Entity Recognition
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.