Mohsen Jamali, Martin Ester Simon Fraser University Vancouver, Canada UBC Data Mining Lab October 2010.

Slides:



Advertisements
Similar presentations
A Fast PTAS for k-Means Clustering
Advertisements

Online Max-Margin Weight Learning with Markov Logic Networks Tuyen N. Huynh and Raymond J. Mooney Machine Learning Group Department of Computer Science.
1
Fawaz Ghali Web 2.0 for the Adaptive Web.
Chapter 7 Sampling and Sampling Distributions
Handout # 16: Queuing Mechanisms; Middleboxes
Biostatistics Unit 5 Samples Needs to be completed. 12/24/13.
County-level Estimates of Leisure Time Physical Inactivity among Adults aged 20 years old Trends
Switching - Fabric An Engineering Approach to Computer Networking.
EE, NCKU Tien-Hao Chang (Darby Chang)
Operating Systems Operating Systems - Winter 2010 Chapter 3 – Input/Output Vrije Universiteit Amsterdam.
Computer vision: models, learning and inference
RecMax – Can we combine the power of Social Networks and Recommender Systems? Amit Goyal and L. RecMax: Exploting Recommender Systems for Fun and Profit.
Memory vs. Model-based Approaches SVD & MF Based on the Rajaraman and Ullman book and the RS Handbook. See the Adomavicius and Tuzhilin, TKDE 2005 paper.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
Testing Hypotheses About Proportions
Simple Linear Regression Analysis
January Structure of the book Section 1 (Ch 1 – 10) Basic concepts and techniques Section 2 (Ch 11 – 15): Inference for quantitative outcomes Section.
Local Area Networks1 LANs Studying Local Area Networks Via Media Access Control (MAC) SubLayer.
CO-AUTHOR RELATIONSHIP PREDICTION IN HETEROGENEOUS BIBLIOGRAPHIC NETWORKS Yizhou Sun, Rick Barber, Manish Gupta, Charu C. Aggarwal, Jiawei Han 1.
Item Based Collaborative Filtering Recommendation Algorithms
Amit Goyal Laks V. S. Lakshmanan RecMax: Exploiting Recommender Systems for Fun and Profit University of British Columbia
Collaborative QoS Prediction in Cloud Computing Department of Computer Science & Engineering The Chinese University of Hong Kong Hong Kong, China Rocky.
A Graph-based Recommender System Zan Huang, Wingyan Chung, Thian-Huat Ong, Hsinchun Chen Artificial Intelligence Lab The University of Arizona 07/15/2002.
COMP423 Intelligent Agents. Recommender systems Two approaches – Collaborative Filtering Based on feedback from other users who have rated a similar set.
COLLABORATIVE FILTERING Mustafa Cavdar Neslihan Bulut.
Active Learning and Collaborative Filtering
Learning to Recommend Hao Ma Supervisors: Prof. Irwin King and Prof. Michael R. Lyu Dept. of Computer Science & Engineering The Chinese University of Hong.
The Wisdom of the Few A Collaborative Filtering Approach Based on Expert Opinions from the Web Xavier Amatriain Telefonica Research Nuria Oliver Telefonica.
Mohsen Jamali, Martin Ester Simon Fraser University Vancouver, Canada ACM RecSys 2010.
Using a Trust Network To Improve Top-N Recommendation
Chen Cheng1, Haiqin Yang1, Irwin King1,2 and Michael R. Lyu1
TrustWalker: A Random Walk Model for Combining Trust-based and Item-based Recommendation Mohsen Jamali & Martin Ester Simon Fraser University, Vancouver,
1 Collaborative Filtering and Pagerank in a Network Qiang Yang HKUST Thanks: Sonny Chee.
Computing Trust in Social Networks
Collaborative Ordinal Regression Shipeng Yu Joint work with Kai Yu, Volker Tresp and Hans-Peter Kriegel University of Munich, Germany Siemens Corporate.
To Trust of Not To Trust? Predicting Online Trusts using Trust Antecedent Framework Viet-An Nguyen 1, Ee-Peng Lim 1, Aixin Sun 2, Jing Jiang 1, Hwee-Hoon.
Performance of Recommender Algorithms on Top-N Recommendation Tasks
Cao et al. ICML 2010 Presented by Danushka Bollegala.
Performance of Recommender Algorithms on Top-N Recommendation Tasks RecSys 2010 Intelligent Database Systems Lab. School of Computer Science & Engineering.
RecSys 2011 Review Qi Zhao Outline Overview Sessions – Algorithms – Recommenders and the Social Web – Multi-dimensional Recommendation, Context-
User Profiling based on Folksonomy Information in Web 2.0 for Personalized Recommender Systems Huizhi (Elly) Liang Supervisors: Yue Xu, Yuefeng Li, Richi.
Classical Music for Rock Fans?: Novel Recommendations for Expanding User Interests Makoto Nakatsuji, Yasuhiro Fujiwara, Akimichi Tanaka, Toshio Uchiyama,
User Interests Imbalance Exploration in Social Recommendation: A Fitness Adaptation Authors : Tianchun Wang, Xiaoming Jin, Xuetao Ding, and Xiaojun Ye.
Online Learning for Collaborative Filtering
1 Social Networks and Collaborative Filtering Qiang Yang HKUST Thanks: Sonny Chee.
EigenRank: A Ranking-Oriented Approach to Collaborative Filtering IDS Lab. Seminar Spring 2009 강 민 석강 민 석 May 21 st, 2009 Nathan.
Evaluation of Recommender Algorithms for an Internet Information Broker based on Simple Association Rules and on the Repeat-Buying Theory WEBKDD 2002 Edmonton,
A Content-Based Approach to Collaborative Filtering Brandon Douthit-Wood CS 470 – Final Presentation.
Evaluation of Recommender Systems Joonseok Lee Georgia Institute of Technology 2011/04/12 1.
1 Collaborative Filtering & Content-Based Recommending CS 290N. T. Yang Slides based on R. Mooney at UT Austin.
Intelligent DataBase System Lab, NCKU, Taiwan Josh Jia-Ching Ying, Eric Hsueh-Chan Lu, Wen-Ning Kuo and Vincent S. Tseng Institute of Computer Science.
Recommender Systems with Social Regularization Hao Ma, Dengyong Zhou, Chao Liu Microsoft Research Michael R. Lyu The Chinese University of Hong Kong Irwin.
Community-Based Link Prediction/Recommendation in the Bipartite Network of BoardGameGeek.com Brett Boge CS 765 University of Nevada, Reno.
A Clustering-based QoS Prediction Approach for Web Service Recommendation Shenzhen, China April 12, 2012 Jieming Zhu, Yu Kang, Zibin Zheng and Michael.
Collaborative Filtering via Euclidean Embedding M. Khoshneshin and W. Street Proc. of ACM RecSys, pp , 2010.
ICONIP 2010, Sydney, Australia 1 An Enhanced Semi-supervised Recommendation Model Based on Green’s Function Dingyan Wang and Irwin King Dept. of Computer.
Online Evolutionary Collaborative Filtering RECSYS 2010 Intelligent Database Systems Lab. School of Computer Science & Engineering Seoul National University.
The Wisdom of the Few Xavier Amatrian, Neal Lathis, Josep M. Pujol SIGIR’09 Advisor: Jia Ling, Koh Speaker: Yu Cheng, Hsieh.
Hao Ma, Dengyong Zhou, Chao Liu Microsoft Research Michael R. Lyu
COMP423 Intelligent Agents. Recommender systems Two approaches – Collaborative Filtering Based on feedback from other users who have rated a similar set.
Trust-aware Recommender Systems
StressSense: Detecting Stress in Unconstrained Acoustic Environments using Smartphones Hong Lu, Mashfiqui Rabbi, Gokul T. Chittaranjan, Denise Frauendorfer,
Matrix Factorization and Collaborative Filtering
WSRec: A Collaborative Filtering Based Web Service Recommender System
Methods and Metrics for Cold-Start Recommendations
Advisor: Prof. Shou-de Lin (林守德) Student: Eric L. Lee (李揚)
Asymmetric Correlation Regularized Matrix Factorization for Web Service Recommendation Qi Xie1, Shenglin Zhao2, Zibin Zheng3, Jieming Zhu2 and Michael.
ITEM BASED COLLABORATIVE FILTERING RECOMMENDATION ALGORITHEMS
Presentation transcript:

