Recommender Systems: User Experience and System Issues

Similar documents
Recommender Systems: User Experience and System Issues. About me. Scope of Recommenders. A Quick Introduction. Wide Range of Algorithms

Scope of Recommenders. Recommender Systems: User Experience and System Issues. Wide Range of Algorithms. About me. Classic Collaborative Filtering

Recommender Systems: User Experience and System Issues. About me. Scope of Recommenders. A Quick Introduction. Wide Range of Algorithms

Automatically Building Research Reading Lists

Collaborative Filtering based on User Trends

Content-based Dimensionality Reduction for Recommender Systems

Author(s): Rahul Sami, 2009

Recommender Systems New Approaches with Netflix Dataset

Recommender Systems - Content, Collaborative, Hybrid

Property1 Property2. by Elvir Sabic. Recommender Systems Seminar Prof. Dr. Ulf Brefeld TU Darmstadt, WS 2013/14

Mining Web Data. Lijun Zhang

Study on Recommendation Systems and their Evaluation Metrics PRESENTATION BY : KALHAN DHAR

New user profile learning for extremely sparse data sets

Seminar Collaborative Filtering. KDD Cup. Ziawasch Abedjan, Arvid Heise, Felix Naumann

Recommender Systems. Collaborative Filtering & Content-Based Recommending

Using Data Mining to Determine User-Specific Movie Ratings

Web Personalization & Recommender Systems

Project Report. An Introduction to Collaborative Filtering

A System for Identifying Voyage Package Using Different Recommendations Techniques

Introduction to Data Mining

Data Mining Lecture 2: Recommender Systems

Mining Web Data. Lijun Zhang

Recommender Systems - Introduction. Data Mining Lecture 2: Recommender Systems

amount of available information and the number of visitors to Web sites in recent years

The Design and Implementation of an Intelligent Online Recommender System

BordaRank: A Ranking Aggregation Based Approach to Collaborative Filtering

CS246: Mining Massive Datasets Jure Leskovec, Stanford University

Joining Collaborative and Content-based Filtering

Towards a hybrid approach to Netflix Challenge

A Scalable, Accurate Hybrid Recommender System

Web Personalization & Recommender Systems

Reddit Recommendation System Daniel Poon, Yu Wu, David (Qifan) Zhang CS229, Stanford University December 11 th, 2011

The Principle and Improvement of the Algorithm of Matrix Factorization Model based on ALS

Review on Techniques of Collaborative Tagging

Recommender Systems: Practical Aspects, Case Studies. Radek Pelánek

Prowess Improvement of Accuracy for Moving Rating Recommendation System

Opportunities and challenges in personalization of online hotel search

Privacy Preserving Data Sharing in Data Mining Environment

Part 12: Advanced Topics in Collaborative Filtering. Francesco Ricci

Application of Dimensionality Reduction in Recommender System -- A Case Study

Jeff Howbert Introduction to Machine Learning Winter

The influence of social filtering in recommender systems

Part I: Data Mining Foundations

Community-Based Recommendations: a Solution to the Cold Start Problem

Reviewer Profiling Using Sparse Matrix Regression

Recommender Systems (RSs)

Recommender Systems. Master in Computer Engineering Sapienza University of Rome. Carlos Castillo

Part 11: Collaborative Filtering. Francesco Ricci

COMP 465: Data Mining Recommender Systems

Influence in Ratings-Based Recommender Systems: An Algorithm-Independent Approach

Robustness and Accuracy Tradeoffs for Recommender Systems Under Attack

Clustering. Robert M. Haralick. Computer Science, Graduate Center City University of New York

By Atul S. Kulkarni Graduate Student, University of Minnesota Duluth. Under The Guidance of Dr. Richard Maclin

Collaborative Filtering using Euclidean Distance in Recommendation Engine

CPSC 340: Machine Learning and Data Mining. Principal Component Analysis Fall 2016

Collaborative Filtering Based on Iterative Principal Component Analysis. Dohyun Kim and Bong-Jin Yum*

CS246: Mining Massive Datasets Jure Leskovec, Stanford University

Collaborative Filtering using a Spreading Activation Approach

Know your neighbours: Machine Learning on Graphs

Proposing a New Metric for Collaborative Filtering

A probabilistic model to resolve diversity-accuracy challenge of recommendation systems

Recap: Project and Practicum CS276B. Recommendation Systems. Plan for Today. Sample Applications. What do RSs achieve? Given a set of users and items

Part 11: Collaborative Filtering. Francesco Ricci

A Constrained Spreading Activation Approach to Collaborative Filtering

CS249: ADVANCED DATA MINING

Recommendation Systems

