SlideShare ist ein Scribd-Unternehmen logo
1 von 37
Downloaden Sie, um offline zu lesen
improving explicit preference entry by
visualising data similarities
kris jack and florence duclaye



13 january 2008
summary

1 the problem in context
2 background
3 proposed solution
4 user evaluation
5 results
6 discussion
7 conclusion

kris jack – p2
1
the problem in context




kris jack – p3
context

   general context
        recommender systems attempt to offer items to users that will be appreciated
        the quality of these recommendations is largely constrained by the data
           •   a user’s preferences
           •   domain-specific ‘general knowledge'
           •   the items that can be recommended
           •   previous users’ opinions of items
        the acquisition of such data is of central importance
   specific context
        a hybrid content-based and collaborative filtering recommendation system
        the system will be implemented in the domain of cinema
        the user can explicit enter their preferences




kris jack – p4
the problem

 entering         your preferences explicitly
        can be boring
        can be difficult


 ifa system is too much trouble to use, then it
  simply won't be used
 how can we improve the explicit preference entry
  process?
          maximise the number of explicit preferences that could be
           elicited within a given period of time



kris jack – p5
2
background




kris jack – p6
definitions

   preferences, many types and definitions exist
        concentrating on the elicitation of monadic preferences
        represent a user’s like, dislike, or indifference towards an item or item
         attribute (e.g. “i like tim burton”, “i dislike horror movies” and “i love kill
         bill”)
   preference acquisition strategies
        explicit – user explicitly enters their preferences
        implicit – learning strategies that are non-invasive (e.g. user-profiling
         and collaborative filtering)
   explicit preference entry (epe) interface
        an interface that asks users to explicitly give their preferences
         towards items and item attributes (e.g. “i love comedies”)


kris jack – p7
some existing epe interfaces

   recommenders with epe interfaces
        minekey (www.minekey.com)
        stumbleupon (www.stumbleupon.com)
        movielens
   drawbacks
        boring to use                                  minekey
        difficult to be inspired
         (when guidance is lacking)
        difficult to describe yourself
         in their terms at times




kris jack – p8                            stumbleupon
data visualisation

  perhaps we can improve epe interfaces by visualising data
  data visualisation techniques have had some success in
   recommenders
         music plasma (www.musicplasma.com)
         amaznode (amaznode.fladdict.net/)




music plasma                              amaznode
  kris jack – p9
3
proposed solution




kris jack – p10
visualising data similarity in an epe
interface
   the epe interface
        should encourage users to enter their preferences
        may guide users based upon the preferences required
        should be enjoyable to use and not boring
   the epe interface creation process
        must be robust and reliable
        desirable if it is automated from start to finish
   creation process summary
        input a list of items or item descriptors (e.g. actors)
        using a similarity metric, find the similarities between data elements
        visualise the similarities between the data elements



kris jack – p11
instantiating the system's semantic
knowledge
 the system's semantic knowledge describes the
  similarity between descriptors in the database
 the notion of similarity is necessarily subjective



       how similar do you find these two actors?
        (robert de niro and al pacino)




kris jack – p12
strategies for defining semantic
similarities
   considered
        instantiation by hand
        differencing mechanism
        co-occurrence measures
        clustering algorithms
        collaborative filtering techniques
   opted for one based on co-occurrences of actor names
    found using the google search estimates
                                              max{log f (i1),log f (i 2)} − log f ( i1, i 2)
                             d (i1, i 2 ) =
                                               log M − min{log f (i1),log f (i 2)}


             where m is the total number of pages considered, f(i1) and f(i2) are the number of hits
             for i1 and i2 respectively, and f(i1,i2) is the number of hits for the co-occurrence of i1 and
             i2.
        in essence, the more often two items appear together on the same web pages,
         the more similar they are
        the measure of semantic relatedness server provides free access

kris jack – p13
normalised google distance

   actors         jackie chan bruce lee          jane fonda

   jackie         2,420,000      965,000         145,000
   chan           (0.0)          (0.09)          (0.26)
   bruce          965,000        2,630,000       46,700
   lee            (0.09)         (0.0)           (0.37)
   jane           145,000        46,700          1,930,000
   fonda          (0.26)         (0.37)          (0.0)
        the number of google hits for actor pairs and their
       normalized google distances given in brackets (the
         smaller the distance, the more similar the actors)

kris jack – p14
data visualisation

   use of the radial tree layout to visualise data similarities
        manageable linear complexity in laying out the tree
           • efficient even with several hundreds of nodes
        the more similar two items are, the closer their proximity in the graph
        a radial layout encourages users to explore the tree in a less hierarchical
         fashion as it is unclear where the root node is
        tree can be focussed upon any node in the tree (implementing a smooth
         transition animation)
           • users have previously found this form of visualisation attractive
        implementation available in prefuse (www.prefuse.com) library
   strategy
        each item (actor) is represented by a node in the tree
        connect every node with their two closest nodes (using item similarity)




kris jack – p15
radial
tree




 kris jack – p16
radial tree (partial)




kris jack – p17
epe interface

   the visualisation is mounted in an epe interface that allows
    users to
       zoom in by right clicking on a graph area (in zoomed out mode) and zoom
        out by right clicking on a graph area that does not contain an actor (in
        zoomed in mode);
       pan within the graph by left clicking on a graph area and dragging in the
        direction to pan;
       search for an actor by typing the actor’s name in the search box. when the
        user starts to type a name, the mode changes to zoomed out mode and all
        actor nodes who’s names match the string are enlarged;
       change the preference towards an actor (like, dislike, neutral, no preference)
        by righting clicking on the actor’s node (in zoomed in mode);
       re-organise the graph to centre upon one actor by double left clicking on
        another actor node.



