Finding shilling attack in recommender system based on dynamic feature selection

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Recommender system is widely used as an important tool in various fields for effectively dealing with information overload, and collaborative filtering algorithm plays a vital role in the system. However, such system is highly vulnerable to malicious attacks, especially shilling attack because of data openness and independence. Therefore, detecting shilling attack has become an important issue to ensure the security of recommender system.Most of existing methods for detecting shilling attack are based on rating classification features and their limitation is that they are easily to be interfered by obfuscation techniques. Moreover, traditional detection algorithms can not handle multiple types of shilling attack flexibly. In order to solve these problems, in this paper, we propose an outlier degree shilling attack detection algorithm based on dynamic feature selection. By considering the differences of user choosing items and taking user popularity as a detection metric, as well as using information entropy to select detection metrics dynamically, a variety of shilling attack models can be dealt with flexibly. Experiments show that the algorithm has stronger detection performance and interference immunity in shilling attack detection.

Cite

CITATION STYLE

APA

Cao, G., Zhang, H., Fan, Y., & Kuang, L. (2018). Finding shilling attack in recommender system based on dynamic feature selection. In Proceedings of the International Conference on Software Engineering and Knowledge Engineering, SEKE (Vol. 2018-July, pp. 50–55). Knowledge Systems Institute Graduate School. https://doi.org/10.18293/SEKE2018-134

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free