Personalized Entity Recommendation: A Heterogeneous Information Network Approach

Similar documents
CS249: ADVANCED DATA MINING

Personalized Recommendations using Knowledge Graphs. Rose Catherine Kanjirathinkal & Prof. William Cohen Carnegie Mellon University

arxiv: v2 [cs.ir] 2 Mar 2017

Heterogeneous Graph-Based Intent Learning with Queries, Web Pages and Wikipedia Concepts

c 2014 by Xiao Yu. All rights reserved.

Mining Trusted Information in Medical Science: An Information Network Approach

User Guided Entity Similarity Search Using Meta-Path Selection in Heterogeneous Information Networks

AspEm: Embedding Learning by Aspects in Heterogeneous Information Networks

Chapter 1 Introduction

TriRank: Review-aware Explainable Recommendation by Modeling Aspects

Social Data Exploration

Leveraging Knowledge Graphs for Web-Scale Unsupervised Semantic Parsing. Interspeech 2013

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

Data Mining: Dynamic Past and Promising Future

Construction and Mining of Heterogeneous Information Networks: Will It Be a Key to Web-Aged Information Management and Mining

Collaborative Filtering using Euclidean Distance in Recommendation Engine

Performance Comparison of Algorithms for Movie Rating Estimation

Using Data Mining to Determine User-Specific Movie Ratings

Data Mining Lecture 2: Recommender Systems

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

Citation Prediction in Heterogeneous Bibliographic Networks

Recommender Systems. Techniques of AI

CS246: Mining Massive Datasets Jure Leskovec, Stanford University

Pseudo-Implicit Feedback for Alleviating Data Sparsity in Top-K Recommendation

Extending Keyword Search to Metadata in Relational Database

Mining Query-Based Subnetwork Outliers in Heterogeneous Information Networks

CS246: Mining Massive Datasets Jure Leskovec, Stanford University

Conversational Knowledge Graphs. Larry Heck Microsoft Research

Web Personalization & Recommender Systems

Recommender Systems. Collaborative Filtering & Content-Based Recommending

Thanks to Jure Leskovec, Anand Rajaraman, Jeff Ullman

A Bayesian Approach to Hybrid Image Retrieval

Query-Based Outlier Detection in Heterogeneous Information Networks

A Knowledge-Enhanced Deep Recommendation Framework Incorporating GAN-based Models

Mining of Massive Datasets Jure Leskovec, Anand Rajaraman, Jeff Ullman Stanford University Infinite data. Filtering data streams

Music Recommendation with Implicit Feedback and Side Information

CS246: Mining Massive Datasets Jure Leskovec, Stanford University

Top-N Recommendations from Implicit Feedback Leveraging Linked Open Data

A Constrained Spreading Activation Approach to Collaborative Filtering

Web Personalization & Recommender Systems

Weighted Alternating Least Squares (WALS) for Movie Recommendations) Drew Hodun SCPD. Abstract

STREAMING RANKING BASED RECOMMENDER SYSTEMS

CSE 258. Web Mining and Recommender Systems. Advanced Recommender Systems

CS 124/LINGUIST 180 From Languages to Information

Item Recommendation for Emerging Online Businesses

Bayesian Personalized Ranking for Las Vegas Restaurant Recommendation

Integrating Meta-Path Selection with User-Preference for Top-k Relevant Search in Heterogeneous Information Networks

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

Recommender Systems - Content, Collaborative, Hybrid

BBS654 Data Mining. Pinar Duygulu

MetaGraph2Vec: Complex Semantic Path Augmented Heterogeneous Network Embedding

Predicting user preference for movies using movie lens dataset

Fast Inbound Top- K Query for Random Walk with Restart

Sparse Estimation of Movie Preferences via Constrained Optimization

An Efficient Methodology for Image Rich Information Retrieval

Copyright 2011 please consult the authors

Hybrid Recommendation System Using Clustering and Collaborative Filtering

AI Dining Suggestion App. CS 297 Report Bao Pham ( ) Advisor: Dr. Chris Pollett

Document Information

c 2013 Min-Hsuan Tsai

Assignment 5: Collaborative Filtering

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

Know your neighbours: Machine Learning on Graphs

A Survey on Various Techniques of Recommendation System in Web Mining

Introduction to Data Mining

MODES v1.1 User Manual

Batch-Incremental vs. Instance-Incremental Learning in Dynamic and Evolving Data

A Proximity-Based Fallback Model for Hybrid Web Recommender Systems

Taking Advantage of Semantics in Recommendation Systems

CS 124/LINGUIST 180 From Languages to Information

Reducing the Cold-Start Problem by Explicit Information with Mathematical Set Theory in Recommendation Systems Haider Khalid 1, Shengli Wu 2

Deep Learning for Recommender Systems

How to predict IMDb score

Tutorial 3: Relational Algebra and Tuple-Relational Calculus

Chapter 8 Prototype System Based on Heterogeneous Network

WARLINGHAM MAKE A MUSIC & DVD MOVIE COLLECTION DATABASE BOOK 4 ADD A FURTHER TABLE MAKE VALIDATION RULES MAKE FORMS MAKE PARAMETER QUERIES

Searching complex graphs

COLLABORATIVE LOCATION AND ACTIVITY RECOMMENDATIONS WITH GPS HISTORY DATA