kris jack – p18
epe interface




kris jack – p19
kris jack – p20
4
user evaluation




kris jack – p21
evaluating the epe interface

   evaulated:
        choice of similarity metric in the context of actors
        type of preferences elicited
        epe interface's ease of use
        appreciation of the epe interface
   materials
        epe interface mounted with 3 different graphs:
          • organised graph (nodes positions according to actor similarity)
          • unorganised graph (organised graph with nodes randomised)
          • demonstration graph (organised graph with nodes randomised)
        each graph contained the same 500 nodes (most frequent actors from
         an in-house french database)
        instruction sheet



kris jack – p22
participants and procedure

 28 participants (14 male, 14 female)
 procedure
       practice the functions of the epe interface using the demonstration
        graph (took 10 minutes on average)
       task
         • enter as many actor-based preferences as possible in 5 minutes
         • once with the organised graph and once with the unorganised graph
           (following a within-subjects design with 2 groups of 14 participants)
         • note that the graphs were not named here, the tasks were referred to as
           task 1 and task 2
       participants completed a questionnaire on terminating the tasks




kris jack – p23
hypothesis and measurements

   hypothesis
        participants will find it easier to declare their preferences for actors in
         the organised graph task than in the unorganised graph task, within
         the same time period
   measuring the ease of declaring preferences
        quantity of preferences entered
        subjective questioning in the questionnaire




kris jack – p24
5
results




kris jack – p25
preference elicitation

   more preferences were entered using the organised graph:
        significant increase in 'like' preferences (34%)
        decrease in 'dislike' and 'neutral' preferences

                                          P ref erenc e Elic itation



                          60

                          50

                          40

                                                                                 Organised
                          30
                                                                                 Unorganised

                          20

                          10

                          0
                                 All       Like         Dislike        Neutral


kris jack – p26
perceived ease of entering
preferences
   participants reported that it was:
        easy to enter preferences using the organised graph
        neither easy nor difficult to enter preferences using the unorganised
         graph

                    ease of preference entry               mean
                    statements
                                                 organised    unorganised
                    "i found it easy to enter
                    my preferences."                3.96           3.36
                    "entering my preferences
                    demanded too much
                    effort" (mean reversed)         3.64           3.11
                                                    cronbach’s alpha = 0.80
kris jack – p27
perceived differences between graphs

 22 participants (79%) reported differences between the two
  graphs
 commented that the organised graph
        had been hand designed so that it was easier to navigate;
        rearranged itself based on the actors that the participant said that they liked;
        arranged the participant’s favourite actors together;
        had more connections between nodes;
        arranged actors together who:
           •   co-starred in the same films;
           •   shared the same nationality;
           •   shared the same degree of celebrity;
           •   were similar to one another.
   commented that the unorganised graph
        was less organised



kris jack – p28
appreciation of the epe interface

 participants enjoyed using the interface and would be happy
  using it again (mean = 4.11/5.00, sd = 0.99)
 suggested improvements
       preference changing. some participants did not like having to click
        twice to register a dislike and three times to enter a neutral
        preference.
       zooming in. some participants would have preferred a precise
        indication of the region into which they could zoom into before
        zooming.
       zooming out. some participants felt lost when zoomed in on the
        actors as they were not sure of where they were with respect to the
        entire map



kris jack – p29
6
discussion




kris jack – p30
discussion

   the participants mark more 'like' preferences with the
    organised graph (34%)
        find more actors who they like and less who they dislike or are neutral
         towards
        why?
          • in searching, participants tended to begin by using the search feature,
            then zoom in on their desired actor
          • when at the zoomed in level, they would pan around to find other
            actors.
          • actors who were in close proximity tended to be similar
          • similar actors tend to be liked too
        applications that can exploit likes better than dislikes may want to
         introduce semantic similarity in an epe interface


kris jack – p31
discussion

   how well did the notion of similarity come across?
        with only 5 minutes of exposure to each graph, the majority of
         participants found that one was organised and that the other was
         lesser so or not at all
        the word similar was repeatedly used by participants
        results serve to validate the use of the google distance metric in this
         area
        the similarity metric thus goes some way to replacing what is
         traditionally in the domain of human-design decisions
   the epe interface was very much appreciated
        participants liked it and wanted to use it again
        they commented that it was more like playing a game and not like
         entering their preferences



kris jack – p32
discussion

   participants report that the organised graph is easier to use
        an organised graph is easier to navigate than an unorganised
         graph
        they find more actors who they like
   addressing interface issues
        replace the right click to change a preference with three icons next to
         the node. a single click on the item will designate the corresponding
         preference
        offer a 'mini-map', with the absolute position of the main map
         indicated, that is always zoomed out




kris jack – p33
discussion

   when should the epe interface appear in the recommendation
    process?
        from the start, users should be able to use it
           • initial entry of preferences
        all throughout the recommendation process also
           • could be used to visualise learned or predicted preferences too, allowing the user to
             correct any mistakes at a visual level
   what other benefits does a similarity-based epe interface bring?
        users become aware of the notion of similarity as used by the system
        the logic of the system, in this case the positioning of actor nodes, becomes
         learned
        imagine a system that uses this form of similarity to produce non-exact results
         for searches (e.g. cannot fine any jackie chan films, would you like bruce lee
         films instead?)
        understanding the logic of the system is very important in developing trust in
         the system




