Which Recommender System Can Best Fit Social Learning Platforms?

Slides:



Advertisements
Similar presentations
Towards Data Mining Without Information on Knowledge Structure
Advertisements

TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Collaborative Tagging in Recommender Systems AE-TTIE JI1, CHEOL YEON1, HEUNG-NAM KIM1, AND GEUN-SIK JO2 1 Intelligent E-Commerce Systems Laboratory,
Slide 1 Insert your own content. Slide 2 Insert your own content.
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 5 Author: Julia Richards and R. Scott Hawley.
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 4 Author: Julia Richards and R. Scott Hawley.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
…to Ontology Repositories Mathieu dAquin Knowledge Media Institute, The Open University From…
Mirror Mirror on the wall does your repository reflect it all? Peter West and Timothy Miles-Board EPrints Services University of Southampton Southampton,
Doc.: IEEE /0165r1 SubmissionPäivi Ruuska, NokiaSlide 1 Implementation aspects of a coexistence system Notice: This document has been.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
Coordinate Plane Practice The following presentation provides practice in two skillsThe following presentation provides practice in two skills –Graphing.
0 - 0.
ALGEBRAIC EXPRESSIONS
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
Recommender Systems & Collaborative Filtering
Fawaz Ghali Web 2.0 for the Adaptive Web.
ZMQS ZMQS
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
ABC Technology Project
O X Click on Number next to person for a question.
© S Haughton more than 3?
How to enhance teacher initiated innovation Janneke Hooijer (RdMC – OUNL) Anna Gerritsma (NHL)
1 Challenge the future Second-hand Stuff Amsterdam 2 Project.
VOORBLAD.
1 Dissemination to Policy and Decision Makers and a Wider Audience Peter J. Bates pjb Associates
1 Directed Depth First Search Adjacency Lists A: F G B: A H C: A D D: C F E: C D G F: E: G: : H: B: I: H: F A B C G D E H I.
University of Minnesota Location-based & Preference-Aware Recommendation Using Sparse Geo-Social Networking Data Location-based & Preference-Aware Recommendation.
Twenty Questions Subject: Twenty Questions
Distributed search for complex heterogeneous media Werner Bailer, José-Manuel López-Cobo, Guillermo Álvaro, Georg Thallinger Search Computing Workshop.
Linking Verb? Action Verb or. Question 1 Define the term: action verb.
Squares and Square Root WALK. Solve each problem REVIEW:
RecMax – Can we combine the power of Social Networks and Recommender Systems? Amit Goyal and L. RecMax: Exploting Recommender Systems for Fun and Profit.
1 Weiren Yu 1,2, Xuemin Lin 1, Wenjie Zhang 1 1 University of New South Wales 2 NICTA, Australia Towards Efficient SimRank Computation over Large Networks.
Universität Kaiserslautern Institut für Technologie und Arbeit / Institute of Technology and Work 1 Q16) Willingness to participate in a follow-up case.
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
This, that, these, those Number your paper from 1-10.
Chapter 5 Test Review Sections 5-1 through 5-4.
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
1 First EMRAS II Technical Meeting IAEA Headquarters, Vienna, 19–23 January 2009.
Addition 1’s to 20.
25 seconds left…...
Test B, 100 Subtraction Facts
11 = This is the fact family. You say: 8+3=11 and 3+8=11
Music Recommendation by Unified Hypergraph: Music Recommendation by Unified Hypergraph: Combining Social Media Information and Music Content Jiajun Bu,
Week 1.
We will resume in: 25 Minutes.
1 Unit 1 Kinematics Chapter 1 Day
O X Click on Number next to person for a question.
Learning to Recommend Questions Based on User Ratings Ke Sun, Yunbo Cao, Xinying Song, Young-In Song, Xiaolong Wang and Chin-Yew Lin. In Proceeding of.
Prediction Modeling for Personalization & Recommender Systems Bamshad Mobasher DePaul University Bamshad Mobasher DePaul University.
Amit Goyal Laks V. S. Lakshmanan RecMax: Exploiting Recommender Systems for Fun and Profit University of British Columbia
COLLABORATIVE FILTERING Mustafa Cavdar Neslihan Bulut.
Chengjie Sun,Lei Lin, Yuan Chen, Bingquan Liu Harbin Institute of Technology School of Computer Science and Technology 1 19/11/ :09 PM.
Developing Trust Networks based on User Tagging Information for Recommendation Making Touhid Bhuiyan et al. WISE May 2012 SNU IDB Lab. Hyunwoo Kim.
FISM: Factored Item Similarity Models for Top-N Recommender Systems
Recommender Systems & Collaborative Filtering
Postdoc, School of Information, University of Arizona
Presentation transcript:

