Innovation Team of Recommender System(ITRS) Collaborative Competitive Filtering : Learning Recommender Using Context of User Choice Keynote: Zhi-qiang.

Slides:



Advertisements
Similar presentations
Collaborative QoS Prediction in Cloud Computing Department of Computer Science & Engineering The Chinese University of Hong Kong Hong Kong, China Rocky.
Advertisements

COLLABORATIVE FILTERING Mustafa Cavdar Neslihan Bulut.
Sean Blong Presents: 1. What are they…?  “[…] specific type of information filtering (IF) technique that attempts to present information items (movies,
CUSTOMER NEEDS ELICITATION FOR PRODUCT CUSTOMIZATION Yue Wang Advisor: Prof. Tseng Advanced Manufacturing Institute Hong Kong University of Science and.
The Wisdom of the Few A Collaborative Filtering Approach Based on Expert Opinions from the Web Xavier Amatriain Telefonica Research Nuria Oliver Telefonica.
Intro to RecSys and CCF Brian Ackerman 1. Roadmap Introduction to Recommender Systems & Collaborative Filtering Collaborative Competitive Filtering 2.
Planning under Uncertainty
2. Introduction Multiple Multiplicative Factor Model For Collaborative Filtering Benjamin Marlin University of Toronto. Department of Computer Science.
1 Statistical Inference H Plan: –Discuss statistical methods in simulations –Define concepts and terminology –Traditional approaches: u Hypothesis testing.
Rubi’s Motivation for CF  Find a PhD problem  Find “real life” PhD problem  Find an interesting PhD problem  Make Money!
1 Graphical Models in Data Assimilation Problems Alexander Ihler UC Irvine Collaborators: Sergey Kirshner Andrew Robertson Padhraic Smyth.
Probability based Recommendation System Course : ECE541 Chetan Tonde Vrajesh Vyas Ashwin Revo Under the guidance of Prof. R. D. Yates.
Customizable Bayesian Collaborative Filtering Denver Dash Big Data Reading Group 11/19/2007.
25 Sept 07 FF8 - Discrete Choice Data Introduction Tony O’Hagan.
A User Experience-based Cloud Service Redeployment Mechanism KANG Yu.
Performance of Recommender Algorithms on Top-N Recommendation Tasks
Like like alike Joint friendship and interest propagation in social networks Shuang Hong Yang, Bo Long, Alex Smola Nara Sadagopan, Zhaohui Zheng, Hongyan.
MAKING COMPLEX DEClSlONS
Computational Stochastic Optimization: Bridging communities October 25, 2012 Warren Powell CASTLE Laboratory Princeton University
Performance of Recommender Algorithms on Top-N Recommendation Tasks RecSys 2010 Intelligent Database Systems Lab. School of Computer Science & Engineering.
1 Information Filtering & Recommender Systems (Lecture for CS410 Text Info Systems) ChengXiang Zhai Department of Computer Science University of Illinois,
Mining Optimal Decision Trees from Itemset Lattices Dr, Siegfried Nijssen Dr. Elisa Fromont KDD 2007.
By Rachsuda Jiamthapthaksin 10/09/ Edited by Christoph F. Eick.
Compiled by: Gul Sayyar, ACCA-UK
Yan Yan, Mingkui Tan, Ivor W. Tsang, Yi Yang,
Wancai Zhang, Hailong Sun, Xudong Liu, Xiaohui Guo.
Training and Testing of Recommender Systems on Data Missing Not at Random Harald Steck at KDD, July 2010 Bell Labs, Murray Hill.
EMIS 8381 – Spring Netflix and Your Next Movie Night Nonlinear Programming Ron Andrews EMIS 8381.
Chengjie Sun,Lei Lin, Yuan Chen, Bingquan Liu Harbin Institute of Technology School of Computer Science and Technology 1 19/11/ :09 PM.
Wang-Chien Lee i Pervasive Data Access ( i PDA) Group Pennsylvania State University Mining Social Network Big Data Intelligent.
Making Simple Decisions
Yang Cai Oct 08, An overview of today’s class Basic LP Formulation for Multiple Bidders Succinct LP: Reduced Form of an Auction The Structure of.
CS584 - Software Multiagent Systems Lecture 12 Distributed constraint optimization II: Incomplete algorithms and recent theoretical results.
Statistics and the Verification Validation & Testing of Adaptive Systems Roman D. Fresnedo M&CT, Phantom Works The Boeing Company.
Ensemble Learning Spring 2009 Ben-Gurion University of the Negev.
1 Components of the Deterministic Portion of the Utility “Deterministic -- Observable -- Systematic” portion of the utility!  Mathematical function of.
Evaluation of Recommender Systems Joonseok Lee Georgia Institute of Technology 2011/04/12 1.
EigenRank: A ranking oriented approach to collaborative filtering By Nathan N. Liu and Qiang Yang Presented by Zachary 1.
Recommender Systems Debapriyo Majumdar Information Retrieval – Spring 2015 Indian Statistical Institute Kolkata Credits to Bing Liu (UIC) and Angshul Majumdar.
Meeghat Habibian Analysis of Travel Choice Transportation Demand Analysis Lecture note.
Pairwise Preference Regression for Cold-start Recommendation Speaker: Yuanshuai Sun
ICDCS 2014 Madrid, Spain 30 June-3 July 2014
Systems Realization Laboratory The Role and Limitations of Modeling and Simulation in Systems Design Jason Aughenbaugh & Chris Paredis The Systems Realization.
11 Ahti Salo, Juuso Liesiö and Eeva Vilkkumaa Department of Mathematics and Systems Analysis Aalto University School of Science and Technology P.O. Box.
Collaborative Filtering via Euclidean Embedding M. Khoshneshin and W. Street Proc. of ACM RecSys, pp , 2010.
Optimization formulation Optimization methods help us find solutions to problems where we seek to find the best of something. This lecture is about how.
A Brief Maximum Entropy Tutorial Presenter: Davidson Date: 2009/02/04 Original Author: Adam Berger, 1996/07/05
Collaborative Competitive Filtering: Learning recommender using context of user choices Shuang Hong Yang Bo Long, Alex Smola, Hongyuan Zha Zhaohui Zheng.
Online Evolutionary Collaborative Filtering RECSYS 2010 Intelligent Database Systems Lab. School of Computer Science & Engineering Seoul National University.
Matrix Factorization & Singular Value Decomposition Bamshad Mobasher DePaul University Bamshad Mobasher DePaul University.
Collaborative Deep Learning for Recommender Systems
Collaborative Filtering - Pooja Hegde. The Problem : OVERLOAD Too much stuff!!!! Too many books! Too many journals! Too many movies! Too much content!
Ranking: Compare, Don’t Score Ammar Ammar, Devavrat Shah (LIDS – MIT) Poster ( No preprint), WIDS 2011.
StressSense: Detecting Stress in Unconstrained Acoustic Environments using Smartphones Hong Lu, Mashfiqui Rabbi, Gokul T. Chittaranjan, Denise Frauendorfer,
Matrix Factorization and Collaborative Filtering
Mining Utility Functions based on user ratings
Data Transformation: Normalization
Contextual Intelligence as a Driver of Services Innovation
Learning Recommender Systems with Adaptive Regularization
WSRec: A Collaborative Filtering Based Web Service Recommender System
M.Sc. in Economics Econometrics Module I
Multimodal Learning with Deep Boltzmann Machines
Adopted from Bin UIC Recommender Systems Adopted from Bin UIC.
Collaborative Filtering Nearest Neighbor Approach
Exploiting Graphical Structure in Decision-Making
Q4 : How does Netflix recommend movies?
CS 416 Artificial Intelligence
Recommendation Systems
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 7
Dr. Arslan Ornek MATHEMATICAL MODELS
Presentation transcript:

Innovation Team of Recommender System(ITRS) Collaborative Competitive Filtering : Learning Recommender Using Context of User Choice Keynote: Zhi-qiang You Alibaba Research Center For Complexity Sciences SIGIR.11(citation 60) author : Shuang Hong Yang (Georgia Tech)

Overview Innovation Team of Recommender System(ITRS) 1 Overview 背景介绍问题描述模型及学习数据集及结果表现

Innovation Team of Recommender System(ITRS) 2 背景描述 Collaborative Filtering 推荐算法存在的问题 1.Only the binary events of user actions, but totally disregard the context 2.Data sparseness lead to overfitting 3.The interaction process between users and the recommender systems not fully-exploited

Innovation Team of Recommender System(ITRS) 3 Context User actions (u, i*) are action dyads, while the dyads {(u, i)} for all i O, and are contextual dyads Set of users, U Set of items, I Each user interaction has an offer set O and a decision set D Each user interaction is stored as a tuple (u, O, D) where D is a subset of O Notation: Traditional method: trade these contextual as,missing data Now: This context is informative which should be exploited

Innovation Team of Recommender System(ITRS) 4 Context example User U1 prefer Die Hard ( 虎胆龙威, 主演 Bruce Willis) given a generic set of movies only tells us that the user appreciates action movies. While, a preference for Die Hard over Terminator( 终结者, 主演阿诺德 · 施瓦辛格 ) or Rocky( 洛奇 ,主演史泰龙 ) suggests that the user might favor Bruce willis over other action heros. In other words, the context of user choice is vital when estimating user preferences.

Innovation Team of Recommender System(ITRS) 5 Maechanism underlying user choice behaviors Collaborative filtering: “collaboration effects” that similar items get similar responses from similar users The effect of Collaboration Another mechanism governs users’ behavior? The effect of competition Items turn to compete with each other for the attention of users, user u will pick the best item i* (the one with highest utility) when confronted by the set of alternatives O A man with penchant for action movies by Arnold Schwarzenegger. Given the choice between Sleepless in Seattle and Die Hard,he will likely choose the latter. And afforded the choice between the oeuvres of Schwarzenegger, Diesel or willis, he more likely to choose Schwarzenegger. So local competition effect essential for recommender model

Innovation Team of Recommender System(ITRS) 6 Problem formulation Set of users, U Set of items, I Each user interaction has an offer set O and a decision set D, D={i*}, D is not empty and contains exactly one item i*, i.e. i* as a decision. Each user interaction is stored as a tuple (u, O, D) where D is a subset of O Collaborative filtering Given observations of dyadic responses {(u, i, y ui )} with each y ui being an observed response( e.g. user’s rating to an item, or indication of whether user u took an action on item i) Collaborative filtering explores the notion of “collaboration effect”, i.e. similar users have similar preferences to similar items.

Innovation Team of Recommender System(ITRS) 7 Collaborative filtering 1. Neighborhood models Based on propagating the observations of responses among items or users that are considered as neighbors. The model first defines a similarity measure between items / users. Then, unseen response between user u and item I is approximated based on the response of neighboring users or items. 2.Latent factor models Learn predictive latent factors to estimate the missing dyadic responses. The basic idea is to associate latent factors, for each user u and for each item i.

Innovation Team of Recommender System(ITRS) 8 Latent factor models

Innovation Team of Recommender System(ITRS) 9 Overfitting CF usually performs poorly on binary response. For the aforementioned interaction process, the response y ui is typically a binary event indicating whether or not item i was accepted by the user u. with the non-action dyads being ignored, the responses are exclusively positive observations. We will obtain an overly-optimistic estimator that biases toward positive responses and predicts positive for almost all incoming dyads.

Innovation Team of Recommender System(ITRS) 10 Collaborative competitive filtering CCF for learning recommender models by modeling users’ choice behavior in their interactions with the recommender system. Employ a multiplicative latent factor model to characterize the dyadic utility function. CCF encodes the collaboration effect and completion effect. In practice, a user u could make different decisions when facing different contexts O t Local Optimality of User Choice Each item has a potential revenue to the user which is r ui Users also consider the opportunity cost (OC) when deciding potential revenue OC is what the user gives up for making a given decision OC is c ui = max( i’ | i’ in O \ i) Profit is π ui = r ui – c ui A user interaction is an opportunity give and take process User is given a set of opportunities User makes a decision to select one of the many opportunities Each opportunity comes with some revenue (utility or relevance)

Innovation Team of Recommender System(ITRS) 11 Collaborative competitive filtering Local optimality constraint Each item in the decision set has a revenue higher than those not in the decision set Problem becomes intractable with only this constraint, no unique solution

Innovation Team of Recommender System(ITRS) 12 Surrogate objectives Softmax model Assume the utility function consists of two components is a deterministic function characterizing the intrinsic interest of user u to item i. for which use the latent factor model to quantify is a stochastic error term reflecting the uncertainty and complexness of the choice process. Assume the error term is an independently and identically distributed Weibull variable.

Innovation Team of Recommender System(ITRS) 13 Softmax model

Innovation Team of Recommender System(ITRS) 14 Hinge model

Innovation Team of Recommender System(ITRS) 15 Learning algorithm

Innovation Team of Recommender System(ITRS) 16 Extensions

Innovation Team of Recommender System(ITRS) 17 DataSets Dyadic response data 1.Social network data. 2.Netflix 5 star data

Innovation Team of Recommender System(ITRS) 18 Evaluation

Innovation Team of Recommender System(ITRS) 19 最近的想法 1.CCF in BPR 2.APRIORI to more accurate Neighbors or niche Items 3.Matrix Factorazation with Random Forests

Innovation Team of Recommender System(ITRS) Alibaba Research Center For Complexity Sciences