Improving top-N recommendation performance using missing data
Summary: Recommender systems become increasingly significant in solving the information explosion problem. Data sparse is a main challenge in this area. Massive unrated items constitute missing data with only a few observed ratings. Most studies consider missing data as unknown information and only use observed data to learn models and generate recommendations. However, data are missing not at random. Part of missing data is due to the fact that users choose not to rate them. This part of missing data is negative examples of user preferences. Utilizing this information is expected to leverage the performance of recommendation algorithms. Unfortunately, negative examples are mixed with unlabeled positive examples in missing data, and they are hard to be distinguished. In this paper, we propose three schemes to utilize the negative examples in missing data. The schemes are then adapted with SVD++, which is a state-of-the-art matrix factorization recommendation approach, to generate recommendations. Experimental results on two real datasets show that our proposed approaches gain better top-\(N\) performance than the baseline ones on both accuracy and diversity.
- A Content Boosted Collaborative Filtering Approach for Movie Recommendation Based on Local & Global Similarity and Missing Data Prediction
- Adaptive nonnegative matrix factorization and measure comparisons for recommender systems
- A novel fuzzy-based similarity measure for collaborative filtering to alleviate the sparsity problem
- Collaborative filtering with information-rich and~information-sparse entities
- A recommendation algorithm based on users’ partial similarity
- Adaptive nonnegative matrix factorization and measure comparisons for recommender systems
- Exploiting Positive and Negative Graded Relevance Assessments for Content Recommendation
- A Content Boosted Collaborative Filtering Approach for Movie Recommendation Based on Local & Global Similarity and Missing Data Prediction
- Propagating maximum capacities for recommendation
This page was built for publication: Improving top-\(N\) recommendation performance using missing data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1665542)
