Cold Start Problem in Movie Recommendation JIANG CAIGAO, WANG WEIYAN Group 20.

Slides:



Advertisements
Similar presentations
Prediction Modeling for Personalization & Recommender Systems Bamshad Mobasher DePaul University Bamshad Mobasher DePaul University.
Advertisements

Basic IR: Modeling Basic IR Task: Slightly more complex:
SEARCHING QUESTION AND ANSWER ARCHIVES Dr. Jiwoon Jeon Presented by CHARANYA VENKATESH KUMAR.
1 Latent Semantic Mapping: Dimensionality Reduction via Globally Optimal Continuous Parameter Modeling Jerome R. Bellegarda.
1 RegionKNN: A Scalable Hybrid Collaborative Filtering Algorithm for Personalized Web Service Recommendation Xi Chen, Xudong Liu, Zicheng Huang, and Hailong.
GENERATING AUTOMATIC SEMANTIC ANNOTATIONS FOR RESEARCH DATASETS AYUSH SINGHAL AND JAIDEEP SRIVASTAVA CS DEPT., UNIVERSITY OF MINNESOTA, MN, USA.
Explorations in Tag Suggestion and Query Expansion Jian Wang and Brian D. Davison Lehigh University, USA SSM 2008 (Workshop on Search in Social Media)
T.Sharon - A.Frank 1 Internet Resources Discovery (IRD) Classic Information Retrieval (IR)
WebMiningResearch ASurvey Web Mining Research: A Survey Raymond Kosala and Hendrik Blockeel ACM SIGKDD, July 2000 Presented by Shan Huang, 4/24/2007.
1 CS 430 / INFO 430 Information Retrieval Lecture 8 Query Refinement: Relevance Feedback Information Filtering.
Lecture 14: Collaborative Filtering Based on Breese, J., Heckerman, D., and Kadie, C. (1998). Empirical analysis of predictive algorithms for collaborative.
Prénom Nom Document Analysis: Data Analysis and Clustering Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
Web Mining Research: A Survey
WebMiningResearch ASurvey Web Mining Research: A Survey By Raymond Kosala & Hendrik Blockeel, Katholieke Universitat Leuven, July 2000 Presented 4/18/2002.
Web Mining Research: A Survey
WebMiningResearchASurvey Web Mining Research: A Survey Raymond Kosala and Hendrik Blockeel ACM SIGKDD, July 2000 Presented by Shan Huang, 4/24/2007 Revised.
Collaborative Ordinal Regression Shipeng Yu Joint work with Kai Yu, Volker Tresp and Hans-Peter Kriegel University of Munich, Germany Siemens Corporate.
Recommender Systems; Social Information Filtering.
Ranking by Odds Ratio A Probability Model Approach let be a Boolean random variable: document d is relevant to query q otherwise Consider document d as.
Distributed Representations of Sentences and Documents
Longbiao Kang, Baotian Hu, Xiangping Wu, Qingcai Chen, and Yan He Intelligent Computing Research Center, School of Computer Science and Technology, Harbin.
CS344: Introduction to Artificial Intelligence Vishal Vachhani M.Tech, CSE Lecture 34-35: CLIR and Ranking in IR.
«Tag-based Social Interest Discovery» Proceedings of the 17th International World Wide Web Conference (WWW2008) Xin Li, Lei Guo, Yihong Zhao Yahoo! Inc.,
Cao et al. ICML 2010 Presented by Danushka Bollegala.
Personalization in Local Search Personalization of Content Ranking in the Context of Local Search Philip O’Brien, Xiao Luo, Tony Abou-Assaleh, Weizheng.
Processing of large document collections Part 2 (Text categorization) Helena Ahonen-Myka Spring 2006.
WEMAREC: Accurate and Scalable Recommendation through Weighted and Ensemble Matrix Approximation Chao Chen ⨳ , Dongsheng Li
Chapter 7 Web Content Mining Xxxxxx. Introduction Web-content mining techniques are used to discover useful information from content on the web – textual.
ArrayCluster: an analytic tool for clustering, data visualization and module finder on gene expression profiles 組員:李祥豪 謝紹陽 江建霖.
Dr. Susan Gauch When is a rock not a rock? Conceptual Approaches to Personalized Search and Recommendations Nov. 8, 2011 TResNet.
EMIS 8381 – Spring Netflix and Your Next Movie Night Nonlinear Programming Ron Andrews EMIS 8381.
WebMining Web Mining By- Pawan Singh Piyush Arora Pooja Mansharamani Pramod Singh Praveen Kumar 1.
Chengjie Sun,Lei Lin, Yuan Chen, Bingquan Liu Harbin Institute of Technology School of Computer Science and Technology 1 19/11/ :09 PM.
Presented By :Ayesha Khan. Content Introduction Everyday Examples of Collaborative Filtering Traditional Collaborative Filtering Socially Collaborative.
Constructing Knowledge Graph from Unstructured Text Image Source: Kundan Kumar Siddhant Manocha.
Badrul M. Sarwar, George Karypis, Joseph A. Konstan, and John T. Riedl
Personalized Interaction With Semantic Information Portals Eric Schwarzkopf DFKI
1 Collaborative Filtering & Content-Based Recommending CS 290N. T. Yang Slides based on R. Mooney at UT Austin.
EigenRank: A ranking oriented approach to collaborative filtering By Nathan N. Liu and Qiang Yang Presented by Zachary 1.
Similarity & Recommendation Arjen P. de Vries CWI Scientific Meeting September 27th 2013.
KNN CF: A Temporal Social Network kNN CF: A Temporal Social Network Neal Lathia, Stephen Hailes, Licia Capra University College London RecSys ’ 08 Advisor:
Using Game Reviews to Recommend Games Michael Meidl, Steven Lytinen DePaul University School of Computing, Chicago IL Kevin Raison Chatsubo Labs, Seattle.
Divided Pretreatment to Targets and Intentions for Query Recommendation Reporter: Yangyang Kang /23.
Virtual Examples for Text Classification with Support Vector Machines Manabu Sassano Proceedings of the 2003 Conference on Emprical Methods in Natural.
Collaborative Filtering via Euclidean Embedding M. Khoshneshin and W. Street Proc. of ACM RecSys, pp , 2010.
Personalization Services in CADAL Zhang yin Zhuang Yuting Wu Jiangqin College of Computer Science, Zhejiang University November 19,2006.
Artificial Intelligence Techniques Internet Applications 4.
A PAC-Bayesian Approach to Formulation of Clustering Objectives Yevgeny Seldin Joint work with Naftali Tishby.
Optimization Indiana University July Geoffrey Fox
1 CS 430 / INFO 430 Information Retrieval Lecture 12 Query Refinement and Relevance Feedback.
Vector Semantics Dense Vectors.
Short Text Similarity with Word Embedding Date: 2016/03/28 Author: Tom Kenter, Maarten de Rijke Source: CIKM’15 Advisor: Jia-Ling Koh Speaker: Chih-Hsuan.
Collaborative Deep Learning for Recommender Systems
Recommendation Systems ARGEDOR. Introduction Sample Data Tools Cases.
Chapter 14 – Association Rules and Collaborative Filtering © Galit Shmueli and Peter Bruce 2016 Data Mining for Business Analytics (3rd ed.) Shmueli, Bruce.
GUILLOU Frederic. Outline Introduction Motivations The basic recommendation system First phase : semantic similarities Second phase : communities Application.
1 Dongheng Sun 04/26/2011 Learning with Matrix Factorizations By Nathan Srebro.
Recommender Systems 11/04/2017
Multimodal Learning with Deep Boltzmann Machines
Probabilistic Data Management
Distributed Representation of Words, Sentences and Paragraphs
Topic Oriented Semi-supervised Document Clustering
Word Embedding Word2Vec.
Movie Recommendation System
Recommender Systems Copyright: Dietmar Jannah, Markus Zanker and Gerhard Friedrich (slides based on their IJCAI talk „Tutorial: Recommender Systems”)
Date: 2012/11/15 Author: Jin Young Kim, Kevyn Collins-Thompson,
Word embeddings (continued)
Recommendation Systems
Web Mining Research: A Survey
Recommender Systems Problem formulation Machine Learning.
Presentation transcript:

