VLDB 2026 Research / reviewers in the wild / expert
Jiachen Ma 0003
dblp:13/4055-3
· DBLP profile ↗
8ranked-venue papers
5as first author
8since 2021 · last 2026
0000-0002-2580-0229ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 3 first-author · 4 since 2021Databases, data management, data science and information retrieval · 3 · 3 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | PHPFND: Detecting Fake News via Post-Hoc Processing of LLMs HallucinationabstractLarge Language Models (LLMs) perform excellently in fake news detection tasks, but their outputs are often accompanied by hallucinations, i.e., generated content that is contradictory to facts. Previous studies have mostly mitigated hallucinations through prompt design. However, this paper reveals that regions in news articles which easily induce hallucinations in LLMs correspond closely to the most challenging regions for fake news detectors. In this paper, we propose a fake news detection framework (PHPFND) based on post-hoc processing of LLMs hallucination. Specifically, our framework includes a hallucination detection module (ISHD) based on information structuring that detects three types of hallucinations in LLMs in a targeted manner, and a hallucination-driven feature enhancement mechanism (HDFE) that incorporates hallucination signals as explicit features into sentence-level encoding and feature fusion to guide the model’s attention toward high-risk regions. Experimental results on two mainstream fake news datasets show that our proposed method significantly outperforms LLM-based baselines. Jinke Ma, Jiachen Ma 0003, Wei Zhang 0106, Yong Liu 0029 |
AAAI | 2 |
| 2026 | PGCL: Precisely Capturing Propagation Structure Characteristics via Graph Contrastive Learning for Rumor Detection
Jiachen Ma 0003, Longjiang Guo, Lichen Zhang 0001, Zhipeng Cai 0001 |
IEEE Trans. Comput. Soc. Syst. | 1 |
| 2025 | Resolving Embedding-Ignoring Conflict in Graph Contrastive Learning-Based Rumor Detection
Jiachen Ma 0003, Wei Zhang 0106, Yong Liu 0029 |
DASFAA (3) | 1 |
| 2025 | Graph Contrastive Adversarial Learning for Rumor Detection via Similarity-Preserving
Jiachen Ma 0003, Wei Zhang 0106, Yong Liu 0029 |
ICIC (16) | 2 |
| 2025 | Multimodal GAN Integrating Hypergraph and Knowledge Graph Representations for Synthetic Lethality
Wei Zhang 0106, Zhijuan Li, Yong Liu 0029, Xiaokun Li, Jiachen Ma 0003 |
ICIC (26) | 6 |
| 2024 | Propagation Structure Fusion for Rumor Detection Based on Node-Level Contrastive LearningabstractWith the rise of social media, the rapid spread of rumors online has resulted in numerous negative effects on society and the economy. The methods for rumor detection have attracted great interest from both academia and industry. Given the widespread effectiveness of contrastive learning, many graph contrastive learning models for rumor detection have been proposed by using the event propagation structure as graph data. However, the existing contrastive models usually treat the propagation structure of other events similar to the anchor events as negative samples. While this design choice allows for discriminative learning, on the other hand, it also inevitably pushes apart semantically similar samples and, thus, degrades model performance. In this article, we propose a novel propagation fusion model called propagation structure fusion model based on node-level contrastive learning (PFNC) for rumor detection based on node-level contrastive learning. PFNC first obtains three augmented propagation structures by masking the text of each node in the propagation structure randomly and perturbing some edges in the propagation structure based on the importance of edges. Then, PFNC applies the node-level contrastive learning method between every two augmented propagation structures to prevent the samples with similar propagation structure from far away. Finally, a convolutional neural network (CNN)-based model is proposed to capture the relevant information that is consistent and supplementary among three augmented propagation structures by regarding the propagation structure of the event as a color picture, three augmented propagation structures as color channels, and each node as a pixel. The experimental results on real datasets show that the PFNC significantly outperforms the state-of-the-art models for rumor detection. Jiachen Ma 0003, Yong Liu 0029, Chunqiang Hu, Zhaojie Ju |
IEEE Trans. Neural Networks Learn. Syst. | 1 |
| 2023 | Contrastive Learning for Rumor Detection via Fitting Beta Mixture ModelabstractThe rise of social media has posed a challenging problem of effectively identifying rumors. With the great success of contrastive learning in many fields, many contrastive learning models for rumor detection have been proposed. However, existing models usually use the propagation structure of other events as negative samples and regard more similar samples to anchor events as hard ones across all the training processes, resulting in undesirably pushing away the samples of the same class. Thus, we propose a novel contrastive learning model (CRFB) to solve the above problem. Specifically, we employ contrastive learning between two augmented propagation structure and fit a two-component (true-false) beta mixture model (BMM) to measure the probability of negative samples being true. In addition, we propose a CNN-based model to capture the consistent and complementary information between two augmented propagation structure. The experimental results on public datasets demonstrate that our CRFB outperforms the existing state-of-the-art models for rumor detection. Jiachen Ma 0003, Yong Liu 0029, Chunyu Ai |
CIKM | 1 |
| 2022 | Curriculum Contrastive Learning for Fake News DetectionabstractDue to the rapid spread of fake news on social media, society and economy have been negatively affected in many ways. How to effectively identify fake news is a challenging problem that has received great attention from academic and industry. Existing deep learning methods for fake news detection require a large amount of labeled data to train the model, but obtaining labeled data is a time-consuming and labor-intensive process. To extract useful information from a large amount of unlabeled data, some contrastive learning methods for fake news detection are proposed. However, existing contrastive learning methods only randomly sample negative samples at different training stages, resulting in the role of negative samples not being fully played. Intuitively, increasing the contrastive difficulty of negative samples gradually in a way similar to human learning will contribute to improve the performance of the model. Inspired by the idea of curriculum learning, we propose a curriculum contrastive model (CCFD) for fake news detection which automatically select and train negative samples with different difficulty at different training stages. Furthermore, we also propose three new augmentation methods which consider the importance of edges and node attributes in the propagation structure to obtain more effective positive samples. The experimental results on three public datasets show that our model CCFD outperforms the existing state-of-the-art models for fake news detection. Jiachen Ma 0003, Yong Liu 0029, Meng Liu 0014 |
CIKM | 1 |