Mohsen Jamali, Martin Ester Simon Fraser University Vancouver, Canada UBC Data Mining Lab October 2010

Introduction Collaborative Filtering Social Recommendation Evaluating Recommenders TrustWalker SocialMF Conclusion Mohsen Jamali, Recommendation in Social Networks2

Introduction Collaborative Filtering Social Recommendation Evaluating Recommenders TrustWalker SocialMF Conclusion Mohsen Jamali, Recommendation in Social Networks3

Need For Recommenders Rapid Growth of Information Lots of Options for Users Input Data A set of users U={u 1, …, u N } A set of items I={i 1, …, i M } The rating matrix R=[r u,i ] NxM 4Mohsen Jamali, Recommendation in Social Networks

Predicting the rating on a target item for a given user ( i.e. Predicting Johns rating on Star Wars Movie ). Recommending a List of items to a given user ( i.e. Recommending a list of movies to John for watching ). movie1 ?? Recommender List of Top Movies ?? Recommender Movie 1Movie 2Movie 3 5Mohsen Jamali, Recommendation in Social Networks

Introduction Collaborative Filtering Social Recommendation Evaluating Recommenders TrustWalker SocialMF Conclusion Mohsen Jamali, Recommendation in Social Networks6

Most Used and Well Known Approach for Recommendation Finds Users with Similar Interests to the target User Aggregating their opinions to make a recommendation. Often used for the prediction task 7Mohsen Jamali, Recommendation in Social Networks