Introduction p. 1 What is the World Wide Web? p. 1 A Brief History of the Web and the Internet p. 2 Web Data Mining p. 4 What is Data Mining? p.

Explaining Recommendations: Satisfaction vs. Promotion

K Nearest Neighbor Wrap Up K- Means Clustering. Slides adapted from Prof. Carpuat

ROBUST LOW-RANK MATRIX FACTORIZATION WITH MISSING DATA BY MINIMIZING L1 LOSS APPLIED TO COLLABORATIVE FILTERING. Shama Mehnaz Huda

Comparison of Recommender System Algorithms focusing on the New-Item and User-Bias Problem

GENETIC ALGORITHM BASED COLLABORATIVE FILTERING MODEL FOR PERSONALIZED RECOMMENDER SYSTEM

Bing Liu. Web Data Mining. Exploring Hyperlinks, Contents, and Usage Data. With 177 Figures. Springer

Making Recommendations Better: An Analytic Model for Human- Recommender Interaction

Movie Recommender System - Hybrid Filtering Approach

Combining Review Text Content and Reviewer-Item Rating Matrix to Predict Review Rating

Singular Value Decomposition, and Application to Recommender Systems

CSC 411 Lecture 18: Matrix Factorizations

Performance Comparison of Algorithms for Movie Rating Estimation

Hybrid Recommendation System Using Clustering and Collaborative Filtering

The Comparative Study of Machine Learning Algorithms in Text Data Classification*

A Systems Approach to Dimensional Modeling in Data Marts. Joseph M. Firestone, Ph.D. White Paper No. One. March 12, 1997

Topic Diversity Method for Image Re-Ranking

TriRank: Review-aware Explainable Recommendation by Modeling Aspects

ECS289: Scalable Machine Learning

Clustering. Bruno Martins. 1 st Semester 2012/2013

Thanks to Jure Leskovec, Anand Rajaraman, Jeff Ullman

Hotel Recommendation Based on Hybrid Model

A Recommender System Based on Improvised K- Means Clustering Algorithm

REMOVAL OF REDUNDANT AND IRRELEVANT DATA FROM TRAINING DATASETS USING SPEEDY FEATURE SELECTION METHOD

A Constrained Spreading Activation Approach to Collaborative Filtering

CS 584 Data Mining. Classification 1

An Oracle White Paper October Oracle Social Cloud Platform Text Analytics

Keyword Extraction by KNN considering Similarity among Features

Creating a Recommender System. An Elasticsearch & Apache Spark approach

Musings on Exabyte Scale Principal Component Analysis. Randy Paffenroth

BBS654 Data Mining. Pinar Duygulu

Performance of Recommender Algorithms on Top-N Recommendation Tasks

Recommender Systems. Nivio Ziviani. Junho de Departamento de Ciência da Computação da UFMG

SENSOR SELECTION SCHEME IN TEMPERATURE WIRELESS SENSOR NETWORK

Transcription:

Recommender Systems: User Experience and System ssues Joseph A. Konstan University of Minnesota konstan@cs.umn.edu http://www.grouplens.org Summer 2005 1 About me Professor of Computer Science & Engineering, Univ. of Minnesota Ph.D. (1993) from U.C. Berkeley GU toolkit architecture Teaching nterests: HC, GU Tools Research nterests: General HC, and... Collaborative nformation Filtering Multimedia Authoring and Systems Visualization and nformation Management Medical/Health Applications and their Delivery Summer 2005 2

A Quick ntroduction What are recommender systems? Tools to help identify worthwhile stuff Filtering interfaces E-mail filters, clipping services Recommendation interfaces Suggestion lists, top-n, offers and promotions Prediction interfaces Evaluate candidates, predicted ratings Summer 2005 3 Scope of Recommenders Purely Editorial Recommenders Content Filtering Recommenders Collaborative Filtering Recommenders Hybrid Recommenders Summer 2005 4

Wide Range of Algorithms Simple Keyword Vector Matches Pure Nearest-Neighbor Collaborative Filtering Machine Learning on Content or Ratings Summer 2005 5 Classic Collaborative Filtering MovieLens* K-nearest neighbor algorithm Model-free, memory-based implementation ntuitive application, supports typical interfaces *Note newest releases use updated architecture/algorithm Summer 2005 6

CF Classic C.F. Engine Ratings Correlations Summer 2005 7 Submit Ratings ratings C.F. Engine Ratings Correlations Summer 2005 8

Store Ratings ratings C.F. Engine Ratings Correlations Summer 2005 9 Compute Correlations C.F. Engine pairwise corr. Ratings Correlations Summer 2005 10

