Yongping He , Zihang Feng , Tijin Yan , Yufeng Zhan , Yuanqing Xia
{"title":"Meta-CAD: Few-shot anomaly detection for online social networks with meta-learning","authors":"Yongping He , Zihang Feng , Tijin Yan , Yufeng Zhan , Yuanqing Xia","doi":"10.1016/j.comnet.2025.111515","DOIUrl":null,"url":null,"abstract":"<div><div>Online social networks are now an integral component of our daily life, yet they pose several security risks, notably including fraudulent activities. Promptly detecting anomalous behaviors within these networks is crucial for effective platform management. Existing unsupervised anomaly detection methods in social networks struggle to effectively distinguish anomalies from noise, leading to a high false alarm rate. It is also data-hungry like semi-supervised methods, making it challenging to cope with data scarcity in practice. To tackle these difficulties, we propose Meta-CAD, a <u>C</u>ontrastive learning-based <u>A</u>nomaly <u>D</u>etection method in <u>Meta</u>-learning framework. It leverages a meta-learning framework to learn common and essential information from multiple auxiliary graphs, enabling efficient knowledge transfer and excelling in scenarios with limited data. Additionally, we design an anomaly-sensitive loss function inspired by contrastive learning, which allows the model to concentrate more on the characteristics of anomalous data by constructing positive and negative sample pairs, thereby enhancing the performance of anomaly detection. The experimental results show that Meta-CAD demonstrates superior performance, with its anomaly detection capabilities surpassing existing methods by up to 10%.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"270 ","pages":"Article 111515"},"PeriodicalIF":4.4000,"publicationDate":"2025-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625004827","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0
Abstract
Online social networks are now an integral component of our daily life, yet they pose several security risks, notably including fraudulent activities. Promptly detecting anomalous behaviors within these networks is crucial for effective platform management. Existing unsupervised anomaly detection methods in social networks struggle to effectively distinguish anomalies from noise, leading to a high false alarm rate. It is also data-hungry like semi-supervised methods, making it challenging to cope with data scarcity in practice. To tackle these difficulties, we propose Meta-CAD, a Contrastive learning-based Anomaly Detection method in Meta-learning framework. It leverages a meta-learning framework to learn common and essential information from multiple auxiliary graphs, enabling efficient knowledge transfer and excelling in scenarios with limited data. Additionally, we design an anomaly-sensitive loss function inspired by contrastive learning, which allows the model to concentrate more on the characteristics of anomalous data by constructing positive and negative sample pairs, thereby enhancing the performance of anomaly detection. The experimental results show that Meta-CAD demonstrates superior performance, with its anomaly detection capabilities surpassing existing methods by up to 10%.
期刊介绍:
Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.