Circle-based Recommendation in Online Social Networks

Similar documents
Joint user knowledge and matrix factorization for recommender systems

A Matrix Factorization Technique with Trust Propagation for Recommendation in Social Networks

Point-of-Interest Recommendations: Learning Potential Check-ins from Friends

Recommendation Systems

Exploiting Local and Global Social Context for Recommendation

Matrix Factorization Techniques for Recommender Systems

Recommendation Systems

Item Recommendation for Emerging Online Businesses

Exploiting Emotion on Reviews for Recommender Systems

Scaling Neighbourhood Methods

Collaborative Recommendation with Multiclass Preference Context

Recommendation Systems

A Modified PMF Model Incorporating Implicit Item Associations

Discerning individual interests and shared interests for social user profiling

Recommender Systems with Social Regularization

Predicting Neighbor Goodness in Collaborative Filtering

Interact with Strangers

APPLICATIONS OF MINING HETEROGENEOUS INFORMATION NETWORKS

SoCo: A Social Network Aided Context-Aware Recommender System

TAPER: A Contextual Tensor- Based Approach for Personalized Expert Recommendation

Recommender Systems. Dipanjan Das Language Technologies Institute Carnegie Mellon University. 20 November, 2007

Collaborative Filtering on Ordinal User Feedback

Recommender Systems EE448, Big Data Mining, Lecture 10. Weinan Zhang Shanghai Jiao Tong University

A Gradient-based Adaptive Learning Framework for Efficient Personal Recommendation

Scalable Hierarchical Recommendations Using Spatial Autocorrelation

Clustering based tensor decomposition

Recommendations in Signed Social Networks

Large-scale Collaborative Ranking in Near-Linear Time

Andriy Mnih and Ruslan Salakhutdinov

Data Mining Techniques

* Matrix Factorization and Recommendation Systems

SQL-Rank: A Listwise Approach to Collaborative Ranking

Similar but Different: Exploiting Users Congruity for Recommendation Systems

Trust-Based Infinitesimals for Enhanced Collaborative Filtering

Matrix Factorization Techniques for Recommender Systems

Asymmetric Correlation Regularized Matrix Factorization for Web Service Recommendation

A Bayesian Treatment of Social Links in Recommender Systems ; CU-CS

A Regularized Recommendation Algorithm with Probabilistic Sentiment-Ratings

Mixed Membership Matrix Factorization

Decoupled Collaborative Ranking

Collaborative topic models: motivations cont

Collaborative Filtering. Radek Pelánek

Factor Modeling for Advertisement Targeting

Collaborative Filtering

Large-Scale Social Network Data Mining with Multi-View Information. Hao Wang

Algorithms for Collaborative Filtering

Mixed Membership Matrix Factorization

Collaborative Filtering with Aspect-based Opinion Mining: A Tensor Factorization Approach

SCMF: Sparse Covariance Matrix Factorization for Collaborative Filtering

Multi-Relational Matrix Factorization using Bayesian Personalized Ranking for Social Network Data

Collaborative Filtering with Entity Similarity Regularization in Heterogeneous Information Networks

Supplementary material for UniWalk: Explainable and Accurate Recommendation for Rating and Network Data

Kernelized Probabilistic Matrix Factorization: Exploiting Graphs and Side Information

Collaborative Topic Modeling for Recommending Scientific Articles

Collaborative Filtering with Social Local Models

Additive Co-Clustering with Social Influence for Recommendation

Facing the information flood in our daily lives, search engines mainly respond

Collaborative Filtering via Different Preference Structures

Crowd-Learning: Improving the Quality of Crowdsourcing Using Sequential Learning

Predicting the Performance of Collaborative Filtering Algorithms

Incorporating reliability measurements into the predictions of a recommender system

Matrix Factorization Techniques For Recommender Systems. Collaborative Filtering

Matrix Factorization In Recommender Systems. Yong Zheng, PhDc Center for Web Intelligence, DePaul University, USA March 4, 2015

Recurrent Latent Variable Networks for Session-Based Recommendation

Binary Principal Component Analysis in the Netflix Collaborative Filtering Task

Matrix Factorization and Factorization Machines for Recommender Systems

Matrix Factorization with Content Relationships for Media Personalization

TopRec: Domain-Specific Recommendation through Community Topic Mining in Social Network

COT: Contextual Operating Tensor for Context-Aware Recommender Systems

A Monte Carlo Algorithm for Cold Start Recommendation

Recommender System for Yelp Dataset CS6220 Data Mining Northeastern University

Probabilistic Neighborhood Selection in Collaborative Filtering Systems

CoSoLoRec: Joint Factor Model with Content, Social, Location for Heterogeneous Point-of-Interest Recommendation

