The existing robust collaborative recommendation algorithms have low robustness against PIA and Ao P attacks. Aiming at the problem, we propose a robust recommendation method based on shilling attack detection and mat...
详细信息
The existing robust collaborative recommendation algorithms have low robustness against PIA and Ao P attacks. Aiming at the problem, we propose a robust recommendation method based on shilling attack detection and matrix factorization model. Firstly, the type of shilling attack is identified based on statistical characteristics of attack profiles. Secondly, we devise corresponding unsupervised detection algorithms for standard attack, Ao P and PIA, and the suspicious users and items are flagged. Finally, we devise a robust recommendation algorithm by combining the proposed shilling attack detection algorithm with matrix factorization model, and conduct experiments on the Movie Lens dataset to demonstrate its effectiveness. Experimental results show that the proposed method exhibits good recommendation precision and excellent robustness for shilling attacks of multiple types.
Traditional collaborative filtering approaches are often confronted with two major problems: data sparsity and cold-start. Fortunately, along with the rise of social media, social network is producing a large and rich...
详细信息
ISBN:
(纸本)9781509000890
Traditional collaborative filtering approaches are often confronted with two major problems: data sparsity and cold-start. Fortunately, along with the rise of social media, social network is producing a large and rich set of social data (such as labels, trust, etc.), which provides a new way to solve the problems of collaborative filtering, namely, we can make use of social data to enhance the recommendation accuracy. However, traditional recommendation algorithms may only consider either the influence of similarity relationships or trust relationships to the user model, but fail to take full advantage of the implications of social data. In this paper, we propose a novel recommendation algorithm called STPMF based on neighborhood model and matrix factorization model, where complementary roles of similarity relationships and trust relationships to the user model by means of a weight w are considered simultaneously. Furthermore, we propagate similarity relationships and trust relationships one step or two steps to alleviate the data sparsity and cold-start problems. We have conducted experiments on two real world data sets from *** and Delicious. Compared with existing recommendation algorithms, our method can effectively alleviate the problems of collaborative filtering, and enhance the recommendation accuracy.
Currently, there is a distinct contradiction between the massive information and the lack of personalized information. In this case, the recommendation system has been widely used as an important technology to discove...
详细信息
ISBN:
(数字)9781510651890
ISBN:
(纸本)9781510651890;9781510651883
Currently, there is a distinct contradiction between the massive information and the lack of personalized information. In this case, the recommendation system has been widely used as an important technology to discover the potential interests of users and recommend the items of interest to the target users. Considering that the probability matrix decomposition model can show its prediction mechanism more clearly, in this paper, the probabilistic matrix factorization model is used in the matrixfactorization method. Based on the probabilistic matrixfactorization, a recommendation method framework considering both extreme rating behavior similarity and rating matrix information fusion is proposed. The framework integrates the local neighbor relationship of users into the global rating optimization process of matrixfactorization, and thus improves the prediction accuracy and robustness of sparse data. Simulation results show that the proposed method reduces the MAE by 0.68%, 1.12%, 2.85% and 1.19% compared with the suboptimal method. It is proved that the proposed method can effectively implement long tail project recommendation and ensure high recommendation accuracy.
We present two new models that take into account the information available in user-created "favorites" lists for enhancing the quality of item recommendation. The first model uses the popularity and ratings ...
详细信息
ISBN:
(纸本)9781479967193
We present two new models that take into account the information available in user-created "favorites" lists for enhancing the quality of item recommendation. The first model uses the popularity and ratings of items in the lists to predict ratings for new items to users that have rated some items on the lists. The second model is a matrix factorization model that incorporates lists as implicit feedback in ratings prediction. We compare our two approaches against another work for utilizing favorites lists, as well as the popular Singular Value Decomposition (SVD) on two large Amazon datasets and show that utilizing favorites lists gives significant improvements, especially in cold-start cases.
暂无评论