Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1297231.1297240acmconferencesArticle/Chapter ViewAbstractPublication PagesrecsysConference Proceedingsconference-collections
Article

Robust collaborative filtering

Published: 19 October 2007 Publication History

Abstract

The widespread deployment of recommender systems has lead to user feedback of varying quality. While some users faithfully express their true opinion, many provide noisy ratings which can be detrimental to the quality of the generated recommendations. The presence of noise can violate modeling assumptions and may thus lead to instabilities in estimation and prediction. Even worse, malicious users can deliberately insert attack profiles in an attempt to bias the recommender system to their benefit.
Robust statistics is an area within statistics where estimation methods have been developed that deteriorate more gracefully in the presence of unmodeled noise and slight departures from modeling assumptions. In this work, we study how such robust statistical methods, in particular M-estimators, can be used to generate stable recommendation even in the presence of noise and spam. To that extent, we present a Robust Matrix Factorization algorithm and study its stability. We conclude that M-estimators do not add significant stability to recommendation; however the presented algorithm can outperform existing recommendation algorithms in its recommendation quality.

References

[1]
Y. Azar, A. Fiat, A. R. Karlin, F. McSherry, and J. Saia. Spectral analysis of data. In STOC, pages 619--626, 2001.
[2]
R. Burke, B. Mobasher, C. Williams, and R. Bhaumik. Analysis and detection of segment-focused attacks against collaborative recommendation. 2006.
[3]
P.-A. Chirita, W. Nejdl, and C. Zamfir. Preventing shilling attacks in online recommender systems. In Proceedings of WIDM '05, pages 67--74. ACM Press, 2005.
[4]
A. Dempster, N. Laird, and D. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 39(1):1-38, 1977.
[5]
K. Gabriel and S. Zamir. Lower Rank Approximation of Matrices by Least Squares with Any Choice of Weights. Technometrics, 21(4):489-498, 1979.
[6]
G. Gorrell. Generalized hebbian algorithm for incremental singular value decomposition in natural language processing. In EACL, 2006.
[7]
J. Herlocker, J. A. Konstan, and J. Riedl. An empirical analysis of design choices in neighborhood-based collaborative filtering algorithms. Inf. Retr., 5(4):287--310, 2002.
[8]
T. Hofmann. Latent Semantic Models for Collaborative Filtering. ACM Trans. Inf. Syst., 22(1):89--115, 2004.
[9]
H. Hotelling. Analysis of a Complex of Statistical Variables Into Principal Components. 1933.
[10]
P. Huber. Robust Estimation of a Location Parameter. The Annals of Mathematical Statistics, 35(1):73--101, 1964.
[11]
P. Huber. Robust Statistics. Wiley-IEEE, 2004.
[12]
I. T. Jolliffe. Principal Component Analysis (2nd Edition). Springer, 2002.
[13]
S. K. Lam and J. Riedl. Shilling recommender systems for fun and profit. In WWW '04: Proceedings of the 13th international conference on World Wide Web, pages 393--402. ACM Press, 2004.
[14]
X. LI, Z. NING, and L. XIANG. Robust 3D Reconstruction with Outliers Using RANSAC Based Singular Value Decomposition. IEICE Transactions on Information and Systems, 88(8):2001, 2005.
[15]
L. Liu, D. Hawkins, S. Ghosh, and S. Young. Robust singular value decomposition analysis of microarray data. Proceedings of the National Academy of Sciences, 100(23):13167--13172, 2003.
[16]
B. Mehta. Unsupervised shilling detection for collaborative filtering. In AAAI 2007: Proceedings of the 22nd Twenty-Second Conference on Artificial Intelligence, AAAI Press, Vancouver, Canada, 2007.
[17]
B. Mehta, T. Hofmann, and P. Fankhauser. Lies and Propaganda: Detecting spam users in Collaborative Filtering. In IUI '07: Proceedings of Intelligent user interfaces, pages 14--21. ACM Press, 2007.
[18]
B. Mobasher, R. Burke, C. Williams, and R. Bhaumik. Analysis and detection of segment-focused attacks against collaborative recommendation. 2006.
[19]
B. Mobasher, R. D. Burke, and J. J. Sandvig. Model-based collaborative filtering as a defense against profile injection attacks. In AAAI, 2006.
[20]
M. O'Mahony, N. Hurley, N. Kushmerick, and G. Silvestre. Collaborative recommendation: A robustness analysis. ACM Trans. Inter. Tech., 4(4):344--377, 2004.
[21]
M. P. O'Mahony, N. J. Hurley, and Silvestre. Detecting noise in Recommender system databases. In Proceedings of Intelligent User Interfaces (IUI'06), pages 109--115. ACM Press, 2006.
[22]
T. D. Sanger. Optimal Unsupervised Learning in a single-layer linear feedforward neural network. Neural Networks, 2(6):459--473, 1989.
[23]
B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Application of dimensionality reduction in recommender systems - a case study. Defense Technical Information Center, 2000.
[24]
B. Webb. Netflix update: Try this at home. http://sifter.org/~simon/journal/20061211.html, 2006.
[25]
C. Williams, B. Mobasher, R. Burke, J. Sandvig, and R. Bhaumik. Detection of Obfuscated Attacks in Collaborative Recommender Systems. In Workshop on Recommender Systems, ECAI, 2006.
[26]
S. Zhang, W. Wang, J. Ford, F. Makedon, and J. Pearlman. Using singular value decomposition approximation for collaborative filtering. In Proceedings of CEC '05, pages 257--264, Washington, DC, USA, 2005. IEEE Computer Society.

