GroupLens: an open architecture for collaborative filtering of netnews
CSCW '94 Proceedings of the 1994 ACM conference on Computer supported cooperative work
Technical Note: Bias and the Quantification of Stability
Machine Learning - Special issue on bias evaluation and selection
Fab: content-based, collaborative recommendation
Communications of the ACM
GroupLens: applying collaborative filtering to Usenet news
Communications of the ACM
CSCW '98 Proceedings of the 1998 ACM conference on Computer supported cooperative work
An algorithmic framework for performing collaborative filtering
Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
Item-based collaborative filtering recommendation algorithms
Proceedings of the 10th international conference on World Wide Web
Accuracy and Stability of Numerical Algorithms
Accuracy and Stability of Numerical Algorithms
Eigentaste: A Constant Time Collaborative Filtering Algorithm
Information Retrieval
Learning Collaborative Information Filters
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Evaluating collaborative filtering recommender systems
ACM Transactions on Information Systems (TOIS)
Shilling recommender systems for fun and profit
Proceedings of the 13th international conference on World Wide Web
An Evaluation of Neighbourhood Formation on the Performance of Collaborative Filtering
Artificial Intelligence Review
Proceedings of the 10th international conference on Intelligent user interfaces
IEEE Transactions on Knowledge and Data Engineering
Toward trustworthy recommender systems: An analysis of attack models and algorithm robustness
ACM Transactions on Internet Technology (TOIT)
Trust-aware recommender systems
Proceedings of the 2007 ACM conference on Recommender systems
Lessons from the Netflix prize challenge
ACM SIGKDD Explorations Newsletter - Special issue on visual analytics
Scalable Collaborative Filtering with Jointly Derived Neighborhood Interpolation Weights
ICDM '07 Proceedings of the 2007 Seventh IEEE International Conference on Data Mining
The value of personalised recommender systems to e-business: a case study
Proceedings of the 2008 ACM conference on Recommender systems
Model-based collaborative filtering as a defense against profile injection attacks
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Factor in the neighbors: Scalable and accurate collaborative filtering
ACM Transactions on Knowledge Discovery from Data (TKDD)
On the stability of recommendation algorithms
Proceedings of the fourth ACM conference on Recommender systems
Empirical analysis of predictive algorithms for collaborative filtering
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Analysis and detection of segment-focused attacks against collaborative recommendation
WebKDD'05 Proceedings of the 7th international conference on Knowledge Discovery on the Web: advances in Web Mining and Web Usage Analysis
| Hi-index | 0.00 |
The article explores stability as a new measure of recommender systems performance. Stability is defined to measure the extent to which a recommendation algorithm provides predictions that are consistent with each other. Specifically, for a stable algorithm, adding some of the algorithm’s own predictions to the algorithm’s training data (for example, if these predictions were confirmed as accurate by users) would not invalidate or change the other predictions. While stability is an interesting theoretical property that can provide additional understanding about recommendation algorithms, we believe stability to be a desired practical property for recommender systems designers as well, because unstable recommendations can potentially decrease users’ trust in recommender systems and, as a result, reduce users’ acceptance of recommendations. In this article, we also provide an extensive empirical evaluation of stability for six popular recommendation algorithms on four real-world datasets. Our results suggest that stability performance of individual recommendation algorithms is consistent across a variety of datasets and settings. In particular, we find that model-based recommendation algorithms consistently demonstrate higher stability than neighborhood-based collaborative filtering techniques. In addition, we perform a comprehensive empirical analysis of many important factors (e.g., the sparsity of original rating data, normalization of input data, the number of new incoming ratings, the distribution of incoming ratings, the distribution of evaluation data, etc.) and report the impact they have on recommendation stability.