Hongyan Ran , Di Zhang , Xiaohong Li , Huifang Ma , Caiyan Jia , Yaogong Feng
{"title":"Unsupervised contrastive domain adaptive rumor detection with test-time classifier adjustment","authors":"Hongyan Ran , Di Zhang , Xiaohong Li , Huifang Ma , Caiyan Jia , Yaogong Feng","doi":"10.1016/j.ipm.2025.104341","DOIUrl":null,"url":null,"abstract":"<div><div>Domain-adaptive rumor detection faces significant challenges in mitigating distributional shifts between the source and target domains. Although contrastive learning-based models have shown promise, they exhibit two fundamental shortcomings. Firstly, neglecting the impact of source content on feature alignment may hinder discriminative feature learning. Secondly, relying on unbiased classifier assumptions despite inherent distributional discrepancies in target data. To address these challenges, we propose a novel method called Unsupervised <u>C</u>ontrastive <u>D</u>omain Adaptive Rumor Detection with <u>T</u>est-<u>T</u>ime Classifier Adjustment (CDTT). Our contrastive domain adaptation framework utilizes a stance-based contrastive learning mechanism to align latent stance features across domains while maintaining content independence. Additionally, to address label unavailability in the target domain, we devise a pseudo-label generation strategy that aggregates nearest-neighbor probabilities through feature-space distance-based batch soft voting. Finally, we implement a test-time adaptation strategy that refines the source-trained classifier by constructing class-wise pseudo-prototypes from unlabeled target data and optimizing prediction through distance-based sample classification. Extensive experiments conducted on four groups of cross-domain datasets and a cross-event dataset showcase that our model surpasses the state-of-the-art baselines.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 2","pages":"Article 104341"},"PeriodicalIF":6.9000,"publicationDate":"2025-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306457325002821","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
Domain-adaptive rumor detection faces significant challenges in mitigating distributional shifts between the source and target domains. Although contrastive learning-based models have shown promise, they exhibit two fundamental shortcomings. Firstly, neglecting the impact of source content on feature alignment may hinder discriminative feature learning. Secondly, relying on unbiased classifier assumptions despite inherent distributional discrepancies in target data. To address these challenges, we propose a novel method called Unsupervised Contrastive Domain Adaptive Rumor Detection with Test-Time Classifier Adjustment (CDTT). Our contrastive domain adaptation framework utilizes a stance-based contrastive learning mechanism to align latent stance features across domains while maintaining content independence. Additionally, to address label unavailability in the target domain, we devise a pseudo-label generation strategy that aggregates nearest-neighbor probabilities through feature-space distance-based batch soft voting. Finally, we implement a test-time adaptation strategy that refines the source-trained classifier by constructing class-wise pseudo-prototypes from unlabeled target data and optimizing prediction through distance-based sample classification. Extensive experiments conducted on four groups of cross-domain datasets and a cross-event dataset showcase that our model surpasses the state-of-the-art baselines.
期刊介绍:
Information Processing and Management is dedicated to publishing cutting-edge original research at the convergence of computing and information science. Our scope encompasses theory, methods, and applications across various domains, including advertising, business, health, information science, information technology marketing, and social computing.
We aim to cater to the interests of both primary researchers and practitioners by offering an effective platform for the timely dissemination of advanced and topical issues in this interdisciplinary field. The journal places particular emphasis on original research articles, research survey articles, research method articles, and articles addressing critical applications of research. Join us in advancing knowledge and innovation at the intersection of computing and information science.