Cited By

View all
  • (2025)Handling Low Homophily in Recommender Systems With Partitioned Graph TransformerIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.348588037:1(334-350)Online publication date: Jan-2025
  • (2025)Accelerated affine-invariant convergence rates of the Frank–Wolfe algorithm with open-loop step-sizesMathematical Programming10.1007/s10107-024-02180-2Online publication date: 6-Jan-2025
  • (2024)Safe Collaborative FilteringSSRN Electronic Journal10.2139/ssrn.4767721Online publication date: 2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
RecSys '07: Proceedings of the 2007 ACM conference on Recommender systems
October 2007
222 pages
ISBN:9781595937308
DOI:10.1145/1297231
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 October 2007

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

RecSys07
Sponsor:
RecSys07: ACM Conference on Recommender Systems
October 19 - 20, 2007
MN, Minneapolis, USA

Acceptance Rates

Overall Acceptance Rate 254 of 1,295 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)29
  • Downloads (Last 6 weeks)1
Reflects downloads up to 25 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2025)Handling Low Homophily in Recommender Systems With Partitioned Graph TransformerIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.348588037:1(334-350)Online publication date: Jan-2025
  • (2025)Accelerated affine-invariant convergence rates of the Frank–Wolfe algorithm with open-loop step-sizesMathematical Programming10.1007/s10107-024-02180-2Online publication date: 6-Jan-2025
  • (2024)Safe Collaborative FilteringSSRN Electronic Journal10.2139/ssrn.4767721Online publication date: 2024
  • (2024)Manipulating Recommender Systems: A Survey of Poisoning Attacks and CountermeasuresACM Computing Surveys10.1145/367732857:1(1-39)Online publication date: 7-Oct-2024
  • (2024)Design of a dynamic and robust recommender system based on item context, trust, rating matrix and rating time using social networks analysisJournal of King Saud University - Computer and Information Sciences10.1016/j.jksuci.2024.10196436:2(101964)Online publication date: Feb-2024
  • (2024)PGCF: Perception Graph Collaborative Filtering for RecommendationJournal of Information and Intelligence10.1016/j.jiixd.2024.05.003Online publication date: May-2024
  • (2024)Robust enhanced collaborative filtering without explicit noise filteringThe Journal of Supercomputing10.1007/s11227-024-06086-w80:11(15763-15782)Online publication date: 6-Apr-2024
  • (2023)POREProceedings of the 32nd USENIX Conference on Security Symposium10.5555/3620237.3620333(1703-1720)Online publication date: 9-Aug-2023
  • (2023)Dual Intents Graph Modeling for User-centric Group DiscoveryProceedings of the 32nd ACM International Conference on Information and Knowledge Management10.1145/3583780.3614855(2716-2725)Online publication date: 21-Oct-2023
  • (2023)Recommender Systems in CybersecurityKnowledge and Information Systems10.1007/s10115-023-01906-665:12(5523-5559)Online publication date: 5-Jun-2023
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media