{"title":"Shilling Attack Detection Method Integrating Item Temporal Information and Relational Networks","authors":"Shuguang Zhang, Lingjie Liu, Xuntao Zhi, Yu Cheng, Xinyu Zheng, Yunlong Wang","doi":"10.1002/cpe.70150","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Shilling attack detection is a method to identify and defend against malicious users in recommender systems, and it mainly detects shilling attackers by analyzing user behavior or item content anomalies. Items in the system subject to shilling attack often present abnormal scoring time-series information and relationship networks, but time-series data has the characteristics of large and unstable data volume, which makes it difficult to directly use raw data for detection, while detection from user relationship networks can often only solve a specific attack problem, and it is difficult to detect coordinated attack behaviors. To address the above issues, we propose a detection method called ITRN, which makes full use of item timing information and relational networks, dividing the time series of item ratings based on important points, constructing cubes for similarity measure using the second-order difference method to obtain the anomalous time intervals and the set of suspicious users, constructing a suspicious user-item bipartite graph, aggregating the higher-order neighboring information of the suspicious users using LightGCN, and then inputting these higher-order embedded inputs into the linear layer that are mapped into a scalar, and finally these scalars are input into the Sigmoid function to obtain the probability of the user being suspicious. Experiments were conducted on three datasets of varying sizes from Movielens, and the results showed that our method improved precision by approximately 0.02 and F1-measure by approximately 0.01 compared to the optimal baseline model.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 15-17","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70150","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0
Abstract
Shilling attack detection is a method to identify and defend against malicious users in recommender systems, and it mainly detects shilling attackers by analyzing user behavior or item content anomalies. Items in the system subject to shilling attack often present abnormal scoring time-series information and relationship networks, but time-series data has the characteristics of large and unstable data volume, which makes it difficult to directly use raw data for detection, while detection from user relationship networks can often only solve a specific attack problem, and it is difficult to detect coordinated attack behaviors. To address the above issues, we propose a detection method called ITRN, which makes full use of item timing information and relational networks, dividing the time series of item ratings based on important points, constructing cubes for similarity measure using the second-order difference method to obtain the anomalous time intervals and the set of suspicious users, constructing a suspicious user-item bipartite graph, aggregating the higher-order neighboring information of the suspicious users using LightGCN, and then inputting these higher-order embedded inputs into the linear layer that are mapped into a scalar, and finally these scalars are input into the Sigmoid function to obtain the probability of the user being suspicious. Experiments were conducted on three datasets of varying sizes from Movielens, and the results showed that our method improved precision by approximately 0.02 and F1-measure by approximately 0.01 compared to the optimal baseline model.
期刊介绍:
Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of:
Parallel and distributed computing;
High-performance computing;
Computational and data science;
Artificial intelligence and machine learning;
Big data applications, algorithms, and systems;
Network science;
Ontologies and semantics;
Security and privacy;
Cloud/edge/fog computing;
Green computing; and
Quantum computing.