Which Recommender System Can Best Fit Social Learning Platforms? Soude Fazeli, PhD candidate, OUNL Babak Loni, TU Delft Dr. Hendrik Drachsler, OUNL Prof. dr. Peter Sloep, OUNL

Which Recommender System Can Best Fit Social Learning Platforms? Open Discovery Space (ODS) A socially-powered, multilingual open learning infrastructure in Europe Recommendations! Which recommender approach best fits ODS platform? 2

Recommender algorithms 1. Content-based 2. Collaborative filtering ✓

Similarity Sparsity!

Learning domain has its own data, limitations, and expectations Too sparse data Too few 5-star ratings Often no proper tags and annotations Can not use only popular reference datasets like MovieLens, Netflix, etc. Dataset Users Learning objects Transactions Sparsity (%) MACE 105 5,696 23,032 99.71 OpenScout 331 1,568 2,560 99.51 MovieLens 100k 941 1,512 96,719 93.69

RQ: How to generate more accurate and thus more relevant recommendations for the users in social learning platforms by employing graph-based methods?

A graph-based recommender system Implicit networks: a graph Nodes: users Edges: similarity relationships Weights: similarity values Improve the process of finding nearest neighbors Social Index (S-index) for each user H-index: the impact of publications of an author

Creating the graph

Indegree (ua) = 7 Indegree (ub) = 5 S-index (ua ) = 2 S-index (ub ) = 4 Onderwerp via >Beeld >Koptekst en voettekst

Collecting recommendations

Experimental study 1. The method ----- Meeting Notes (19/09/14 09:50) ----- Baysian Personalized Ranking MF Sparse Linear Method: aggregating positive user feedback on items Most Popular : general popularity of items

Experimental study 2. Data The datasets contain social data of users such as ratings, tags, reviews, etc. on learning resources. So, their structure, content and target users are quite similar to the ODS dataset. Running recommender algorithms on these datasets enables us to conduct an offline experiment for studying the recommender algorithms before going online with the actual users of the ODS. Both MACE and OpenScout datasets comply with the CAM (Context Automated Metadata) format. CAM is also applied in the ODS project for storing the social data. Dataset Users Learning objects Transactions Sparsity (%) MACE 105 5,696 23,032 99.71 OpenScout 331 1,568 2,560 99.51 MovieLens 941 1,512 96,719 93.69

Experimental study 3. Results 3.1. Memory-based CFs OpenScout MACE MovieLens X-axis: Size of neighbors Y-axis: F1@10

Experimental study 3. Results 3.2. Model-based CFs

Experimental study 3. Results 3.3. Final step

Conclusion The aim is to support users of social learning platforms in finding relevant resources Graph-based recommender systems can help to deal with sparsity problem in educational domain

Ongoing and Further work The graph-based recommender already has been integrated with ODS platform Using trust relationships Explicit vs implicit trust relations (accepted paper at #RecSys2015 in Silicon Valley, US, Oct. 2014) User study (November- December 2014) to evaluate user satisfaction Novelty, serendipity, diversity: very important for learning domain

Many thanks to the FIT Fraunhofer Institute, especially Dr Many thanks to the FIT Fraunhofer Institute, especially Dr. Martin Wolpers and Katja Niemann, for providing us with both the MACE and OpenScout datasets on a short notice. Without their support, this study would not have been possible. Onderwerp via >Beeld >Koptekst en voettekst

@SoudeFazeli soude.fazeli[at]ou[dot]nl