Request Recommendations C.F. Engine request Ratings Correlations Summer 2005 11 dentify Neighbors C.F. Engine find good Ratings Correlations Neighborhood Summer 2005 12

Select tems; Predict Ratings C.F. Engine predictions recommendations Ratings Correlations Neighborhood Summer 2005 13 Hoop Dreams Star Wars Understanding the Computation Pretty Woman Titanic Blimp Rocky XV Joe D A B D?? John A F D F Susan A A A A A A Pat D A C Jean A C A C A Ben F A F Nathan D A A Summer 2005 14

Hoop Dreams Star Wars Understanding the Computation Pretty Woman Titanic Blimp Rocky XV Joe D A B D?? John A F D F Susan A A A A A A Pat D A C Jean A C A C A Ben F A F Nathan D A A Summer 2005 15 Hoop Dreams Star Wars Understanding the Computation Pretty Woman Titanic Blimp Rocky XV Joe D A B D?? John A F D F Susan A A A A A A Pat D A C Jean A C A C A Ben F A F Nathan D A A Summer 2005 16

Hoop Dreams Star Wars Understanding the Computation Pretty Woman Titanic Blimp Rocky XV Joe D A B D?? John A F D F Susan A A A A A A Pat D A C Jean A C A C A Ben F A F Nathan D A A Summer 2005 17 Hoop Dreams Star Wars Understanding the Computation Pretty Woman Titanic Blimp Rocky XV Joe D A B D?? John A F D F Susan A A A A A A Pat D A C Jean A C A C A Ben F A F Nathan D A A Summer 2005 18

Hoop Dreams Star Wars Understanding the Computation Pretty Woman Titanic Blimp Rocky XV Joe D A B D?? John A F D F Susan A A A A A A Pat D A C Jean A C A C A Ben F A F Nathan D A A Summer 2005 19 Hoop Dreams Star Wars Understanding the Computation Pretty Woman Titanic Blimp Rocky XV Joe D A B D?? John A F D F Susan A A A A A A Pat D A C Jean A C A C A Ben F A F Nathan D A A Summer 2005 20

ML-home Summer 2005 21 ML-comedy Summer 2005 22

ML-clist Summer 2005 23 ML-rate Summer 2005 24

ML-search Summer 2005 25 ML-slist Summer 2005 26

ML-buddies Summer 2005 27 Talk Roadmap ntroduction Algorithms nfluencing Users Current Research Summer 2005 28

Non-Personalized Summary Statistics K-Nearest Neighbor user-user item-item Dimensionality Reduction Content + Collaborative Filtering Graph Techniques Clustering Classifier Learning Collaborative Filtering Algorithms Summer 2005 29 tem-tem Collaborative Filtering Summer 2005 30

Summer 2005 31 tem-tem Collaborative Filtering Summer 2005 32 tem-tem Collaborative Filtering

1 2 s i,j =? tem Similarities 1 2 3 i j n-1 n R R - R u R R Used for similarity computation m-1 R R m R - Summer 2005 33 tem-tem Matrix Formulation Target item 1 2 1 2 3 i-1 i m-1 m u R R R - R s i,i-1 u R R R - R s i,1 s i,3 prediction s i,m m weighted sum regression-based 2nd 1st 4th 3rd 5th 5 closest neighbors Raw scores for prediction generation Approximation based on linear regression Summer 2005 34

tem-tem Discussion Good quality, in sparse situations Promising for incremental model building Small quality degradation Big performance gain Summer 2005 35 Non-Personalized Summary Statistics K-Nearest Neighbor Dimensionality Reduction Singular Value Decomposition Factor Analysis Content + Collaborative Filtering Graph Techniques Clustering Classifier Learning Collaborative Filtering Algorithms Summer 2005 36

Dimensionality Reduction Latent Semantic ndexing Used by the R community Worked well with the vector space model Used Singular Value Decomposition (SVD) Main dea Term-document matching in feature space Captures latent association Reduced space is less-noisy Summer 2005 37 SVD: Mathematical Background R R k = U U k S S k V V k m X n m X rk r k X rk k r X n The reconstructed matrix R k = U k.s k.v k is the closest rank-k matrix to the original matrix R. Summer 2005 38

SVD for Collaborative Filtering 1. Low dimensional representation O(m+n) storage requirement k x n m x n m x k. 2. Direct Prediction Summer 2005 39 Singular Value Decomposition Reduce dimensionality of problem Results in small, fast model Richer Neighbor Network ncremental Update Folding in Model Update Summer 2005 40