Cold Start Problem in Movie Recommendation JIANG CAIGAO, WANG WEIYAN Group 20

Outline 1.Introduction 2.Problem Statement 3.Transfer Learning based 4.Semantic Extracting based 5.Experiments

Introduction: Problem Collaborative filtering: A Classical Recommending Solution 1)Look for users who share the same rating patterns with the user who needs recommendation. 2) Use the ratings from those like-minded users to predict active user’s rating for unrated items. Cold Start Problem: lack sufficient information to recommend New users take long time to rate sufficient movie to predict their preference Browsers even don’t have any direct preference information

Introduction: Solutions With Clicking data: Recommend basing on Transfer Learning Extract knowledge from one or more source tasks and apply to the target task With Semantic Data: Recommend Basing on Semantics Extracting Extract movie’s semantic information from its tags Respond to users’ actions e.g. visiting a movie’s page or fuzzy query

Introduction

Problem Statement

Methods

Learning Process: Use Jensen’s inequality to derive a lower bound on log-likelihood Where H is the entropy, and:

Methods

Learning Process: Variational expectation-maximization(VEM) 1.VE-Step Fix model parameters and optimize the bound w.r.t the variational parameters to make the bound as tight as possible. 2.VM-Step Fix variational parameters and optimize the equation w.r.t the model parameters to raise the bound.