Preference Relation-based Markov Random Fields for Recommender Systems

Location Regularization-Based POI Recommendation in Location-Based Social Networks

Transfer Learning for Collective Link Prediction in Multiple Heterogenous Domains

Learning to Recommend Point-of-Interest with the Weighted Bayesian Personalized Ranking Method in LBSNs

User Preference Learning for Online Social Recommendation

Crowdsourcing via Tensor Augmentation and Completion (TAC)

CS249: ADVANCED DATA MINING

Large-scale Ordinal Collaborative Filtering

Data Science Mastery Program

A Survey of Point-of-Interest Recommendation in Location-Based Social Networks

Learning Optimal Ranking with Tensor Factorization for Tag Recommendation

Improving Quality of Crowdsourced Labels via Probabilistic Matrix Factorization

Link Prediction. Eman Badr Mohammed Saquib Akmal Khan

Modeling User Rating Profiles For Collaborative Filtering

CS 175: Project in Artificial Intelligence. Slides 4: Collaborative Filtering

Rating Prediction with Topic Gradient Descent Method for Matrix Factorization in Recommendation

Little Is Much: Bridging Cross-Platform Behaviors through Overlapped Crowds

Review: Probabilistic Matrix Factorization. Probabilistic Matrix Factorization (PMF)

Mining Signed Social Networks Using Unsupervised Learning Algorithms. Kewei Cheng

Matrix Factorization with Explicit Trust and Distrust Side Information for Improved Social Recommendation

What is Happening Right Now... That Interests Me?

Mitigating Data Sparsity Using Similarity Reinforcement-Enhanced Collaborative Filtering

a Short Introduction

Data Mining Techniques

Overlapping Community Detection at Scale: A Nonnegative Matrix Factorization Approach

Ranking and Filtering

NCDREC: A Decomposability Inspired Framework for Top-N Recommendation

Transcription:

Circle-based Recommendation in Online Social Networks Xiwang Yang, Harald Steck*, and Yong Liu Polytechnic Institute of NYU * Bell Labs/Netflix 1

Outline q Background & Motivation q Circle-based RS Trust Circle Inference Trust Value Assignment Model Training q Evaluation q Conclusion 2

Background q Information overloading in web 2.0 recommender system widely deployed 3 q Battling data sparsity social networks as input social homophily, social influence q Social networks include multiple circles more refined information user trusts different subsets of friends in different domains(cars, Music ) construct social circles specific to item categories

Collaborative Filtering(CF) q Most Used and Well Known Approach for Recommendation q Finds Users with Similar Interests to the target User q Aggregating their opinions to make a recommendation. 4

User Based Collaborative Filtering Target Customer Aggregator u w u u r w u u, i 5 Prediction

6 Item-based Collaborative Filtering

Item-Item Collaborative Filtering Aggregator i i w r i w i u, i 7 Prediction

Matrix Factorization(BaseMF) [NIPS08] q Model based approach q Latent feature of user u, q Latent feature of item i, P i q Prediction Model: ˆ T R = r + Q P PR ( PQ,, σ ) = [ NR ( Rˆ ), σ ] 2 2 R u, i u, i R all u all i T 2 I [ NR ( ui, rm QP u i ), σ R] all u all i = + ui, m u i q Objective Function 1 ˆ 2 λ 2 2 ( Rui, Rui, ) + ( P F + Q F) 2 2 ( ui, ) obs. R ui, Q u I 1 d 1 d R ui, P and Q have normal priors 8

9 Social Recommenders Everywhere

Related Work-Social Recommender q Social Recommendation (SoRec) Model CIKM 08 Factorizing social trust matrix together with user rating matrix q Social Trust Ensemble (STE) Model SIGIR 09 User s rating influenced by social friends q SocialMF Model RecSys 10 User s latent feature(taste) influenced by social friends Handle trust propagation in social network q Using whole trust network for item rating prediction 10

Proposed Improvements for Current Social Recommender q Social networks include multiple circles A more refined social trust information richer information Want to incorporate circle information into Social Recommender Ideally, use trust circles specific to an item category when predict rating in this category E.g. Trust Circle of Music, Trust Circle of Cars, etc 11

Proposed Improvements for Current Social Recommender Existing circles(google+, facebook) not corresponding to an item category 12

Proposed Improvements for Current Social Recommender q In existing multi-category rating datasets, no circle information q User trusts different subsets of friends in different domains(cars, Music ) q User trusts different friends differently, related to friend s expertise value q Should use trust circle specific to item category 13

Outline q Background & Motivation q Circle-based RS Trust Circle Inference Trust Value Assignment Model Training q Evaluation q Conclusion & Future work 14

