Collaborative recommendation
ACM Transactions on Internet TechnologyPublished 1 November 2004
Michael P. O’Mahony, Neil Hurley, Nicholas Kushmerick, G.C.M. Silvestre
Citations327
SJR quartileQ1
SJR score1.00
SNIP1.35
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This work analyzes the robustness of collaborative recommendation: the ability to make recommendations despite (possibly intentional) noisy product ratings, and formalizes recommendation accuracy in machine learning terms and develops theoretically justified models of accuracy.
Abstract
Collaborative recommendation has emerged as an effective technique for personalized information access. However, there has been relatively little theoretical analysis of the conditions under which the technique is effective. To explore this issue, we analyse the <i>robustness</i> of collaborative recommendation: the ability to make recommendations despite (possibly intentional) noisy product ratings. There are two aspects to robustness: recommendation <i>accuracy</i> and <i>stability</i>. We formalize recommendation accuracy in machine learning terms and develop theoretically justified models of accuracy. In addition, we present a framework to examine recommendation stability in the context of a widely-used collaborative filtering algorithm. For each case, we evaluate our analysis using several real-world data-sets. Our investigation is both practically relevant for enterprises wondering whether collaborative recommendation leaves their marketing operations open to attack, and theoretically interesting for the light it sheds on a comprehensive theory of collaborative recommendation.
Keywords
Computer ScienceDecision Sciences
arXiv (Cornell University)Empirical Analysis of Predictive Algorithms for Collaborative Filtering
4,515 Citations2013John S. Breese, David Heckerman +1 more
A theory of the learnable
4,242 Citations1984Leslie G. Valiant
This paper regards learning as the phenomenon of knowledge acquisition in the absence of explicit programming, and gives a precise methodology for studying this phenomenon from a computational viewpoint.
Communications of the ACMUsing collaborative filtering to weave an information tapestry
4,040 Citations1992David Theo Goldberg, David M. Nichols +2 more
Tapestry is intended to handle any incoming stream of electronic documents and serves both as a mail filter and repository; its components are the indexer, document store, annotation store, filterer, little box, remailer, appraiser and reader/browser.
Communications of the ACMA theory of the learnable
3,268 Citations1984Leslie G. Valiant
This paper regards learning as the phenomenon of knowledge acquisition in the absence of explicit programming, and gives a precise methodology for studying this phenomenon from a computational viewpoint.
Social information filtering
2,800 Citations1995Upendra Shardanand, Pattie Maes
The implementation of a networked system called Ringo, which makes personalized recommendations for music albums and artists, and four different algorithms for making recommendations by using social information filtering were tested and compared.
ACM SIGIR ForumAn Algorithmic Framework for Performing Collaborative Filtering
2,552 Citations2017Jonathan L. Herlocker, Joseph A. Konstan +2 more
An algorithmic framework for performing collaborative filtering
1,973 Citations1999Jonathan L. Herlocker, Joseph A. Konstan +2 more
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.
Symposium on Discrete AlgorithmsAuthoritative sources in a hyperlinked environment
1,836 Citations1998Jon Kleinberg
IEEE Standard Glossary of Software Engineering Terminology
978 Citations1990
Machine LearningLearning From Noisy Examples
667 Citations1988Dana Angluin, Philip Laird
This paper shows that when the teacher may make independent random errors in classifying the example data, the strategy of selecting the most consistent rule for the sample is sufficient, and usually requires a feasibly small number of examples, provided noise affects less than half the examples on average.
Horting hatches an egg
388 Citations1999Charų C. Aggarwal, Joel L. Wolf +2 more
This paper introduces a new and novel approach to ratingbased collaborative filtering, based on the twin new concepts of ho&rag and predictability, which is fast, scalable, accurate, and requires only a modest learning curve.
Spectral analysis of data
292 Citations2001Yossi Azar, Amos Fiat +3 more
A model for framing data mining tasks and a unified approach to solving the resulting data mining problems using spectral analysis are presented, which give strong justification to the use of spectral techniques for latent semantic indexing, collaborative filtering, and web site ranking.
Link analysis, eigenvectors and stability
203 Citations2001Andrew Y. Ng, Alice X. Zheng +1 more
This paper addresses the question of when HITS and PageRank can be expected to give stable rankings under small perturbations to the hyperlink patterns, using tools from matrix perturbation theory and Markov chain theory.
Social Choice Theory and Recommender Systems: Analysis of the Axiomatic Foundations of Collaborative Filtering
192 Citations2000David M. Pennock, Eric Horvitz +1 more
Competitive recommendation systems
130 Citations2002Petros Drineas, Iordanis Kerenidis +1 more
This paper presents a notion of competitive recommendation systems, and presents a matrix reconstruction scheme that is competitive: it requires a small overhead in the number of users and products to be sampled, delivering in the process a net utility that closely approximates the best possible with full knowledge of all user-product preferences.
Learning in the presence of malicious errors
128 Citations1988Michael Kearns, Ming Li
General methods for bounding the rate of error tolerable by any learning algorithm, efficient algorithms tolerating nontrivial rates of malicious errors, and equivalences between problems of learning with errors and standard combinatorial optimization problems are studied.
Recommendation systems: a probabilistic analysis
102 Citations2002Ravi Kumar, Prabhakar Raghavan +2 more
A simple analytical framework for recommendation systems is introduced, including a basis for defining the utility of such a system, and probabilistic analyses of algorithmic methods within this framework yield insights into how much utility can be derived from the memory of past actions.
ePrints Soton (University of Southampton)Analyses of instance-based learning algorithms
22 Citations1991Marc K. Albert, David W. Aha
This paper presents PAC-learning analyses for instance-based learning algorithms for both symbolic and numeric-prediction tasks, and shows that a bound on the degree of difficulty of predicting symbolic values may be obtained by considering the size of the boundary of the target concept.
Estimating the robustness of discovered knowledge
17 Citations1995Chun‐Nan Hsu, Craig A. Knoblock
This paper defines robustness, then presents an estimation approach for the robustness of Horn-clause rules learned from a relational database, which applies the Laplace law of succession, which can be efficiently computed.
Lecture notes in computer scienceTorture Tests: A Quantitative Analysis for the Robustness of Knowledge-Based Systems
16 Citations2000P. Groot, Frank van Harmelen +1 more
A general approach to "degradation studies": an analysis of how system output degrades as a function of degrading system input, such as incomplete or incorrect inputs is proposed.
Discovering robust knowledge from dynamic closed-world data
9 Citations1996Chun‐Nan Hsu, Craig A. Knoblock
This paper defines this notion of robustness, describes how to estimate the robustness of Horn-clause rules in closed-world databases, and describes how the robusts estimation can be applied in rule discovery systems.