{"title":"感知谣言的多样性:利用分层原型对比学习检测谣言","authors":"Peng Zheng, Yong Dou, Yeqing Yan","doi":"10.1016/j.ipm.2024.103832","DOIUrl":null,"url":null,"abstract":"<div><p>The proliferation of rumors on social networks poses a serious threat to cybersecurity, justice and public trust, increasing the urgent need for rumor detection. Existing detection methods typically treat all rumors as a single homogeneous category, neglecting the diverse semantic hierarchies within rumors. Rumors pervade various domains, each with its distinct characteristics. These methods tend to lag in expressiveness when confronted with real-world scenarios involving multiple semantic levels. Furthermore, the diversity of rumors also complicates the collection of datasets, and inevitably introduces noisy data, which hinders the correctness of the learned representations. To address these challenges, we propose a rumor detection framework with Hierarchical Prototype Contrastive Learning (HPCL). In this framework, we construct a set of dynamically updated hierarchical prototypes through contrastive learning to encourage capturing the hierarchical semantic structure within rumors. Additionally, we design a difficulty metric function based on the distance between instances and prototypes, and introduce curriculum learning to mitigate the adverse effects of noisy data. Experiments on four public datasets demonstrate that our approach achieves state-of-the-art performance. Our code is publicly released at <span><span>https://github.com/Coder-HenryZa/HPCL</span><svg><path></path></svg></span>.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4000,"publicationDate":"2024-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sensing the diversity of rumors: Rumor detection with hierarchical prototype contrastive learning\",\"authors\":\"Peng Zheng, Yong Dou, Yeqing Yan\",\"doi\":\"10.1016/j.ipm.2024.103832\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The proliferation of rumors on social networks poses a serious threat to cybersecurity, justice and public trust, increasing the urgent need for rumor detection. Existing detection methods typically treat all rumors as a single homogeneous category, neglecting the diverse semantic hierarchies within rumors. Rumors pervade various domains, each with its distinct characteristics. These methods tend to lag in expressiveness when confronted with real-world scenarios involving multiple semantic levels. Furthermore, the diversity of rumors also complicates the collection of datasets, and inevitably introduces noisy data, which hinders the correctness of the learned representations. To address these challenges, we propose a rumor detection framework with Hierarchical Prototype Contrastive Learning (HPCL). In this framework, we construct a set of dynamically updated hierarchical prototypes through contrastive learning to encourage capturing the hierarchical semantic structure within rumors. Additionally, we design a difficulty metric function based on the distance between instances and prototypes, and introduce curriculum learning to mitigate the adverse effects of noisy data. Experiments on four public datasets demonstrate that our approach achieves state-of-the-art performance. Our code is publicly released at <span><span>https://github.com/Coder-HenryZa/HPCL</span><svg><path></path></svg></span>.</p></div>\",\"PeriodicalId\":50365,\"journal\":{\"name\":\"Information Processing & Management\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":7.4000,\"publicationDate\":\"2024-07-14\",\"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/S0306457324001912\",\"RegionNum\":1,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306457324001912","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Sensing the diversity of rumors: Rumor detection with hierarchical prototype contrastive learning
The proliferation of rumors on social networks poses a serious threat to cybersecurity, justice and public trust, increasing the urgent need for rumor detection. Existing detection methods typically treat all rumors as a single homogeneous category, neglecting the diverse semantic hierarchies within rumors. Rumors pervade various domains, each with its distinct characteristics. These methods tend to lag in expressiveness when confronted with real-world scenarios involving multiple semantic levels. Furthermore, the diversity of rumors also complicates the collection of datasets, and inevitably introduces noisy data, which hinders the correctness of the learned representations. To address these challenges, we propose a rumor detection framework with Hierarchical Prototype Contrastive Learning (HPCL). In this framework, we construct a set of dynamically updated hierarchical prototypes through contrastive learning to encourage capturing the hierarchical semantic structure within rumors. Additionally, we design a difficulty metric function based on the distance between instances and prototypes, and introduce curriculum learning to mitigate the adverse effects of noisy data. Experiments on four public datasets demonstrate that our approach achieves state-of-the-art performance. Our code is publicly released at https://github.com/Coder-HenryZa/HPCL.
期刊介绍:
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.