TargetCustomer Aggregator Prediction 8Mohsen Jamali, Recommendation in Social Networks

Normally, there are a lot more users than items Collaborative Filtering doesnt scale well with users Item based Collaborative Filtering has been proposed in 2001 They showed that the quality of results are compatible in item based CF 9Mohsen Jamali, Recommendation in Social Networks

10Mohsen Jamali, Recommendation in Social Networks

Aggregator Prediction 11Mohsen Jamali, Recommendation in Social Networks

Introduction Collaborative Filtering Social Recommendation Evaluating Recommenders TrustWalker SocialMF Conclusion Mohsen Jamali, Recommendation in Social Networks12

Social Networks Emerged Recently Independent source of information Motivation of SN-based RS Social Influence: users adopt the behavior of their friends Social Rating Network Social Network Trust Network Mohsen Jamali, Recommendation in Social Networks13

Cold Start users Very few ratings 50% of users Main target of SN recommenders Mohsen Jamali, Recommendation in Social Networks14 A Sample Social Rating Network

Classification of Recommenders Memory based Model based Memory based approaches for recommendation in social networks [Golbeck, 2005] [Massa et.al. 2007] [Jamali et.al. 2009] [Ziegler, 2005] Mohsen Jamali, Recommendation in Social Networks15

Explores the trust network to find Raters. Aggregate the ratings from raters for prediction. Different weights for users 16 Mohsen Jamali, Recommendation in Social Networks16

Introduction Collaborative Filtering Social Recommendation Evaluating Recommenders TrustWalker SocialMF Conclusion Mohsen Jamali, Recommendation in Social Networks17

Cross Validation K-Fold Leave-one-out Root Mean Squared Error (RMSE) Mean Absolute Error (MAE) Mohsen Jamali, Recommendation in Social Networks18

Epinions – public domain Flixster Flixster.com is a social networking service for movie rating The crawled data set includes data from Nov 2005 – Nov 2009 Available at Mohsen Jamali, Recommendation in Social Networks19

Mohsen Jamali, Recommendation in Social Networks20 General Statistics of Flixster and Epinions Flixster: 1M users, 47K items 150K users with at least one rating Items: movies 53% cold start Epinions: 71K users, 108K items Items: DVD Players, Printers, Books, Cameras,… 51% cold start

Introduction Collaborative Filtering Social Recommendation Evaluating Recommenders TrustWalker SocialMF Conclusion Mohsen Jamali, Recommendation in Social Networks21

Issues in Trust-based Recommendation Noisy data in far distances Low probability of Finding rater at close distances 22 Mohsen Jamali, Recommendation in Social Networks22

How Far to Go into Network? Tradeoff between Precision and Recall Trusted friends on similar items Far neighbors on the exact target item 23 Mohsen Jamali, Recommendation in Social Networks23

TrustWalker Random Walk Model Combines Item-based Recommendation and Trust-based Recommendation Random Walk To find a rating on the exact target item or a similar item Prediction = returned rating 24 Mohsen Jamali, Recommendation in Social Networks24

Starts from Source user u 0. At step k, at node u: If u has rated I, return r u,i With Φ u,i,k, the random walk stops Randomly select item j rated by u and return r u,j. With 1- Φ u,i,k, continue the random walk to a direct neighbor of u. 25 Mohsen Jamali, Recommendation in Social Networks25