Experiment Data Sets: There are in total of four datasets used in our experiments, namely, Netflix, Movielens, Book-Corssing and Each-Movie. Netflix: The Netflix dataset contains about 10^8 rating values in the range{1,2,3,4,5}, given by about 7x10^4 users on around 1.7x10^4 movies Movielens : The movielens contains about 10^7 rating value, rated by 7x10^4 users on around 10^4 movies. EachMovie: EachMovie contains approximately 2.8x10^6 ratings given by 7.2x10^4 users on 1628 movies

Experiment

Experiment Setting: 2. Learning EachMovie with MovieLens: All the preprocessing steps are the same as before, but the dimensions is 1000x800.

Experiment Results:

Experiment Results:

Semantics Extracting Solution Goal: To deal with situation knowing nothing about the user Motivation: Most movies are tagged with short phases and words by users. E.g. Extract the semantics from tags to describe the movie’s content for recommendation responding to users’ browsing and fuzzy query.

Semantics Extracting: Related Work Tags, as brief and informative data, has been used for recommending and prediction: (1) As a kind of binary variable only.[1][2] (2)Otherwise user manually provide relevance value between tag and item.[3] Tags are regarded as features instead of language words, and the semantics are ignored. [1] GUAN, Z.etc. Document recommendation in social tagging services. (WWW’10). ACM. [2] TSO-SUTTER, etc. Tag-aware recommender systems by fusion of collaborative filtering algorithms. ACM Symposium on Applied Computing (SAC’08) [3] Vig, Jesse, etc. "The tag genome: Encoding community knowledge to support novel interaction." ACM Transactions on Interactive Intelligent Systems (2012)

Semantics Extracting : Word Embedding NLP Perspective: Treat tags as brief and informative description of the movie and extract the semantics by generating word embedding[4]. VectorTag Neutral Network Lookup table containing the vector Hierarchical SoftMax (Huffman Tree) Sample: Shorten the similar words’ distance Unsample: enlarge the dissimilar words’ distance [4]Mikolov, etc. Distributed Representations of Words and Phrases and their Compositionality

Semantics Extracting : Word Embedding Modified for tags semantics extracting: Generate vectors in 100 dimensions representing tags, in which similar and related tags’ vector have large cosine distance (inner production) Original Word2vecModified Tag2vecReason ContextFixed context window size: 5~10 All tags of the movie regardless of the length All tags are related regardless of the order and appearing position Unsampl e 5~10 times randomly unsamples >=1000 randomly unsamplesTo effectively enlarge the distances DatasetLarge corpus: Wikipedia Tags of each movie + movie name + category To extract the special semantics in tags: e.g. name, special phrase

Semantics Extracting : Movie & Query Embedding for Recommending

Semantics Extracting: Experiment Data Set: Full MovieLens (Last updated 8/2015) Tag Vector: Funny: inspiring: moving: ItemNum Movies~30,000 Users230,000 Tags510,000 Vocabulary Size11363 Training Words100949

Semantics Extracting: Experiment Recommend similar movies with what is being visited: Matrix The Lord of the Rings I, Robot Pride and Prejudice(2005)

Semantics Extracting: Experiment Recommend responding to single word fuzzy query: bond China kid funny

Semantics Extracting: Experiment Recommend responding to multi-words fuzzy query : french funny kid action Magic book war documentary

THANKS