kris jack – p34
7
conclusion




kris jack – p35
conclusion

 a new epe interface is introduced that can takes data and
  organises it based on a robust similarity metric
 data similarities are visualised into a pleasing tree-based graph
 users can navigate through the graph and explicitly enter their
  preferences for different items
 interface favours elicitation of 'like' preferences
       users enter 34% more 'like' preferences when the graph is organised with the
        similarity metric compared to when it is left unorganised
 users report a reduction in cognitive effort when using the
  organised graph
 the epe creation process is a robust and flexible solution to
  eliciting explicit user preferences in a recommendation system


kris jack – p36
the end

   many thanks for your attention




kris jack – p37

Weitere ähnliche Inhalte

Andere mochten auch

Anne Ysunza's Alaska Slideshow
Anne Ysunza's Alaska SlideshowAnne Ysunza's Alaska Slideshow
Anne Ysunza's Alaska Slideshowmmatheson
 
A Computational Model of Staged Language Acquisition
A Computational Model of Staged Language AcquisitionA Computational Model of Staged Language Acquisition
A Computational Model of Staged Language AcquisitionKris Jack
 
Mendeley Suggest: What will you read next?
Mendeley Suggest: What will you read next?Mendeley Suggest: What will you read next?
Mendeley Suggest: What will you read next?Kris Jack
 
Mendeley, putting data into the hands of researchers
Mendeley, putting data into the hands of researchersMendeley, putting data into the hands of researchers
Mendeley, putting data into the hands of researchersKris Jack
 
Cloud Elephants and Witches: A Big Data Tale from Mendeley
Cloud Elephants and Witches: A Big Data Tale from MendeleyCloud Elephants and Witches: A Big Data Tale from Mendeley
Cloud Elephants and Witches: A Big Data Tale from MendeleyKris Jack
 
From Syllables to Syntax: Investigating Staged Linguistic Development through...
From Syllables to Syntax: Investigating Staged Linguistic Development through...From Syllables to Syntax: Investigating Staged Linguistic Development through...
From Syllables to Syntax: Investigating Staged Linguistic Development through...Kris Jack
 
Mendeley: crowdsourcing and recommending research on a large scale
Mendeley: crowdsourcing and recommending research on a large scaleMendeley: crowdsourcing and recommending research on a large scale
Mendeley: crowdsourcing and recommending research on a large scaleKris Jack
 
Community school of music and arts project 1
Community school of music and arts project 1Community school of music and arts project 1
Community school of music and arts project 1gsk8er1925
 
Modern Perspectives on Recommender Systems and their Applications in Mendeley
Modern Perspectives on Recommender Systems and their Applications in MendeleyModern Perspectives on Recommender Systems and their Applications in Mendeley
Modern Perspectives on Recommender Systems and their Applications in MendeleyKris Jack
 
Mendeley Suggest: Engineering a Personalised Article Recommender System
Mendeley Suggest: Engineering a Personalised Article Recommender SystemMendeley Suggest: Engineering a Personalised Article Recommender System
Mendeley Suggest: Engineering a Personalised Article Recommender SystemKris Jack
 
Mendeley: Recommendation Systems for Academic Literature
Mendeley: Recommendation Systems for Academic LiteratureMendeley: Recommendation Systems for Academic Literature
Mendeley: Recommendation Systems for Academic LiteratureKris Jack
 

Andere mochten auch (12)

Anne Ysunza's Alaska Slideshow
Anne Ysunza's Alaska SlideshowAnne Ysunza's Alaska Slideshow
Anne Ysunza's Alaska Slideshow
 
A Computational Model of Staged Language Acquisition
A Computational Model of Staged Language AcquisitionA Computational Model of Staged Language Acquisition
A Computational Model of Staged Language Acquisition
 
Mendeley Suggest: What will you read next?
Mendeley Suggest: What will you read next?Mendeley Suggest: What will you read next?
Mendeley Suggest: What will you read next?
 
(2) ben 10_rounding[1]
(2) ben 10_rounding[1](2) ben 10_rounding[1]
(2) ben 10_rounding[1]
 
Mendeley, putting data into the hands of researchers
Mendeley, putting data into the hands of researchersMendeley, putting data into the hands of researchers
Mendeley, putting data into the hands of researchers
 
Cloud Elephants and Witches: A Big Data Tale from Mendeley
Cloud Elephants and Witches: A Big Data Tale from MendeleyCloud Elephants and Witches: A Big Data Tale from Mendeley
Cloud Elephants and Witches: A Big Data Tale from Mendeley
 
From Syllables to Syntax: Investigating Staged Linguistic Development through...
From Syllables to Syntax: Investigating Staged Linguistic Development through...From Syllables to Syntax: Investigating Staged Linguistic Development through...
From Syllables to Syntax: Investigating Staged Linguistic Development through...
 
Mendeley: crowdsourcing and recommending research on a large scale
Mendeley: crowdsourcing and recommending research on a large scaleMendeley: crowdsourcing and recommending research on a large scale
Mendeley: crowdsourcing and recommending research on a large scale
 
