Classical Music for Rock Fans?: Novel Recommendations for Expanding User Interests Makoto Nakatsuji, Yasuhiro Fujiwara, Akimichi Tanaka, Toshio Uchiyama,

Slides:



Advertisements
Similar presentations
Amit Goyal Laks V. S. Lakshmanan RecMax: Exploiting Recommender Systems for Fun and Profit University of British Columbia
Advertisements

Experiments on Query Expansion for Internet Yellow Page Services Using Log Mining Summarized by Dongmin Shin Presented by Dongmin Shin User Log Analysis.
COLLABORATIVE FILTERING Mustafa Cavdar Neslihan Bulut.
Active Learning and Collaborative Filtering
The Wisdom of the Few A Collaborative Filtering Approach Based on Expert Opinions from the Web Xavier Amatriain Telefonica Research Nuria Oliver Telefonica.
Mining Frequent Itemsets from Uncertain Data Presented by Chun-Kit Chui, Ben Kao, Edward Hung Department of Computer Science, The University of Hong Kong.
George Lee User Context-based Service Control Group
Item-based Collaborative Filtering Idea: a user is likely to have the same opinion for similar items [if I like Canon cameras, I might also like Canon.
Using a Trust Network To Improve Top-N Recommendation
Memory-Based Recommender Systems : A Comparative Study Aaron John Mani Srinivasan Ramani CSCI 572 PROJECT RECOMPARATOR.
Sparsity, Scalability and Distribution in Recommender Systems
Collaborative Filtering CMSC498K Survey Paper Presented by Hyoungtae Cho.
RecMax: Exploiting Recommender Systems for Fun and Profit RecMax – Recommendation Maximization Previous research in Recommender Systems mostly focused.
Combining Content-based and Collaborative Filtering Department of Computer Science and Engineering, Slovak University of Technology
Item-based Collaborative Filtering Recommendation Algorithms
Research Meeting Seungseok Kang Center for E-Business Technology Seoul National University Seoul, Korea.
Performance of Recommender Algorithms on Top-N Recommendation Tasks RecSys 2010 Intelligent Database Systems Lab. School of Computer Science & Engineering.
Liang Xiang, Quan Yuan, Shiwan Zhao, Li Chen, Xiatian Zhang, Qing Yang and Jimeng Sun Institute of Automation Chinese Academy of Sciences, IBM Research.
Distributed Networks & Systems Lab. Introduction Collaborative filtering Characteristics and challenges Memory-based CF Model-based CF Hybrid CF Recent.
Growing a Tree in the Forest: Constructing Folksonomies by Integrating Structured Metadata Anon Plangprasopchok 1, Kristina Lerman 1, Lise Getoor 2 1 USC.
Group Recommendations with Rank Aggregation and Collaborative Filtering Linas Baltrunas, Tadas Makcinskas, Francesco Ricci Free University of Bozen-Bolzano.
1 Applying Collaborative Filtering Techniques to Movie Search for Better Ranking and Browsing Seung-Taek Park and David M. Pennock (ACM SIGKDD 2007)
+ Recommending Branded Products from Social Media Jessica CHOW Yuet Tsz Yongzheng Zhang, Marco Pennacchiotti eBay Inc. eBay Inc.
UOS 1 Ontology Based Personalized Search Zhang Tao The University of Seoul.
CIKM’09 Date:2010/8/24 Advisor: Dr. Koh, Jia-Ling Speaker: Lin, Yi-Jhen 1.
A Regression Approach to Music Emotion Recognition Yi-Hsuan Yang, Yu-Ching Lin, Ya-Fan Su, and Homer H. Chen, Fellow, IEEE IEEE TRANSACTIONS ON AUDIO,
Chengjie Sun,Lei Lin, Yuan Chen, Bingquan Liu Harbin Institute of Technology School of Computer Science and Technology 1 19/11/ :09 PM.
Google News Personalization: Scalable Online Collaborative Filtering
A Graph-based Friend Recommendation System Using Genetic Algorithm
Center for E-Business Technology Seoul National University Seoul, Korea BrowseRank: letting the web users vote for page importance Yuting Liu, Bin Gao,
Online Learning for Collaborative Filtering
Developing Trust Networks based on User Tagging Information for Recommendation Making Touhid Bhuiyan et al. WISE May 2012 SNU IDB Lab. Hyunwoo Kim.
RecBench: Benchmarks for Evaluating Performance of Recommender System Architectures Justin Levandoski Michael D. Ekstrand Michael J. Ludwig Ahmed Eldawy.
Exploiting Context Analysis for Combining Multiple Entity Resolution Systems -Ramu Bandaru Zhaoqi Chen Dmitri V.kalashnikov Sharad Mehrotra.
EigenRank: A Ranking-Oriented Approach to Collaborative Filtering IDS Lab. Seminar Spring 2009 강 민 석강 민 석 May 21 st, 2009 Nathan.
Badrul M. Sarwar, George Karypis, Joseph A. Konstan, and John T. Riedl
Center for E-Business Technology Seoul National University Seoul, Korea Social Ranking: Uncovering Relevant Content Using Tag-based Recommender Systems.
Temporal Diversity in Recommender Systems Neal Lathia, Stephen Hailes, Licia Capra, and Xavier Amatriain SIGIR 2010 April 6, 2011 Hyunwoo Kim.
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.
EigenRank: A ranking oriented approach to collaborative filtering By Nathan N. Liu and Qiang Yang Presented by Zachary 1.
Improving Recommendation Lists Through Topic Diversification CaiNicolas Ziegler, Sean M. McNee,Joseph A. Konstan, Georg Lausen WWW '05 報告人 : 謝順宏 1.
Cosine Similarity Item Based Predictions 77B Recommender Systems.
Creating Subjective and Objective Sentence Classifier from Unannotated Texts Janyce Wiebe and Ellen Riloff Department of Computer Science University of.
Pearson Correlation Coefficient 77B Recommender Systems.
Network Community Behavior to Infer Human Activities.
+ User-induced Links in Collaborative Tagging Systems Ching-man Au Yeung, Nicholas Gibbins, Nigel Shadbolt CIKM’09 Speaker: Nonhlanhla Shongwe 18 January.
Pairwise Preference Regression for Cold-start Recommendation Speaker: Yuanshuai Sun
Context-Aware Query Classification Huanhuan Cao, Derek Hao Hu, Dou Shen, Daxin Jiang, Jian-Tao Sun, Enhong Chen, Qiang Yang Microsoft Research Asia SIGIR.
Page 1 A Random Walk Method for Alleviating the Sparsity Problem in Collaborative Filtering Hilmi Yıldırım and Mukkai S. Krishnamoorthy Rensselaer Polytechnic.
Learning in a Pairwise Term-Term Proximity Framework for Information Retrieval Ronan Cummins, Colm O’Riordan Digital Enterprise Research Institute SIGIR.
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.
Experimental Study on Item-based P-Tree Collaborative Filtering for Netflix Prize.
Item-Based Collaborative Filtering Recommendation Algorithms Badrul Sarwar, George Karypis, Joseph Konstan, and John Riedl GroupLens Research Group/ Army.
Presented by: Siddhant Kulkarni Spring Authors: Publication:  ICDE 2015 Type:  Research Paper 2.
Reputation-aware QoS Value Prediction of Web Services Weiwei Qiu, Zhejiang University Zibin Zheng, The Chinese University of HongKong Xinyu Wang, Zhejiang.
ItemBased Collaborative Filtering Recommendation Algorithms 1.
Collaborative Filtering With Decoupled Models for Preferences and Ratings Rong Jin 1, Luo Si 1, ChengXiang Zhai 2 and Jamie Callan 1 Language Technology.
WSRec: A Collaborative Filtering Based Web Service Recommender System
Asymmetric Correlation Regularized Matrix Factorization for Web Service Recommendation Qi Xie1, Shenglin Zhao2, Zibin Zheng3, Jieming Zhu2 and Michael.
Location Recommendation — for Out-of-Town Users in Location-Based Social Network Yina Meng.
M.Sc. Project Doron Harlev Supervisor: Dr. Dana Ron
Jinhong Jung, Woojung Jin, Lee Sael, U Kang, ICDM ‘16
RECOMMENDER SYSTEMS WITH SOCIAL REGULARIZATION
Movie Recommendation System
ITEM BASED COLLABORATIVE FILTERING RECOMMENDATION ALGORITHEMS
Huifeng Sun 1, Zibin Zheng 2, Junliang Chen 1, Michael R. Lyu 2
Presentation transcript:

Classical Music for Rock Fans?: Novel Recommendations for Expanding User Interests Makoto Nakatsuji, Yasuhiro Fujiwara, Akimichi Tanaka, Toshio Uchiyama, Ko Fujimura 1, Toru Ishida 2 1 NTT Cyber Solutions Laboratories, NTT Corporation 2 Department of Social Informatics, Kyoto University CIKM Summarized and Presented by Kim Chung Rim, IDS Lab., Seoul National University

Copyright  2010 by CEBT Contents  Introduction  Goal  Concept Explanation Novelty User Interest Model User Similarity  Evaluation  Conclusion & Discussion 2

Copyright  2010 by CEBT Introduction  Recommender systems are widely used by content providers Increases chance of commercial success  Many content providers adopt methods based on collaborative filtering 3

Copyright  2010 by CEBT Weakness of basic CF method  It is apt to recommend the types of items that have been accessed by the user Rock music is more likely to be recommended when the user previously rated on rock music only.  However, users may have various interests other than items that he has rated before User often needs recommendations of other types of items 4

Copyright  2010 by CEBT Goal  The goal of this paper lies in three folds Introducing a new measure ‘novelty’ Integrate the taxonomy-based user similarity to the basic CF algorithm Identify items with higher novelty for the active user 5

Copyright  2010 by CEBT Concept - Novelty  Novel items are items that cannot be easily discovered by the user For example, a user who is interested in Rock music cannot easily discover interesting items in Classical music  Novelty is calculated using Taxonomy of items 6

Copyright  2010 by CEBT Concept – User Interest Model  Users who are interested in some items are also interested in classes that include those items  Therefore it can be said that the rating values of items in a class reflect user’s interest of that class  Authors calculate user interest of a class C by simply aggregating the interest score of all subclasses of C 7

Copyright  2010 by CEBT Concept – User Similarity  User similarity is measured using user interest model and the original CF method (user rating behavior) Where 8

Copyright  2010 by CEBT Concept – Similarity against Items  Similarity of users calculated using Pearson correlation  Can be any other similarity measures, such as Cosine Similarity Jaccard Similarity 9

Copyright  2010 by CEBT Concept – Similarity against Classes  Similarity against Classes can be measured as following: Where 10

Copyright  2010 by CEBT Methodology - Relatedness  Using Similarity measure, A user graph can be generated where nodes are users and the edge weights being  Edge weights are normalized to represent probability to move to adjacent node RWR is performed on the graph until convergence Each node holds a probability that a walk from active user a will pass through user u on the graph (relatedness) 11

Copyright  2010 by CEBT Methodology – Rating Prediction  Using relatedness scores obtained from the user graph, topN nodes with highest relatedness score are selected – Top 40 for Movie dataset, Top 30 for Music dataset Ratings of items are recalculated The relatedness score is used instead of 12

Copyright  2010 by CEBT Evaluation - Datasets  Several Datasets are used for the experiment Rating against movies – MovieLens Dataset : 212,586 ratings from 943 users on 1,682 movies Rating against non-Japanese music artists – Music Dataset from Doblog : 48,695 ratings from 3,545 users on 21,214 artists – Taxonomy provided from ListenJapan : There are 279 genres in the taxonomy Rating against Japanese music artists – Music Dataset from Doblog : 58,104 ratings from 2,800 users on 7,421 artists – Taxonomy provided from ListenJapan : There are 153 genres in the taxonomy 13

Copyright  2010 by CEBT Evaluation – Methodology  The Dataset D is randomly divided into two parts: Training dataset T Prediction dataset P  Users who have items whose classes are in P but not in T can be generated  Varying the ratio of T to D (T/D), previously explained algorithms are run to predict user rating 14

Copyright  2010 by CEBT Evaluation - Measurement  To measure how accurate the rating prediction is, MAE(Mean Absolute Error) is calculated  To measure the coverage of algorithms 15

Copyright  2010 by CEBT Evaluation – Compared similarity measure  Pearson Correlation coefficient  Cosine-based approach  Method proposed by Ziegler(WWW 05)  Taxonomy (Jaccard&Pearson)  Taxonomy (Jaccard) 16

Copyright  2010 by CEBT Results - Accuracy 17

Copyright  2010 by CEBT Results - Accuracy 18

Copyright  2010 by CEBT Results - Coverage 19

Copyright  2010 by CEBT Results - Coverage 20

Copyright  2010 by CEBT Conclusion & Discussion  This paper uses rating of item as well as the taxonomy of items to calculate the similarity between two users.  Using such similarity measure and RWR, users who are not similar to the active user but who the walk passes through frequently can be extracted.  Such users’ items are then used to identify items with high novelty to expand users’ interests 21

Copyright  2010 by CEBT Thank you 22