Collaborative Filtering Algorithms Non-Personalized Summary Statistics K-Nearest Neighbor Dimensionality Reduction Content + Collaborative Filtering Graph Techniques Horting: Navigate Similarity Graph Clustering Classifier Learning Rule-nduction Learning Bayesian Belief Networks Summer 2005 41 Talk Roadmap ntroduction Algorithms nfluencing Users Cosley et al, CH 2003 Current Research Summer 2005 42

Does Seeing Predictions Affect User Ratings? RERATE: Ask 212 users to rate 40 movies 10 with no shown prediction 30 with shown predictions (random order): 10 accurate, 10 up a star, 10 down a star Compare ratings to accurate predictions Prediction is user s original rating Hypothesis: users rate in the direction of the shown prediction Summer 2005 43 The Study Summer 2005 44

Seeing Matters Ratings % 80% 60% 40% 20% 0% Not show n Show n Below At Above Prediction shown? Summer 2005 45 Accuracy Matters Ratings % 80% 60% 40% 20% 0% Down Accurate Up Below At Above Prediction manipulation Summer 2005 46

Domino Effects? The power to manipulate? Summer 2005 47 Recap of RERATE effects: Rated, Unrated, Doesn t Matter Showing prediction changed 8% of ratings Altering shown prediction changed 12% Similar experiment, UNRATED movies 137 experimental users, 1599 ratings Showing prediction changed 8% of ratings Altering shown prediction changed 14% Summer 2005 48

But Users Notice! Users are often insensitive UNRATED part 2: satisfaction survey Control group: only accurate predictions Experimental predictions accurate, useful? ML predictions overall accurate, useful? Manipulated preds less well liked Surprise: 24 bad = MovieLens worse! Summer 2005 49 Talk Roadmap ntroduction Algorithms nfluencing Users Current Research Summer 2005 50

Current Research Themes Beyond Accuracy: Metrics and Algorithms New User Orientation nfluence and Shilling Eliciting Participation in On-Line Communities Reinventing Conversation Beyond Entertainment: Recommending Research Papers Summer 2005 51 Beyond Accuracy What affects user satisfaction? Novelty Confirmability Diversity Value How to measure? Custom tuned algorithms Herlocker et al., ACM TOS 1/2004 Summer 2005 52

New User Orientation How do we start new users? nterface (McNee et al., UM 2003) System-initiated User-initiated Mixed Content (Rashid et al., U 2002) Popular Entropy Mix Predict Seen Summer 2005 53 nfluence and Shilling nfluence (Rashid et al., SAM Data Mining 2005) Who has it? How much? Measurements? Shilling (Lam and Riedl, WWW 2004) Attacks Defenses Algorithm Differences Summer 2005 54

Eliciting Participation: An nitial Study A study of participation in discussions with two factors controlled Similarity of tastes Awareness of own uniqueness Results Dissimilarity increased contribution Awareness of own uniqueness increased contribution Active discussants were not highly-active raters Participants rated more than a control group Summer 2005 55 Motivational Follow- Up Class projects at CMU used an e-mail campaign to elicit ratings to discover: Making users aware of their uniqueness increased rating Giving users specific, achievable goals increased rating But Reminding users of their self-benefit or benefit to others actually decreased the number of ratings! Summer 2005 56

Other Projects Self-Maintaining Communities What happens when you let the masses maintain the database? Social Preference Using economic models to study user behavior Summer 2005 57 Reinventing Conversation Goal: More comprehensive engagement Full-factorial design around entities, people, comments/discussion entries Summer 2005 58

Summer 2005 59 Summer 2005 60

Summer 2005 61 Summer 2005 62

Recommending Research Papers Using Citation Webs For a full paper, we can recommend citations A paper rates the papers it cites Every paper has ratings in the system Other citation web mappings are possible, but many are have problems Summer 2005 63 Results Thus Far Off-line studies showed promise On-line study showed different algorithms met different needs General positive attitude from users Typically one or two useful recommendations in a set of five That s enough to be useful Specific value for hybrid content/collab algorithsms Current work: ACM Digital Library Summer 2005 64

Summer 2005 65 Summer 2005 66

Summer 2005 67 Summer 2005 68

Summer 2005 69 Directions Application-Focused Research Awareness service Paper and proposal-writing support Find people (reviewers/experts) Overview of a field Summer 2005 70

Conclusions From humble origins Substantial algorithmic research HC and online community research mportant applications Commercial deployment Summer 2005 71 Acknowledgements This work is being supported by grants from the National Science Foundation, and by grants from Net Perceptions, nc. Many people have contributed ideas, time, and energy to this project. Summer 2005 72

Recommender Systems: User Experience and System ssues Joseph A. Konstan University of Minnesota konstan@cs.umn.edu http://www.grouplens.org Summer 2005 73