Community school of music and arts project 1
Community school of music and arts project 1Community school of music and arts project 1
Community school of music and arts project 1
 
Modern Perspectives on Recommender Systems and their Applications in Mendeley
Modern Perspectives on Recommender Systems and their Applications in MendeleyModern Perspectives on Recommender Systems and their Applications in Mendeley
Modern Perspectives on Recommender Systems and their Applications in Mendeley
 
Mendeley Suggest: Engineering a Personalised Article Recommender System
Mendeley Suggest: Engineering a Personalised Article Recommender SystemMendeley Suggest: Engineering a Personalised Article Recommender System
Mendeley Suggest: Engineering a Personalised Article Recommender System
 
Mendeley: Recommendation Systems for Academic Literature
Mendeley: Recommendation Systems for Academic LiteratureMendeley: Recommendation Systems for Academic Literature
Mendeley: Recommendation Systems for Academic Literature
 

Ähnlich wie improving explicit preference entry by visualising data similarities

Graph Neural Networks for Recommendations
Graph Neural Networks for RecommendationsGraph Neural Networks for Recommendations
Graph Neural Networks for RecommendationsWQ Fan
 
Graph Based Machine Learning with Applications to Media Analytics
Graph Based Machine Learning with Applications to Media AnalyticsGraph Based Machine Learning with Applications to Media Analytics
Graph Based Machine Learning with Applications to Media AnalyticsNYC Predictive Analytics
 
How to build recommender system
How to build recommender systemHow to build recommender system
How to build recommender systemMitko Gurbanski
 
Tag And Tag Based Recommender
Tag And Tag Based RecommenderTag And Tag Based Recommender
Tag And Tag Based Recommendergu wendong
 
Exploring highly interconnected humanities data: are faceted browsers always ...
Exploring highly interconnected humanities data: are faceted browsers always ...Exploring highly interconnected humanities data: are faceted browsers always ...
Exploring highly interconnected humanities data: are faceted browsers always ...Michele Pasin
 
MobiSys Seminar - Nov 4 2008
MobiSys Seminar - Nov 4 2008MobiSys Seminar - Nov 4 2008
MobiSys Seminar - Nov 4 2008Neal Lathia
 
Recommender Systems from A to Z – The Right Dataset
Recommender Systems from A to Z – The Right DatasetRecommender Systems from A to Z – The Right Dataset
Recommender Systems from A to Z – The Right DatasetCrossing Minds
 
Neo4j MeetUp - Graph Exploration with MetaExp
Neo4j MeetUp - Graph Exploration with MetaExpNeo4j MeetUp - Graph Exploration with MetaExp
Neo4j MeetUp - Graph Exploration with MetaExpAdrian Ziegler
 
DH11: Browsing Highly Interconnected Humanities Databases Through Multi-Resul...
DH11: Browsing Highly Interconnected Humanities Databases Through Multi-Resul...DH11: Browsing Highly Interconnected Humanities Databases Through Multi-Resul...
DH11: Browsing Highly Interconnected Humanities Databases Through Multi-Resul...Michele Pasin
 
