scholarly journals Robust Model-Based Reliability Approach to Tackle Shilling Attacks in Collaborative Filtering Recommender Systems

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 41782-41798 ◽  
Author(s):  
Santiago Alonso ◽  
Jesus Bobadilla ◽  
Fernando Ortega ◽  
Ricardo Moya
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Model Based ◽  
Robust Model

scholarly journals A Survey of Collaborative Filtering Techniques

2009 ◽  
Vol 2009 ◽  
pp. 1-19 ◽  
Author(s):  
Xiaoyuan Su ◽  
Taghi M. Khoshgoftaar
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Privacy Protection ◽  
State Of The Art ◽  
Predictive Performance ◽  
The State ◽  
Data Sparsity ◽  
Research And Practice ◽  
Model Based ◽  
Comprehensive Survey

As one of the most successful approaches to building recommender systems, collaborative filtering (CF) uses the known preferences of a group of users to make recommendations or predictions of the unknown preferences for other users. In this paper, we first introduce CF tasks and their main challenges, such as data sparsity, scalability, synonymy, gray sheep, shilling attacks, privacy protection, etc., and their possible solutions. We then present three main categories of CF techniques: memory-based, model-based, and hybrid CF algorithms (that combine CF with other recommendation techniques), with examples for representative algorithms of each category, and analysis of their predictive performance and their ability to address the challenges. From basic techniques to the state-of-the-art, we attempt to present a comprehensive survey for CF techniques, which can be served as a roadmap for research and practice in this area.

scholarly journals Model-Based Learning from Preference Data

2019 ◽  
Vol 6 (1) ◽  
pp. 329-354 ◽  
Author(s):  
Qinghua Liu ◽  
Marta Crispino ◽  
Ida Scheel ◽  
Valeria Vitelli ◽  
Arnoldo Frigessi
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Rank Aggregation ◽  
Incomplete Preferences ◽  
Preference Learning ◽  
Preference Data ◽  
Individual Ranking ◽  
Model Based ◽  
Different Types

Preference data occur when assessors express comparative opinions about a set of items, by rating, ranking, pair comparing, liking, or clicking. The purpose of preference learning is to ( a) infer on the shared consensus preference of a group of users, sometimes called rank aggregation, or ( b) estimate for each user her individual ranking of the items, when the user indicates only incomplete preferences; the latter is an important part of recommender systems. We provide an overview of probabilistic approaches to preference learning, including the Mallows, Plackett–Luce, and Bradley–Terry models and collaborative filtering, and some of their variations. We illustrate, compare, and discuss the use of these methods by means of an experiment in which assessors rank potatoes, and with a simulation. The purpose of this article is not to recommend the use of one best method but to present a palette of different possibilities for different questions and different types of data.

scholarly journals Diversity Balancing for Two-Stage Collaborative Filtering in Recommender Systems

2020 ◽  
Vol 10 (4) ◽  
pp. 1257 ◽  
Author(s):  
Liang Zhang ◽  
Quanshen Wei ◽  
Lei Zhang ◽  
Baojiao Wang ◽  
Wen-Hsien Ho
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Social Relationships ◽  
Two Stage ◽  
Proposed Model ◽  
The Social ◽  
Item List ◽  
Ranking Strategy ◽  
High Prediction ◽  
Optimization Mechanism

Conventional recommender systems are designed to achieve high prediction accuracy by recommending items expected to be the most relevant and interesting to users. Therefore, they tend to recommend only the most popular items. Studies agree that diversity of recommendations is as important as accuracy because it improves the customer experience by reducing monotony. However, increasing diversity reduces accuracy. Thus, a recommendation algorithm is needed to recommend less popular items while maintaining acceptable accuracy. This work proposes a two-stage collaborative filtering optimization mechanism that obtains a complete and diversified item list. The first stage of the model incorporates multiple interests to optimize neighbor selection. In addition to using conventional collaborative filtering to predict ratings by exploiting available ratings, the proposed model further considers the social relationships of the user. A novel ranking strategy is then used to rearrange the list of top-N items while maintaining accuracy by (1) rearranging the area controlled by the threshold and by (2) maximizing popularity while maintaining an acceptable reduction in accuracy. An extensive experimental evaluation performed in a real-world dataset confirmed that, for a given loss of accuracy, the proposed model achieves higher diversity compared to conventional approaches.

An Overview of Collaborative Filtering Recommendation Algorithm

2013 ◽  
Vol 756-759 ◽  
pp. 3899-3903
Author(s):  
Ping Sun ◽  
Zheng Yu Li ◽  
Zi Yang Han ◽  
Feng Ying Wang
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Evaluation Method ◽  
Decisive Role ◽  
Classical Solutions ◽  
Critical Problem ◽  
Recommendation Algorithm ◽  
Data Sparseness ◽  
Collaborative Filtering Algorithm ◽  
And Performance

Recommendation algorithm is the most core and key point in recommender systems, and plays a decisive role in type and performance evaluation. At present collaborative filtering recommendation not only is the most widely useful and successful recommend technology, but also is a promotion for the study of the whole recommender systems. The research on the recommender systems is coming into a focus and critical problem at home and abroad. Firstly, the latest development and research in the collaborative filtering recommendation algorithm are introduced. Secondly, the primary idea and difficulties faced with the algorithm are explained in detail. Some classical solutions are used to deal with the problems such as data sparseness, cold start and augmentability. Thirdly, the particular evaluation method of the algorithm is put forward and the developments of collaborative filtering algorithm are prospected.

Sign in / Sign up

Export Citation Format

Share Document