Trust Circle Inference q User v is in inferred circle c of u iff u trust v in original social network and both of them have rating in category c Original Social Network Inferred circle for category C1 Inferred circle for category C2 Inferred circle for category C3 15

Trust Value Assignment q CircleCon1: Equal Trust each user in the inferred circle gets assigned the same trust value S = const if v C ( c)* ( c) uv, u v C ( c ) u S ( c)* uv, = 1 S, = 1 C, v C ( c)* ( c) ( c) uv u u 16

Trust Value Assignment q CircleCon2: Expertise-based Trust assign a higher trust value or weight to the friends that are experts in the circle / category. 17 Variant a: Expertise value of user u proportional to u s number of ratings in a circle Variant b: Expertise based on u s number of rating in circle and voting value from u s followers in this circle

CircleCon3: Trust Splitting Original trust link trust link in c1 trust link in c2 q Most trust due to followee s rating in one category q Likelihood u2 trusts u1 in C1, C2? q Infer likelihood proportional on u2 s number of ratings in C1 and C2. q Assign trust value in a category proportional to the likelihood u2 trusts u1 in a category 18

CircleCon3: Trust Splitting N c u c = 9, N = 1 1 2 u 1 1 S = 0.9, S = 0.1 ( c1) ( c2) u, u u, u 2 1 2 1 q Normalize across followees S = S S ( c)* ( c) ( c) uv, uv, uv, v C ( c ) u 19

Outline q Background & Motivation q Circle-based RS Trust Circle Inference Trust Value Assignment Model Training q Evaluation q Conclusion & Future work 20

Model Training q Training with ratings from each category Predict user s rating in category c Input rating: rating in category c Input social network: Circle c ˆ ( c ) ( c ) ( c ) ( c ) T ui, = m + u i R r Q P ( c) ( c) ( c) ( c) ( c)* L ( R, Q, P, S ) = 1 ( R Rˆ ) 2 ( ui, ) obs. ( c) ( c) 2 ui, ui, β + ( Q S Q )( Q S Q ) 2 λ ( c) 2 ( c) 2 + ( P F + Q F) 2 ( c) ( c)* ( c) ( c) ( c)* ( c) T u u, v v u u, v v all u v v Solved by gradient descent Ø β is social information weight ( c) ( c) 0 ( c) 0 Ø P, Q ( c) Ø i is the number of 0 items in category c i d u d 21

Model Training q Training with ratings for all categories Predict user s rating in category c Input rating: rating from all categories Input social network: Circle c ( c) ( c) ( c) ( c)* L ( R, Q, P, S ) = 1 ( R ˆ ui, Rui, ) 2 P ( ui, ) obs., Q ( c) i d ( c) u d 2 β + ( Q S Q )( Q S Q ) 2 λ ( c) 2 ( c) 2 + ( P F + Q F) 2 ( c) ( c)* ( c) ( c) ( c)* ( c) T u u, v v u u, v v all u v v 0 0 22

Outline q Background & Motivation q Circle-based RS Trust Circle Inference Trust Value Assignment Model Training q Evaluation q Conclusion & Future work 23

24 Epinions Data

Performance Metrics RMSE = MAE = ( ui, ) R ( ui, ) R test test ( R Rˆ ) R test ui, ui, R Rˆ R test ui, ui, 2 25

26 Training with per-category ratings

Training with per-category ratings ( c) ( c) ( c) ( c) ( c)* L ( R, Q, P, S ) = 1 ( c) ˆ ( c) 2 λ ( c) 2 ( c) 2 ( Rui, Rui, ) + ( P F + Q F) 2 2 ( u, i) obs. β + ( Q S Q )( Q S Q ) 2 ( c) ( c)* ( c) ( c) ( c)* ( c) T u u, v v u u, v v all u v v 27

Training with ratings from all categories 28 CircleCon3 of training with per-category rating

Conclusions q Propose a novel Circle-based Social Recommendation framework Split original social network to different circles, one circle corresponding to one item category User trusts different subsets of friends in different domains(cars, Music ) User trusts different friends differently, based on friend s expertise q Outperforms the state-of-the-art social collaborative filtering algorithms q Show the promising future of circle-construction techniques in Social Recommender 29

Thanks! Q & A 30

Trust Value Assignment q CircleCon1: Equal Trust 31

CircleCon2: Expertise-based Trust q Variant a: Expertise based on number of rating in a circle 32

CircleCon2: Expertise-based Trust q Variant b: Expertise value based on user s number of rating in circle and voting value from followers in this circle E = N φ ( c) ( c) ( c) v v v Dw records the proportions of ratings user w assigned in all categories. It reflects the interest distribution of w cross all categories 33

34 Training with ratings from all categories

35 Training with ratings from all categories