Optimizing Search Interactions within Professional Social Networks (thesis p...
Optimizing Search Interactions within Professional Social Networks (thesis p...Optimizing Search Interactions within Professional Social Networks (thesis p...
Optimizing Search Interactions within Professional Social Networks (thesis p...Nik Spirin
 
Music recommendations @ MLConf 2014
Music recommendations @ MLConf 2014Music recommendations @ MLConf 2014
Music recommendations @ MLConf 2014Erik Bernhardsson
 
[IRTalks@The University of Glasgow] A Topology-aware Analysis of Graph Collab...
[IRTalks@The University of Glasgow] A Topology-aware Analysis of Graph Collab...[IRTalks@The University of Glasgow] A Topology-aware Analysis of Graph Collab...
[IRTalks@The University of Glasgow] A Topology-aware Analysis of Graph Collab...Daniele Malitesta
 
FOSDEM2014 - Social Network Benchmark (SNB) Graph Generator - Peter Boncz
FOSDEM2014 - Social Network Benchmark (SNB) Graph Generator - Peter BonczFOSDEM2014 - Social Network Benchmark (SNB) Graph Generator - Peter Boncz
FOSDEM2014 - Social Network Benchmark (SNB) Graph Generator - Peter BonczIoan Toma
 
Virtual Graphs & Graph Views in Cypher
Virtual Graphs & Graph Views in CypherVirtual Graphs & Graph Views in Cypher
Virtual Graphs & Graph Views in CypheropenCypher
 
Knowledge Graph Embeddings for Recommender Systems
Knowledge Graph Embeddings for Recommender SystemsKnowledge Graph Embeddings for Recommender Systems
Knowledge Graph Embeddings for Recommender SystemsEnrico Palumbo
 
Facets and Pivoting for Flexible and Usable Linked Data Exploration
Facets and Pivoting for Flexible and Usable Linked Data ExplorationFacets and Pivoting for Flexible and Usable Linked Data Exploration
Facets and Pivoting for Flexible and Usable Linked Data ExplorationRoberto García
 
Optimizing Search User Interfaces and Interactions within Professional Social...
Optimizing Search User Interfaces and Interactions within Professional Social...Optimizing Search User Interfaces and Interactions within Professional Social...
Optimizing Search User Interfaces and Interactions within Professional Social...Nik Spirin
 
Social network analysis
Social network analysisSocial network analysis
Social network analysisSohom Ghosh
 
Master Thesis: The Design of a Rich Internet Application for Exploratory Sear...
Master Thesis: The Design of a Rich Internet Application for Exploratory Sear...Master Thesis: The Design of a Rich Internet Application for Exploratory Sear...
Master Thesis: The Design of a Rich Internet Application for Exploratory Sear...Roman Atachiants
 

Ähnlich wie improving explicit preference entry by visualising data similarities (20)

Graph Neural Networks for Recommendations
Graph Neural Networks for RecommendationsGraph Neural Networks for Recommendations
Graph Neural Networks for Recommendations
 
Graph Based Machine Learning with Applications to Media Analytics
Graph Based Machine Learning with Applications to Media AnalyticsGraph Based Machine Learning with Applications to Media Analytics
Graph Based Machine Learning with Applications to Media Analytics
 
How to build recommender system
How to build recommender systemHow to build recommender system
How to build recommender system
 
Tag And Tag Based Recommender
Tag And Tag Based RecommenderTag And Tag Based Recommender
Tag And Tag Based Recommender
 
Domainspecificsubgraph extraction ieee-bigdata2016
Domainspecificsubgraph extraction ieee-bigdata2016Domainspecificsubgraph extraction ieee-bigdata2016
Domainspecificsubgraph extraction ieee-bigdata2016
 
Exploring highly interconnected humanities data: are faceted browsers always ...
Exploring highly interconnected humanities data: are faceted browsers always ...Exploring highly interconnected humanities data: are faceted browsers always ...
Exploring highly interconnected humanities data: are faceted browsers always ...
 
MobiSys Seminar - Nov 4 2008
MobiSys Seminar - Nov 4 2008MobiSys Seminar - Nov 4 2008
MobiSys Seminar - Nov 4 2008
 
Recommender Systems from A to Z – The Right Dataset
Recommender Systems from A to Z – The Right DatasetRecommender Systems from A to Z – The Right Dataset
Recommender Systems from A to Z – The Right Dataset
 
Neo4j MeetUp - Graph Exploration with MetaExp
Neo4j MeetUp - Graph Exploration with MetaExpNeo4j MeetUp - Graph Exploration with MetaExp
Neo4j MeetUp - Graph Exploration with MetaExp
 
DH11: Browsing Highly Interconnected Humanities Databases Through Multi-Resul...
DH11: Browsing Highly Interconnected Humanities Databases Through Multi-Resul...DH11: Browsing Highly Interconnected Humanities Databases Through Multi-Resul...
DH11: Browsing Highly Interconnected Humanities Databases Through Multi-Resul...
 
Optimizing Search Interactions within Professional Social Networks (thesis p...
Optimizing Search Interactions within Professional Social Networks (thesis p...Optimizing Search Interactions within Professional Social Networks (thesis p...
Optimizing Search Interactions within Professional Social Networks (thesis p...
 
Music recommendations @ MLConf 2014
Music recommendations @ MLConf 2014Music recommendations @ MLConf 2014
Music recommendations @ MLConf 2014
 
[IRTalks@The University of Glasgow] A Topology-aware Analysis of Graph Collab...
[IRTalks@The University of Glasgow] A Topology-aware Analysis of Graph Collab...[IRTalks@The University of Glasgow] A Topology-aware Analysis of Graph Collab...
[IRTalks@The University of Glasgow] A Topology-aware Analysis of Graph Collab...
 
FOSDEM2014 - Social Network Benchmark (SNB) Graph Generator - Peter Boncz
FOSDEM2014 - Social Network Benchmark (SNB) Graph Generator - Peter BonczFOSDEM2014 - Social Network Benchmark (SNB) Graph Generator - Peter Boncz
FOSDEM2014 - Social Network Benchmark (SNB) Graph Generator - Peter Boncz
 
Virtual Graphs & Graph Views in Cypher
Virtual Graphs & Graph Views in CypherVirtual Graphs & Graph Views in Cypher
Virtual Graphs & Graph Views in Cypher
 
Knowledge Graph Embeddings for Recommender Systems
Knowledge Graph Embeddings for Recommender SystemsKnowledge Graph Embeddings for Recommender Systems
Knowledge Graph Embeddings for Recommender Systems
 
Facets and Pivoting for Flexible and Usable Linked Data Exploration
Facets and Pivoting for Flexible and Usable Linked Data ExplorationFacets and Pivoting for Flexible and Usable Linked Data Exploration
Facets and Pivoting for Flexible and Usable Linked Data Exploration
 
Optimizing Search User Interfaces and Interactions within Professional Social...
Optimizing Search User Interfaces and Interactions within Professional Social...Optimizing Search User Interfaces and Interactions within Professional Social...
Optimizing Search User Interfaces and Interactions within Professional Social...
 
Social network analysis
Social network analysisSocial network analysis
Social network analysis
 
Master Thesis: The Design of a Rich Internet Application for Exploratory Sear...
Master Thesis: The Design of a Rich Internet Application for Exploratory Sear...Master Thesis: The Design of a Rich Internet Application for Exploratory Sear...
Master Thesis: The Design of a Rich Internet Application for Exploratory Sear...
 

Kürzlich hochgeladen

PicPay - GenAI Finance Assistant - ChatGPT for Customer Service
PicPay - GenAI Finance Assistant - ChatGPT for Customer ServicePicPay - GenAI Finance Assistant - ChatGPT for Customer Service
PicPay - GenAI Finance Assistant - ChatGPT for Customer ServiceRenan Moreira de Oliveira
 
NIST Cybersecurity Framework (CSF) 2.0 Workshop
NIST Cybersecurity Framework (CSF) 2.0 WorkshopNIST Cybersecurity Framework (CSF) 2.0 Workshop
NIST Cybersecurity Framework (CSF) 2.0 WorkshopBachir Benyammi
 
Do we need a new standard for visualizing the invisible?
Do we need a new standard for visualizing the invisible?Do we need a new standard for visualizing the invisible?
Do we need a new standard for visualizing the invisible?SANGHEE SHIN
 
Comparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioComparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioChristian Posta
 
Computer 10: Lesson 10 - Online Crimes and Hazards
Computer 10: Lesson 10 - Online Crimes and HazardsComputer 10: Lesson 10 - Online Crimes and Hazards
Computer 10: Lesson 10 - Online Crimes and HazardsSeth Reyes
 
Linked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond OntologiesLinked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond OntologiesDavid Newbury
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1DianaGray10
 
Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.YounusS2
 
COMPUTER 10: Lesson 7 - File Storage and Online Collaboration
COMPUTER 10: Lesson 7 - File Storage and Online CollaborationCOMPUTER 10: Lesson 7 - File Storage and Online Collaboration
COMPUTER 10: Lesson 7 - File Storage and Online Collaborationbruanjhuli
 
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationUsing IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationIES VE
 
Machine Learning Model Validation (Aijun Zhang 2024).pdf
Machine Learning Model Validation (Aijun Zhang 2024).pdfMachine Learning Model Validation (Aijun Zhang 2024).pdf
Machine Learning Model Validation (Aijun Zhang 2024).pdfAijun Zhang
 
Videogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfVideogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfinfogdgmi
 
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...Aggregage
 
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdfIaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdfDaniel Santiago Silva Capera
 
Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024SkyPlanner
 
Cloud Revolution: Exploring the New Wave of Serverless Spatial Data
Cloud Revolution: Exploring the New Wave of Serverless Spatial DataCloud Revolution: Exploring the New Wave of Serverless Spatial Data
Cloud Revolution: Exploring the New Wave of Serverless Spatial DataSafe Software
 
Introduction to Quantum Computing
Introduction to Quantum ComputingIntroduction to Quantum Computing
Introduction to Quantum ComputingGDSC PJATK
 
Introduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptxIntroduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptxMatsuo Lab
 
UiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation DevelopersUiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation DevelopersUiPathCommunity
 
Nanopower In Semiconductor Industry.pdf
Nanopower  In Semiconductor Industry.pdfNanopower  In Semiconductor Industry.pdf
Nanopower In Semiconductor Industry.pdfPedro Manuel
 

Kürzlich hochgeladen (20)

PicPay - GenAI Finance Assistant - ChatGPT for Customer Service
PicPay - GenAI Finance Assistant - ChatGPT for Customer ServicePicPay - GenAI Finance Assistant - ChatGPT for Customer Service
PicPay - GenAI Finance Assistant - ChatGPT for Customer Service
 
NIST Cybersecurity Framework (CSF) 2.0 Workshop
NIST Cybersecurity Framework (CSF) 2.0 WorkshopNIST Cybersecurity Framework (CSF) 2.0 Workshop
NIST Cybersecurity Framework (CSF) 2.0 Workshop
 
Do we need a new standard for visualizing the invisible?
Do we need a new standard for visualizing the invisible?Do we need a new standard for visualizing the invisible?
Do we need a new standard for visualizing the invisible?
 
Comparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioComparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and Istio
 
Computer 10: Lesson 10 - Online Crimes and Hazards
Computer 10: Lesson 10 - Online Crimes and HazardsComputer 10: Lesson 10 - Online Crimes and Hazards
Computer 10: Lesson 10 - Online Crimes and Hazards
 
Linked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond OntologiesLinked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond Ontologies
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
 
Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.
 
COMPUTER 10: Lesson 7 - File Storage and Online Collaboration
COMPUTER 10: Lesson 7 - File Storage and Online CollaborationCOMPUTER 10: Lesson 7 - File Storage and Online Collaboration
COMPUTER 10: Lesson 7 - File Storage and Online Collaboration
 
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationUsing IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
 
Machine Learning Model Validation (Aijun Zhang 2024).pdf
Machine Learning Model Validation (Aijun Zhang 2024).pdfMachine Learning Model Validation (Aijun Zhang 2024).pdf
Machine Learning Model Validation (Aijun Zhang 2024).pdf
 
Videogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfVideogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdf
 
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
 
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdfIaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
 
Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024Salesforce Miami User Group Event - 1st Quarter 2024
Salesforce Miami User Group Event - 1st Quarter 2024
 
Cloud Revolution: Exploring the New Wave of Serverless Spatial Data
Cloud Revolution: Exploring the New Wave of Serverless Spatial DataCloud Revolution: Exploring the New Wave of Serverless Spatial Data
Cloud Revolution: Exploring the New Wave of Serverless Spatial Data
 
Introduction to Quantum Computing
Introduction to Quantum ComputingIntroduction to Quantum Computing
Introduction to Quantum Computing
 
Introduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptxIntroduction to Matsuo Laboratory (ENG).pptx
Introduction to Matsuo Laboratory (ENG).pptx
 
UiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation DevelopersUiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation Developers
 
Nanopower In Semiconductor Industry.pdf
Nanopower  In Semiconductor Industry.pdfNanopower  In Semiconductor Industry.pdf
Nanopower In Semiconductor Industry.pdf
 

improving explicit preference entry by visualising data similarities

  • 1. improving explicit preference entry by visualising data similarities kris jack and florence duclaye 13 january 2008
  • 2. summary 1 the problem in context 2 background 3 proposed solution 4 user evaluation 5 results 6 discussion 7 conclusion kris jack – p2
  • 3. 1 the problem in context kris jack – p3
  • 4. context  general context  recommender systems attempt to offer items to users that will be appreciated  the quality of these recommendations is largely constrained by the data • a user’s preferences • domain-specific ‘general knowledge' • the items that can be recommended • previous users’ opinions of items  the acquisition of such data is of central importance  specific context  a hybrid content-based and collaborative filtering recommendation system  the system will be implemented in the domain of cinema  the user can explicit enter their preferences kris jack – p4
  • 5. the problem  entering your preferences explicitly  can be boring  can be difficult  ifa system is too much trouble to use, then it simply won't be used  how can we improve the explicit preference entry process?  maximise the number of explicit preferences that could be elicited within a given period of time kris jack – p5
  • 7. definitions  preferences, many types and definitions exist  concentrating on the elicitation of monadic preferences  represent a user’s like, dislike, or indifference towards an item or item attribute (e.g. “i like tim burton”, “i dislike horror movies” and “i love kill bill”)  preference acquisition strategies  explicit – user explicitly enters their preferences  implicit – learning strategies that are non-invasive (e.g. user-profiling and collaborative filtering)  explicit preference entry (epe) interface  an interface that asks users to explicitly give their preferences towards items and item attributes (e.g. “i love comedies”) kris jack – p7
  • 8. some existing epe interfaces  recommenders with epe interfaces  minekey (www.minekey.com)  stumbleupon (www.stumbleupon.com)  movielens  drawbacks  boring to use minekey  difficult to be inspired (when guidance is lacking)  difficult to describe yourself in their terms at times kris jack – p8 stumbleupon
  • 9. data visualisation  perhaps we can improve epe interfaces by visualising data  data visualisation techniques have had some success in recommenders  music plasma (www.musicplasma.com)  amaznode (amaznode.fladdict.net/) music plasma amaznode kris jack – p9
  • 11. visualising data similarity in an epe interface  the epe interface  should encourage users to enter their preferences  may guide users based upon the preferences required  should be enjoyable to use and not boring  the epe interface creation process  must be robust and reliable  desirable if it is automated from start to finish  creation process summary  input a list of items or item descriptors (e.g. actors)  using a similarity metric, find the similarities between data elements  visualise the similarities between the data elements kris jack – p11
  • 12. instantiating the system's semantic knowledge  the system's semantic knowledge describes the similarity between descriptors in the database  the notion of similarity is necessarily subjective  how similar do you find these two actors? (robert de niro and al pacino) kris jack – p12
  • 13. strategies for defining semantic similarities  considered  instantiation by hand  differencing mechanism  co-occurrence measures  clustering algorithms  collaborative filtering techniques  opted for one based on co-occurrences of actor names found using the google search estimates max{log f (i1),log f (i 2)} − log f ( i1, i 2) d (i1, i 2 ) = log M − min{log f (i1),log f (i 2)} where m is the total number of pages considered, f(i1) and f(i2) are the number of hits for i1 and i2 respectively, and f(i1,i2) is the number of hits for the co-occurrence of i1 and i2.  in essence, the more often two items appear together on the same web pages, the more similar they are  the measure of semantic relatedness server provides free access kris jack – p13
  • 14. normalised google distance actors jackie chan bruce lee jane fonda jackie 2,420,000 965,000 145,000 chan (0.0) (0.09) (0.26) bruce 965,000 2,630,000 46,700 lee (0.09) (0.0) (0.37) jane 145,000 46,700 1,930,000 fonda (0.26) (0.37) (0.0) the number of google hits for actor pairs and their normalized google distances given in brackets (the smaller the distance, the more similar the actors) kris jack – p14
  • 15. data visualisation  use of the radial tree layout to visualise data similarities  manageable linear complexity in laying out the tree • efficient even with several hundreds of nodes  the more similar two items are, the closer their proximity in the graph  a radial layout encourages users to explore the tree in a less hierarchical fashion as it is unclear where the root node is  tree can be focussed upon any node in the tree (implementing a smooth transition animation) • users have previously found this form of visualisation attractive  implementation available in prefuse (www.prefuse.com) library  strategy  each item (actor) is represented by a node in the tree  connect every node with their two closest nodes (using item similarity) kris jack – p15
  • 18. epe interface  the visualisation is mounted in an epe interface that allows users to  zoom in by right clicking on a graph area (in zoomed out mode) and zoom out by right clicking on a graph area that does not contain an actor (in zoomed in mode);  pan within the graph by left clicking on a graph area and dragging in the direction to pan;  search for an actor by typing the actor’s name in the search box. when the user starts to type a name, the mode changes to zoomed out mode and all actor nodes who’s names match the string are enlarged;  change the preference towards an actor (like, dislike, neutral, no preference) by righting clicking on the actor’s node (in zoomed in mode);  re-organise the graph to centre upon one actor by double left clicking on another actor node. kris jack – p18
  • 22. evaluating the epe interface  evaulated:  choice of similarity metric in the context of actors  type of preferences elicited  epe interface's ease of use  appreciation of the epe interface  materials  epe interface mounted with 3 different graphs: • organised graph (nodes positions according to actor similarity) • unorganised graph (organised graph with nodes randomised) • demonstration graph (organised graph with nodes randomised)  each graph contained the same 500 nodes (most frequent actors from an in-house french database)  instruction sheet kris jack – p22
  • 23. participants and procedure  28 participants (14 male, 14 female)  procedure  practice the functions of the epe interface using the demonstration graph (took 10 minutes on average)  task • enter as many actor-based preferences as possible in 5 minutes • once with the organised graph and once with the unorganised graph (following a within-subjects design with 2 groups of 14 participants) • note that the graphs were not named here, the tasks were referred to as task 1 and task 2  participants completed a questionnaire on terminating the tasks kris jack – p23
  • 24. hypothesis and measurements  hypothesis  participants will find it easier to declare their preferences for actors in the organised graph task than in the unorganised graph task, within the same time period  measuring the ease of declaring preferences  quantity of preferences entered  subjective questioning in the questionnaire kris jack – p24
  • 26. preference elicitation  more preferences were entered using the organised graph:  significant increase in 'like' preferences (34%)  decrease in 'dislike' and 'neutral' preferences P ref erenc e Elic itation 60 50 40 Organised 30 Unorganised 20 10 0 All Like Dislike Neutral kris jack – p26
  • 27. perceived ease of entering preferences  participants reported that it was:  easy to enter preferences using the organised graph  neither easy nor difficult to enter preferences using the unorganised graph ease of preference entry mean statements organised unorganised "i found it easy to enter my preferences." 3.96 3.36 "entering my preferences demanded too much effort" (mean reversed) 3.64 3.11 cronbach’s alpha = 0.80 kris jack – p27
  • 28. perceived differences between graphs  22 participants (79%) reported differences between the two graphs  commented that the organised graph  had been hand designed so that it was easier to navigate;  rearranged itself based on the actors that the participant said that they liked;  arranged the participant’s favourite actors together;  had more connections between nodes;  arranged actors together who: • co-starred in the same films; • shared the same nationality; • shared the same degree of celebrity; • were similar to one another.  commented that the unorganised graph  was less organised kris jack – p28
  • 29. appreciation of the epe interface  participants enjoyed using the interface and would be happy using it again (mean = 4.11/5.00, sd = 0.99)  suggested improvements  preference changing. some participants did not like having to click twice to register a dislike and three times to enter a neutral preference.  zooming in. some participants would have preferred a precise indication of the region into which they could zoom into before zooming.  zooming out. some participants felt lost when zoomed in on the actors as they were not sure of where they were with respect to the entire map kris jack – p29
  • 31. discussion  the participants mark more 'like' preferences with the organised graph (34%)  find more actors who they like and less who they dislike or are neutral towards  why? • in searching, participants tended to begin by using the search feature, then zoom in on their desired actor • when at the zoomed in level, they would pan around to find other actors. • actors who were in close proximity tended to be similar • similar actors tend to be liked too  applications that can exploit likes better than dislikes may want to introduce semantic similarity in an epe interface kris jack – p31
  • 32. discussion  how well did the notion of similarity come across?  with only 5 minutes of exposure to each graph, the majority of participants found that one was organised and that the other was lesser so or not at all  the word similar was repeatedly used by participants  results serve to validate the use of the google distance metric in this area  the similarity metric thus goes some way to replacing what is traditionally in the domain of human-design decisions  the epe interface was very much appreciated  participants liked it and wanted to use it again  they commented that it was more like playing a game and not like entering their preferences kris jack – p32
  • 33. discussion  participants report that the organised graph is easier to use  an organised graph is easier to navigate than an unorganised graph  they find more actors who they like  addressing interface issues  replace the right click to change a preference with three icons next to the node. a single click on the item will designate the corresponding preference  offer a 'mini-map', with the absolute position of the main map indicated, that is always zoomed out kris jack – p33
  • 34. discussion  when should the epe interface appear in the recommendation process?  from the start, users should be able to use it • initial entry of preferences  all throughout the recommendation process also • could be used to visualise learned or predicted preferences too, allowing the user to correct any mistakes at a visual level  what other benefits does a similarity-based epe interface bring?  users become aware of the notion of similarity as used by the system  the logic of the system, in this case the positioning of actor nodes, becomes learned  imagine a system that uses this form of similarity to produce non-exact results for searches (e.g. cannot fine any jackie chan films, would you like bruce lee films instead?)  understanding the logic of the system is very important in developing trust in the system kris jack – p34
  • 36. conclusion  a new epe interface is introduced that can takes data and organises it based on a robust similarity metric  data similarities are visualised into a pleasing tree-based graph  users can navigate through the graph and explicitly enter their preferences for different items  interface favours elicitation of 'like' preferences  users enter 34% more 'like' preferences when the graph is organised with the similarity metric compared to when it is left unorganised  users report a reduction in cognitive effort when using the organised graph  the epe creation process is a robust and flexible solution to eliciting explicit user preferences in a recommendation system kris jack – p36
  • 37. the end  many thanks for your attention kris jack – p37