Item Similarities Φ u,i,k Similarity of items rated by u and target item i. The step of random walk 26Mohsen Jamali, Recommendation in Social Networks

Prediction = Expected value of rating returned by random walk. 27Mohsen Jamali, Recommendation in Social Networks

Special Cases of TrustWalker Φ u,i,k = 1 Random Walk Never Starts. Item-based Recommendation. Φ u,i,k = 0 Pure Trust-based Recommendation. Continues until finding the exact target item. Aggregates the ratings weighted by probability of reaching them. Existing methods approximate this. Confidence How confident is the prediction 28Mohsen Jamali, Recommendation in Social Networks

Evaluation method Leave-one-out Evaluation Metric s RMSE Coverage Precision = 1- RMSE/4 29Mohsen Jamali, Recommendation in Social Networks

Tidal Trust [Golbeck, 2005] Mole Trust [Massa, 2007] CF Pearson Random Walk 6,1 Item-based CF TrustWalker0 [-pure] TrustWalker [-pure] 30 Mohsen Jamali, Recommendation in Social Networks30

31Mohsen Jamali, Recommendation in Social Networks

32Mohsen Jamali, Recommendation in Social Networks

More confident Predictions have lower error 33Mohsen Jamali, Recommendation in Social Networks

Introduction Collaborative Filtering Social Recommendation Evaluating Recommenders TrustWalker SocialMF Conclusion Mohsen Jamali, Recommendation in Social Networks34

Model based approach Latent features for users Latent features for items Ratings are scaled to [0,1] g is logistic function Mohsen Jamali, Recommendation in Social Networks35 U and V have normal priors

Mohsen Jamali, Recommendation in Social Networks36

Issues with STE Feature vectors of neighbors should influence the feature vector of u not his ratings STE does not handle trust propagation Learning is based on observed ratings only. Mohsen Jamali, Recommendation in Social Networks37

Social Influence behavior of a user u is affected by his direct neighbors N u. Latent characteristics of a user depend on his neighbors. T u,v is the normalized trust value. Mohsen Jamali, Recommendation in Social Networks38

Mohsen Jamali, Recommendation in Social Networks39

Mohsen Jamali, Recommendation in Social Networks40

Mohsen Jamali, Recommendation in Social Networks41

Mohsen Jamali, Recommendation in Social Networks42

Mohsen Jamali, Recommendation in Social Networks43

Properties of SocialMF Trust Propagation User latent feature learning possible with existence of the social network No need to fully observed rating for learning Appropriate for cold start users Mohsen Jamali, Recommendation in Social Networks44

5-fold cross validation Using RMSE for evaluation Comparison Partners Basic MF STE CF Model parameters SocialMF: STE: Mohsen Jamali, Recommendation in Social Networks45

Gain over STE: 6.2%. for K=5 and 5.7% for K=10 Mohsen Jamali, Recommendation in Social Networks46

SocialMF gain over STE (5%) is 3 times the STE gain over BasicMF (1.5%) Mohsen Jamali, Recommendation in Social Networks47

Lower error for Flixster Mohsen Jamali, Recommendation in Social Networks48 Epinions Flixster

Mohsen Jamali, Recommendation in Social Networks49 Sensitivity Analysis for Epinions

Mohsen Jamali, Recommendation in Social Networks50 Sensitivity Analysis for Flixster

Mohsen Jamali, Recommendation in Social Networks51 RMSE values on cold start users (K=5)

Mohsen Jamali, Recommendation in Social Networks52 RMSE values on cold start users (K=5)

Mohsen Jamali, Recommendation in Social Networks53

SocialMF: STE: SocialMF is faster by factor Mohsen Jamali, Recommendation in Social Networks54 N# of Users KLatent Feature Size Avg. ratings per user Avg. neighbors per user

Introduction Collaborative Filtering Social Recommendation Evaluating Recommenders TrustWalker SocialMF Conclusion Mohsen Jamali, Recommendation in Social Networks55

TrustWalker [KDD 2009] Memory-based Random walk approach SocialMF [RecSys 2010] Model based Matrix Factorization approach Other work Top-N Recommendation (RecSys 2009) Link Prediction (ACM TIST 2010) Mohsen Jamali, Recommendation in Social Networks56

Future Work Framework for Clustering, Rating and Link Prediction Explaining the recommendations Constructing the social network from observed data. Mohsen Jamali, Recommendation in Social Networks57

Thank you! 58Mohsen Jamali, Recommendation in Social Networks