Personalized Recommendations using Knowledge Graphs: A Probabilistic Logic Programming Approach

Building a Recommendation System for EverQuest Landmark s Marketplace

A Novel Categorized Search Strategy using Distributional Clustering Neenu Joseph. M 1, Sudheep Elayidom 2

A Constrained Spreading Activation Approach to Collaborative Filtering

goccf: Graph-Theoretic One-Class Collaborative Filtering Based on Uninteresting Items

Social Network Recommendation Algorithm based on ICIP

Tutorial 3: Relational Algebra and Tuple Relational Calculus

CAN DISSIMILAR USERS CONTRIBUTE TO ACCURACY AND DIVERSITY OF PERSONALIZED RECOMMENDATION?

Knowledge Discovery and Data Mining 1 (VO) ( )

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

PNP: Fast Path Ensemble Method for Movie Design

CSE 158 Lecture 8. Web Mining and Recommender Systems. Extensions of latent-factor models, (and more on the Netflix prize)

BPR: Bayesian Personalized Ranking from Implicit Feedback

Comparative Analysis of Collaborative Filtering Technique

Predicting Popular Xbox games based on Search Queries of Users

Recommendation Systems

Relational Retrieval Using a Combination of Path-Constrained Random Walks

Domain-specific user preference prediction based on multiple user activities

Learning Semantic Entity Representations with Knowledge Graph and Deep Neural Networks and its Application to Named Entity Disambiguation

Yelp Recommendation System

GENETIC ALGORITHM BASED COLLABORATIVE FILTERING MODEL FOR PERSONALIZED RECOMMENDER SYSTEM

QUINT: On Query-Specific Optimal Networks

Transcription:

Personalized Entity Recommendation: A Heterogeneous Information Network Approach Xiao Yu, Xiang Ren, Yizhou Sun, Quanquan Gu, Bradley Sturt, Urvashi Khandelwal, Brandon Norick, Jiawei Han University of Illinois, at Urbana Champaign Northeastern University 02/26/2014

Booming Age of Heterogeneous Information Networks Information network with multi-typed entities and relationships Social Media E-Commerce Medical Images Medical Records Medical Database Treatment Plan Biology Healthcare Pharmacy Service Global Economy

Hybrid Collaborative Filtering with Networks Utilizing network relationship information can enhance the recommendation quality However, most of the previous studies only use single type of relationship between users or items (e.g., social network Ma,WSDM 11, trust relationship Ester, KDD 10, service membership Yuan, RecSys 11) 3

The Heterogeneous Information Network View of Recommender System Avatar Aliens Titanic Revolution -ary Road Zoe Saldana Adventure James Cameron Leonardo Dicaprio Kate Winslet Romance 4

# of ratings Relationship heterogeneity alleviates data sparsity Collaborative filtering methods suffer from data sparsity issue A small number of users and items have a large number of ratings Most users and items have a small number of ratings # of users or items Heterogeneous relationships complement each other Users and items with limited feedback can be connected to the network by different types of paths Connect new users or items (cold start) in the information network 5

Relationship heterogeneity based personalized recommendation models Different users may have different behaviors or preferences Aliens Sigourney Weaver fan James Cameron fan 80s Sci-fi fan Different users may be interested in the same movie for different reasons Two levels of personalization Data level Most recommendation methods use one model for all users and rely on personal feedback to achieve personalization Model level With different entity relationships, we can learn personalized models for different users to further distinguish their differences 6

Preference Propagation-Based Latent Features genre: drama Bob Naomi Watts King Kong Charlie Alice Titanic tag: Oscar Nomination Ralph Fiennes Kate Winslet revolutionary road Sam Mendes skyfall Generate L different meta-path (path types) connecting users and items Propagate user implicit feedback along each metapath Calculate latentfeatures for users and items for each meta-path with NMF related method 7

Recommendation Models Observation 1: Different meta-paths may have different importance Global Recommendation Model ranking score features for user i and item j (1) the q-th meta-path Observation 2: Different users may require different models Personalized Recommendation Model user-cluster similarity L (2) c total soft user clusters 8

Parameter Estimation Bayesian personalized ranking (Rendle UAI 09) Objective function sigmoid function min Θ for each correctly ranked item pair i.e., u i gave feedback to e a but not e b (3) Soft cluster users with NMF + k-means For each user cluster, learn one model with Eq. (3) Generate personalized model for each user on the fly with Eq. (2) Learning Personalized Recommendation Model 9

Experiment Setup Datasets Comparison methods: Popularity: recommend the most popular items to users Co-click: conditional probabilities between items NMF: non-negative matrix factorization on user feedback Hybrid-SVM: use Rank-SVM with plain features (utilize both user feedback and information network) 10

Performance Comparison HeteRec personalized recommendation (HeteRec-p) provides the best recommendation results 11

Performance under Different Scenarios p p user HeteRec p consistently outperform other methods in different scenarios better recommendation results if users provide more feedback better recommendation for users who like less popular items 12

Contributions Propose latent representations for users and items by propagating user preferences along different meta-paths Employ Bayesian ranking optimization technique to correctly evaluate recommendation models Further improve recommendation quality by considering user differences at model level and define personalized recommendation models Two levels of personalization 13